/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/ps4-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 20:00:42,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 20:00:42,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 20:00:42,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 20:00:42,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 20:00:42,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 20:00:42,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 20:00:42,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 20:00:42,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 20:00:42,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 20:00:42,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 20:00:42,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 20:00:42,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 20:00:42,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 20:00:42,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 20:00:42,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 20:00:42,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 20:00:42,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 20:00:42,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 20:00:42,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 20:00:42,727 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 20:00:42,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 20:00:42,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 20:00:42,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 20:00:42,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 20:00:42,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 20:00:42,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 20:00:42,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 20:00:42,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 20:00:42,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 20:00:42,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 20:00:42,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 20:00:42,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 20:00:42,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 20:00:42,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 20:00:42,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 20:00:42,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 20:00:42,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 20:00:42,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 20:00:42,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 20:00:42,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 20:00:42,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 20:00:42,744 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 20:00:42,756 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 20:00:42,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 20:00:42,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 20:00:42,757 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 20:00:42,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 20:00:42,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 20:00:42,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 20:00:42,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 20:00:42,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 20:00:42,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 20:00:42,758 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 20:00:42,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 20:00:42,758 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 20:00:42,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 20:00:42,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 20:00:42,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 20:00:42,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 20:00:42,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 20:00:42,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:00:42,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 20:00:42,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 20:00:42,760 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 20:00:42,760 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:00:42,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 20:00:42,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 20:00:42,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 20:00:42,972 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 20:00:42,973 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 20:00:42,974 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound10.c [2022-04-27 20:00:43,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a51e45f4/4c330c9c942d40549bddbf160316f76d/FLAGec845e1ae [2022-04-27 20:00:43,390 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 20:00:43,391 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound10.c [2022-04-27 20:00:43,403 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a51e45f4/4c330c9c942d40549bddbf160316f76d/FLAGec845e1ae [2022-04-27 20:00:43,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a51e45f4/4c330c9c942d40549bddbf160316f76d [2022-04-27 20:00:43,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 20:00:43,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 20:00:43,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 20:00:43,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 20:00:43,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 20:00:43,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:00:43" (1/1) ... [2022-04-27 20:00:43,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6646aa77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:00:43, skipping insertion in model container [2022-04-27 20:00:43,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:00:43" (1/1) ... [2022-04-27 20:00:43,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 20:00:43,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 20:00:43,578 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/ps4-ll_valuebound10.c[458,471] [2022-04-27 20:00:43,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:00:43,619 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 20:00:43,629 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/ps4-ll_valuebound10.c[458,471] [2022-04-27 20:00:43,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:00:43,643 INFO L208 MainTranslator]: Completed translation [2022-04-27 20:00:43,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:00:43 WrapperNode [2022-04-27 20:00:43,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 20:00:43,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 20:00:43,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 20:00:43,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 20:00:43,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:00:43" (1/1) ... [2022-04-27 20:00:43,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:00:43" (1/1) ... [2022-04-27 20:00:43,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:00:43" (1/1) ... [2022-04-27 20:00:43,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:00:43" (1/1) ... [2022-04-27 20:00:43,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:00:43" (1/1) ... [2022-04-27 20:00:43,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:00:43" (1/1) ... [2022-04-27 20:00:43,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:00:43" (1/1) ... [2022-04-27 20:00:43,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 20:00:43,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 20:00:43,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 20:00:43,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 20:00:43,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:00:43" (1/1) ... [2022-04-27 20:00:43,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:00:43,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:00:43,692 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:00:43,703 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:00:43,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 20:00:43,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 20:00:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 20:00:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 20:00:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 20:00:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 20:00:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 20:00:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 20:00:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 20:00:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 20:00:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 20:00:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 20:00:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 20:00:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 20:00:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 20:00:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 20:00:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 20:00:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 20:00:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 20:00:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 20:00:43,769 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 20:00:43,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 20:00:43,908 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 20:00:43,916 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 20:00:43,916 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 20:00:43,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:00:43 BoogieIcfgContainer [2022-04-27 20:00:43,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 20:00:43,918 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 20:00:43,918 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 20:00:43,939 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 20:00:43,953 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:00:43" (1/1) ... [2022-04-27 20:00:43,955 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 20:00:43,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:00:43 BasicIcfg [2022-04-27 20:00:43,983 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 20:00:43,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 20:00:43,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 20:00:43,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 20:00:43,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 08:00:43" (1/4) ... [2022-04-27 20:00:43,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e779fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:00:43, skipping insertion in model container [2022-04-27 20:00:43,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:00:43" (2/4) ... [2022-04-27 20:00:43,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e779fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:00:43, skipping insertion in model container [2022-04-27 20:00:43,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:00:43" (3/4) ... [2022-04-27 20:00:43,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e779fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:00:43, skipping insertion in model container [2022-04-27 20:00:43,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:00:43" (4/4) ... [2022-04-27 20:00:43,987 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound10.cJordan [2022-04-27 20:00:43,996 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 20:00:43,996 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 20:00:44,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 20:00:44,053 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@5fc406a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9574f63 [2022-04-27 20:00:44,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 20:00:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:00:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 20:00:44,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:00:44,087 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:00:44,087 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:00:44,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:00:44,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1885409022, now seen corresponding path program 1 times [2022-04-27 20:00:44,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:00:44,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014194058] [2022-04-27 20:00:44,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:44,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:00:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:00:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:44,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {31#true} is VALID [2022-04-27 20:00:44,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 20:00:44,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 20:00:44,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 20:00:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:44,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {31#true} is VALID [2022-04-27 20:00:44,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} [75] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 20:00:44,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 20:00:44,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#false} is VALID [2022-04-27 20:00:44,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:00:44,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {31#true} is VALID [2022-04-27 20:00:44,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 20:00:44,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 20:00:44,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 20:00:44,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {31#true} is VALID [2022-04-27 20:00:44,287 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {31#true} is VALID [2022-04-27 20:00:44,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {31#true} is VALID [2022-04-27 20:00:44,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} [75] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 20:00:44,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 20:00:44,288 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#false} is VALID [2022-04-27 20:00:44,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {32#false} is VALID [2022-04-27 20:00:44,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} [72] L27-2-->L27-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 20:00:44,289 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} [77] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~k~0_9 v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 v_main_~y~0_9))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_9, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {32#false} is VALID [2022-04-27 20:00:44,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {32#false} is VALID [2022-04-27 20:00:44,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 20:00:44,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 20:00:44,290 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:00:44,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:00:44,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014194058] [2022-04-27 20:00:44,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014194058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:00:44,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:00:44,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 20:00:44,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511906890] [2022-04-27 20:00:44,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:00:44,295 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:00:44,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:00:44,298 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:00:44,315 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:00:44,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 20:00:44,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:00:44,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 20:00:44,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 20:00:44,334 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:00:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:44,434 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 20:00:44,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 20:00:44,435 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:00:44,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:00:44,436 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:00:44,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-27 20:00:44,445 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:00:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-27 20:00:44,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-27 20:00:44,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:44,496 INFO L225 Difference]: With dead ends: 28 [2022-04-27 20:00:44,497 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 20:00:44,498 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:00:44,500 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:00:44,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:00:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 20:00:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 20:00:44,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:00:44,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:00:44,518 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:00:44,519 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:00:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:44,523 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 20:00:44,523 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 20:00:44,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:44,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:44,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 20:00:44,524 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 20:00:44,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:44,526 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 20:00:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 20:00:44,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:44,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:44,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:00:44,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:00:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:00:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-27 20:00:44,530 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-27 20:00:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:00:44,531 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-27 20:00:44,531 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:00:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 20:00:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 20:00:44,531 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:00:44,531 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:00:44,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 20:00:44,532 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:00:44,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:00:44,532 INFO L85 PathProgramCache]: Analyzing trace with hash 603980644, now seen corresponding path program 1 times [2022-04-27 20:00:44,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:00:44,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356844727] [2022-04-27 20:00:44,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:44,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:00:44,556 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:00:44,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758210059] [2022-04-27 20:00:44,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:44,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:00:44,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:00:44,558 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:00:44,559 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:00:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:44,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 20:00:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:44,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:00:44,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {140#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-27 20:00:44,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {140#true} is VALID [2022-04-27 20:00:44,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-27 20:00:44,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140#true} {140#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-27 20:00:44,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {140#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-27 20:00:44,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {140#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {140#true} is VALID [2022-04-27 20:00:44,695 INFO L272 TraceCheckUtils]: 6: Hoare triple {140#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {140#true} is VALID [2022-04-27 20:00:44,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {140#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {140#true} is VALID [2022-04-27 20:00:44,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#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[] {140#true} is VALID [2022-04-27 20:00:44,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-27 20:00:44,695 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {140#true} {140#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {140#true} is VALID [2022-04-27 20:00:44,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {178#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:44,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {178#(and (= main_~x~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:44,697 INFO L272 TraceCheckUtils]: 13: Hoare triple {178#(and (= main_~x~0 0) (= main_~y~0 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {185#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:00:44,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {185#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {189#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:00:44,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {189#(<= 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[] {141#false} is VALID [2022-04-27 20:00:44,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {141#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141#false} is VALID [2022-04-27 20:00:44,698 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:00:44,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 20:00:44,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:00:44,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356844727] [2022-04-27 20:00:44,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:00:44,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758210059] [2022-04-27 20:00:44,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758210059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:00:44,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:00:44,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 20:00:44,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516194530] [2022-04-27 20:00:44,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:00:44,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 20:00:44,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:00:44,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:00:44,712 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:00:44,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 20:00:44,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:00:44,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 20:00:44,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:00:44,713 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:00:44,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:44,876 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-27 20:00:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 20:00:44,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 20:00:44,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:00:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:00:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 20:00:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:00:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 20:00:44,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-27 20:00:44,917 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:00:44,920 INFO L225 Difference]: With dead ends: 32 [2022-04-27 20:00:44,920 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 20:00:44,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 20:00:44,922 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:00:44,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:00:44,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 20:00:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 20:00:44,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:00:44,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:00:44,929 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:00:44,929 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:00:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:44,938 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 20:00:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 20:00:44,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:44,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:44,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 20:00:44,939 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 20:00:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:44,940 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 20:00:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 20:00:44,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:44,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:44,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:00:44,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:00:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:00:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-27 20:00:44,943 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-27 20:00:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:00:44,943 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-27 20:00:44,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:00:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 20:00:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 20:00:44,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:00:44,944 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:00:44,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 20:00:45,160 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:00:45,161 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:00:45,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:00:45,162 INFO L85 PathProgramCache]: Analyzing trace with hash -169450186, now seen corresponding path program 1 times [2022-04-27 20:00:45,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:00:45,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784530987] [2022-04-27 20:00:45,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:45,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:00:45,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:00:45,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [981430241] [2022-04-27 20:00:45,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:45,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:00:45,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:00:45,176 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:00:45,177 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:00:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:45,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 20:00:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:45,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:00:45,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {319#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#true} is VALID [2022-04-27 20:00:45,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {319#true} is VALID [2022-04-27 20:00:45,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {319#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#true} is VALID [2022-04-27 20:00:45,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {319#true} {319#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#true} is VALID [2022-04-27 20:00:45,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {319#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#true} is VALID [2022-04-27 20:00:45,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {319#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {319#true} is VALID [2022-04-27 20:00:45,398 INFO L272 TraceCheckUtils]: 6: Hoare triple {319#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {319#true} is VALID [2022-04-27 20:00:45,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {319#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {319#true} is VALID [2022-04-27 20:00:45,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {319#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[] {319#true} is VALID [2022-04-27 20:00:45,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {319#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#true} is VALID [2022-04-27 20:00:45,403 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {319#true} {319#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {319#true} is VALID [2022-04-27 20:00:45,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {319#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {357#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:45,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {357#(and (= main_~x~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {357#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:45,405 INFO L272 TraceCheckUtils]: 13: Hoare triple {357#(and (= main_~x~0 0) (= main_~y~0 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {319#true} is VALID [2022-04-27 20:00:45,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {319#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {319#true} is VALID [2022-04-27 20:00:45,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {319#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[] {319#true} is VALID [2022-04-27 20:00:45,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {319#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#true} is VALID [2022-04-27 20:00:45,408 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {319#true} {357#(and (= main_~x~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_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#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:45,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {357#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {379#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 20:00:45,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {379#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 20:00:45,410 INFO L272 TraceCheckUtils]: 20: Hoare triple {379#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {386#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:00:45,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {386#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {390#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:00:45,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {390#(<= 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[] {320#false} is VALID [2022-04-27 20:00:45,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {320#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {320#false} is VALID [2022-04-27 20:00:45,412 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:00:45,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:00:45,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {320#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {320#false} is VALID [2022-04-27 20:00:45,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {390#(<= 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[] {320#false} is VALID [2022-04-27 20:00:45,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {386#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {390#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:00:45,807 INFO L272 TraceCheckUtils]: 20: Hoare triple {406#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {386#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:00:45,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {406#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 20:00:45,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {406#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {406#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 20:00:45,821 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {319#true} {406#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {406#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 20:00:45,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {319#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#true} is VALID [2022-04-27 20:00:45,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {319#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[] {319#true} is VALID [2022-04-27 20:00:45,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {319#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {319#true} is VALID [2022-04-27 20:00:45,822 INFO L272 TraceCheckUtils]: 13: Hoare triple {406#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {319#true} is VALID [2022-04-27 20:00:45,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {406#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 20:00:45,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {319#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {406#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 20:00:45,823 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {319#true} {319#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {319#true} is VALID [2022-04-27 20:00:45,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {319#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#true} is VALID [2022-04-27 20:00:45,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {319#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[] {319#true} is VALID [2022-04-27 20:00:45,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {319#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {319#true} is VALID [2022-04-27 20:00:45,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {319#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {319#true} is VALID [2022-04-27 20:00:45,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {319#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {319#true} is VALID [2022-04-27 20:00:45,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {319#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#true} is VALID [2022-04-27 20:00:45,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {319#true} {319#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#true} is VALID [2022-04-27 20:00:45,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {319#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#true} is VALID [2022-04-27 20:00:45,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {319#true} is VALID [2022-04-27 20:00:45,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {319#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#true} is VALID [2022-04-27 20:00:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 20:00:45,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:00:45,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784530987] [2022-04-27 20:00:45,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:00:45,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981430241] [2022-04-27 20:00:45,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981430241] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 20:00:45,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:00:45,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 20:00:45,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313053981] [2022-04-27 20:00:45,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:00:45,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 20:00:45,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:00:45,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:00:45,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:45,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 20:00:45,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:00:45,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 20:00:45,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 20:00:45,852 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:00:45,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:45,948 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 20:00:45,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 20:00:45,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 20:00:45,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:00:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:00:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-04-27 20:00:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:00:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-04-27 20:00:45,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2022-04-27 20:00:45,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:45,981 INFO L225 Difference]: With dead ends: 34 [2022-04-27 20:00:45,981 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 20:00:45,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 20:00:45,982 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:00:45,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:00:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 20:00:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 20:00:45,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:00:45,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:00:45,989 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:00:45,989 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:00:45,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:45,992 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 20:00:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 20:00:45,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:45,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:45,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-27 20:00:45,994 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-27 20:00:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:45,995 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 20:00:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 20:00:45,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:45,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:45,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:00:45,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:00:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:00:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-27 20:00:45,997 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-27 20:00:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:00:45,997 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-27 20:00:45,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:00:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 20:00:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 20:00:45,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:00:45,998 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:00:46,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 20:00:46,199 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:00:46,199 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:00:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:00:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash -434891502, now seen corresponding path program 1 times [2022-04-27 20:00:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:00:46,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107714771] [2022-04-27 20:00:46,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:46,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:00:46,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:00:46,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784459577] [2022-04-27 20:00:46,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:46,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:00:46,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:00:46,222 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:00:46,227 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:00:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:46,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 20:00:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:46,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:00:46,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {598#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-27 20:00:46,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {598#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {598#true} is VALID [2022-04-27 20:00:46,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {598#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-27 20:00:46,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {598#true} {598#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-27 20:00:46,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {598#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-27 20:00:46,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {598#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {598#true} is VALID [2022-04-27 20:00:46,605 INFO L272 TraceCheckUtils]: 6: Hoare triple {598#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {598#true} is VALID [2022-04-27 20:00:46,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {598#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {598#true} is VALID [2022-04-27 20:00:46,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {598#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[] {598#true} is VALID [2022-04-27 20:00:46,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {598#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-27 20:00:46,605 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {598#true} {598#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {598#true} is VALID [2022-04-27 20:00:46,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {598#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:46,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {636#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:46,608 INFO L272 TraceCheckUtils]: 13: Hoare triple {636#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_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#true} is VALID [2022-04-27 20:00:46,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {598#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {598#true} is VALID [2022-04-27 20:00:46,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {598#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[] {598#true} is VALID [2022-04-27 20:00:46,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-27 20:00:46,610 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {598#true} {636#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:46,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {636#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {658#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 20:00:46,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {658#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {658#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 20:00:46,612 INFO L272 TraceCheckUtils]: 20: Hoare triple {658#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_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#true} is VALID [2022-04-27 20:00:46,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {598#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {598#true} is VALID [2022-04-27 20:00:46,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {598#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[] {598#true} is VALID [2022-04-27 20:00:46,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {598#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-27 20:00:46,614 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {598#true} {658#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {658#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 20:00:46,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {658#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {680#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 20:00:46,616 INFO L272 TraceCheckUtils]: 26: Hoare triple {680#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [77] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~k~0_9 v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 v_main_~y~0_9))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_9, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {684#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:00:46,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {684#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {688#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:00:46,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {688#(<= 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[] {599#false} is VALID [2022-04-27 20:00:46,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {599#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {599#false} is VALID [2022-04-27 20:00:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 20:00:46,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:00:46,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:00:46,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107714771] [2022-04-27 20:00:46,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:00:46,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784459577] [2022-04-27 20:00:46,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784459577] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:00:46,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:00:46,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 20:00:46,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704854074] [2022-04-27 20:00:46,866 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:00:46,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-27 20:00:46,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:00:46,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 20:00:46,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:46,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 20:00:46,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:00:46,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 20:00:46,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 20:00:46,889 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 20:00:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:47,051 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-27 20:00:47,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 20:00:47,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-27 20:00:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:00:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 20:00:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 20:00:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 20:00:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 20:00:47,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-04-27 20:00:47,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:47,075 INFO L225 Difference]: With dead ends: 37 [2022-04-27 20:00:47,075 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 20:00:47,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 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:00:47,076 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:00:47,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:00:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 20:00:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 20:00:47,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:00:47,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:00:47,079 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:00:47,079 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:00:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:47,080 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 20:00:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 20:00:47,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:47,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:47,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 20:00:47,081 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 20:00:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:47,083 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 20:00:47,083 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 20:00:47,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:47,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:47,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:00:47,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:00:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:00:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-27 20:00:47,099 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-27 20:00:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:00:47,099 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-27 20:00:47,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 20:00:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 20:00:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 20:00:47,100 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:00:47,100 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:00:47,120 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:00:47,311 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:00:47,313 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:00:47,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:00:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash 725792896, now seen corresponding path program 2 times [2022-04-27 20:00:47,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:00:47,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707718154] [2022-04-27 20:00:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:47,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:00:47,333 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:00:47,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42985228] [2022-04-27 20:00:47,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 20:00:47,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:00:47,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:00:47,344 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:00:47,345 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:00:47,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 20:00:47,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:00:47,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 20:00:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:47,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:00:47,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {879#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {879#true} is VALID [2022-04-27 20:00:47,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {879#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {879#true} is VALID [2022-04-27 20:00:47,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {879#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {879#true} is VALID [2022-04-27 20:00:47,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {879#true} {879#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {879#true} is VALID [2022-04-27 20:00:47,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {879#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {879#true} is VALID [2022-04-27 20:00:47,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {879#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {879#true} is VALID [2022-04-27 20:00:47,700 INFO L272 TraceCheckUtils]: 6: Hoare triple {879#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {879#true} is VALID [2022-04-27 20:00:47,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {879#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {879#true} is VALID [2022-04-27 20:00:47,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {879#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[] {879#true} is VALID [2022-04-27 20:00:47,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {879#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {879#true} is VALID [2022-04-27 20:00:47,700 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {879#true} {879#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {879#true} is VALID [2022-04-27 20:00:47,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:47,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {917#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:47,701 INFO L272 TraceCheckUtils]: 13: Hoare triple {917#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {879#true} is VALID [2022-04-27 20:00:47,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {879#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {879#true} is VALID [2022-04-27 20:00:47,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {879#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[] {879#true} is VALID [2022-04-27 20:00:47,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {879#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {879#true} is VALID [2022-04-27 20:00:47,702 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {879#true} {917#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:47,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {917#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {939#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 20:00:47,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {939#(and (= main_~y~0 1) (= main_~c~0 1))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 20:00:47,703 INFO L272 TraceCheckUtils]: 20: Hoare triple {939#(and (= main_~y~0 1) (= main_~c~0 1))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {879#true} is VALID [2022-04-27 20:00:47,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {879#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {879#true} is VALID [2022-04-27 20:00:47,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {879#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[] {879#true} is VALID [2022-04-27 20:00:47,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {879#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {879#true} is VALID [2022-04-27 20:00:47,704 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {879#true} {939#(and (= main_~y~0 1) (= main_~c~0 1))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {939#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 20:00:47,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {939#(and (= main_~y~0 1) (= main_~c~0 1))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {961#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 20:00:47,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {961#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 20:00:47,705 INFO L272 TraceCheckUtils]: 27: Hoare triple {961#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {879#true} is VALID [2022-04-27 20:00:47,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {879#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {879#true} is VALID [2022-04-27 20:00:47,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {879#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[] {879#true} is VALID [2022-04-27 20:00:47,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {879#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {879#true} is VALID [2022-04-27 20:00:47,705 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {879#true} {961#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {961#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 20:00:47,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {961#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {983#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 20:00:47,706 INFO L272 TraceCheckUtils]: 33: Hoare triple {983#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} [77] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~k~0_9 v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 v_main_~y~0_9))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_9, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {987#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:00:47,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {987#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {991#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:00:47,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {991#(<= 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[] {880#false} is VALID [2022-04-27 20:00:47,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {880#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#false} is VALID [2022-04-27 20:00:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 20:00:47,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:00:47,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:00:47,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707718154] [2022-04-27 20:00:47,937 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:00:47,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42985228] [2022-04-27 20:00:47,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42985228] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:00:47,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:00:47,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 20:00:47,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002881430] [2022-04-27 20:00:47,938 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:00:47,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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:00:47,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:00:47,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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:00:47,961 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:00:47,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 20:00:47,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:00:47,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 20:00:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 20:00:47,962 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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:00:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:48,195 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-27 20:00:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 20:00:48,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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:00:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:00:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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:00:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 20:00:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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:00:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 20:00:48,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-27 20:00:48,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:48,232 INFO L225 Difference]: With dead ends: 40 [2022-04-27 20:00:48,232 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 20:00:48,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 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:00:48,233 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:00:48,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:00:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 20:00:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 20:00:48,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:00:48,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:00:48,236 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:00:48,236 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:00:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:48,237 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 20:00:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 20:00:48,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:48,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:48,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-27 20:00:48,238 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-27 20:00:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:48,239 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 20:00:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 20:00:48,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:48,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:48,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:00:48,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:00:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:00:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-27 20:00:48,241 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 37 [2022-04-27 20:00:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:00:48,241 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-27 20:00:48,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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:00:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 20:00:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 20:00:48,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:00:48,242 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:00:48,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 20:00:48,458 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:00:48,458 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:00:48,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:00:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1487404370, now seen corresponding path program 3 times [2022-04-27 20:00:48,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:00:48,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178789425] [2022-04-27 20:00:48,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:48,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:00:48,472 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:00:48,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [13978355] [2022-04-27 20:00:48,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 20:00:48,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:00:48,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:00:48,512 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:00:48,513 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:00:48,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 20:00:48,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:00:48,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 20:00:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:48,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:00:48,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {1194#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1194#true} is VALID [2022-04-27 20:00:48,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {1194#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1194#true} is VALID [2022-04-27 20:00:48,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {1194#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1194#true} is VALID [2022-04-27 20:00:48,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1194#true} is VALID [2022-04-27 20:00:48,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {1194#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1194#true} is VALID [2022-04-27 20:00:48,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {1194#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1194#true} is VALID [2022-04-27 20:00:48,907 INFO L272 TraceCheckUtils]: 6: Hoare triple {1194#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {1194#true} is VALID [2022-04-27 20:00:48,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {1194#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1194#true} is VALID [2022-04-27 20:00:48,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {1194#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[] {1194#true} is VALID [2022-04-27 20:00:48,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {1194#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1194#true} is VALID [2022-04-27 20:00:48,908 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1194#true} {1194#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {1194#true} is VALID [2022-04-27 20:00:48,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {1194#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1232#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:48,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {1232#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1232#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:48,909 INFO L272 TraceCheckUtils]: 13: Hoare triple {1232#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1194#true} is VALID [2022-04-27 20:00:48,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {1194#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1194#true} is VALID [2022-04-27 20:00:48,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {1194#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[] {1194#true} is VALID [2022-04-27 20:00:48,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {1194#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1194#true} is VALID [2022-04-27 20:00:48,910 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1194#true} {1232#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1232#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:48,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {1232#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1254#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:00:48,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {1254#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:00:48,911 INFO L272 TraceCheckUtils]: 20: Hoare triple {1254#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1194#true} is VALID [2022-04-27 20:00:48,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {1194#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1194#true} is VALID [2022-04-27 20:00:48,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {1194#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[] {1194#true} is VALID [2022-04-27 20:00:48,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {1194#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1194#true} is VALID [2022-04-27 20:00:48,911 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1194#true} {1254#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1254#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:00:48,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {1254#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1276#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:00:48,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {1276#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1276#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:00:48,912 INFO L272 TraceCheckUtils]: 27: Hoare triple {1276#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1194#true} is VALID [2022-04-27 20:00:48,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {1194#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1194#true} is VALID [2022-04-27 20:00:48,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {1194#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[] {1194#true} is VALID [2022-04-27 20:00:48,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {1194#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1194#true} is VALID [2022-04-27 20:00:48,913 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1194#true} {1276#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1276#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:00:48,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {1276#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1298#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 20:00:48,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {1298#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 20:00:48,914 INFO L272 TraceCheckUtils]: 34: Hoare triple {1298#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1194#true} is VALID [2022-04-27 20:00:48,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {1194#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1194#true} is VALID [2022-04-27 20:00:48,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {1194#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[] {1194#true} is VALID [2022-04-27 20:00:48,914 INFO L290 TraceCheckUtils]: 37: Hoare triple {1194#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1194#true} is VALID [2022-04-27 20:00:48,915 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1194#true} {1298#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1298#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 20:00:48,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {1298#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1320#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 20:00:48,916 INFO L272 TraceCheckUtils]: 40: Hoare triple {1320#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [77] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~k~0_9 v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 v_main_~y~0_9))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_9, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1324#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:00:48,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {1324#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1328#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:00:48,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {1328#(<= 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[] {1195#false} is VALID [2022-04-27 20:00:48,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {1195#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#false} is VALID [2022-04-27 20:00:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 20:00:48,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:00:49,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:00:49,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178789425] [2022-04-27 20:00:49,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:00:49,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13978355] [2022-04-27 20:00:49,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13978355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:00:49,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:00:49,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 20:00:49,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322199052] [2022-04-27 20:00:49,171 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:00:49,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (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 44 [2022-04-27 20:00:49,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:00:49,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (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:00:49,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:49,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 20:00:49,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:00:49,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 20:00:49,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 20:00:49,195 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (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:00:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:49,472 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-27 20:00:49,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 20:00:49,472 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (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 44 [2022-04-27 20:00:49,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:00:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (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:00:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2022-04-27 20:00:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (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:00:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2022-04-27 20:00:49,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 43 transitions. [2022-04-27 20:00:49,535 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:00:49,536 INFO L225 Difference]: With dead ends: 43 [2022-04-27 20:00:49,536 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 20:00:49,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 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:00:49,536 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:00:49,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:00:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 20:00:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-27 20:00:49,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:00:49,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:00:49,539 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:00:49,539 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:00:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:49,541 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 20:00:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 20:00:49,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:49,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:49,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-27 20:00:49,541 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-27 20:00:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:49,542 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 20:00:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 20:00:49,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:49,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:49,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:00:49,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:00:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:00:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-27 20:00:49,544 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 44 [2022-04-27 20:00:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:00:49,544 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-27 20:00:49,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (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:00:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 20:00:49,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 20:00:49,545 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:00:49,545 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:00:49,553 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:00:49,749 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:00:49,750 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:00:49,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:00:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1178929216, now seen corresponding path program 4 times [2022-04-27 20:00:49,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:00:49,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229962241] [2022-04-27 20:00:49,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:00:49,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:00:49,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713877287] [2022-04-27 20:00:49,761 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 20:00:49,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:00:49,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:00:49,762 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:00:49,763 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:00:49,811 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 20:00:49,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:00:49,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 20:00:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:49,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:00:50,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {1543#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-27 20:00:50,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {1543#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1543#true} is VALID [2022-04-27 20:00:50,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {1543#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-27 20:00:50,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1543#true} {1543#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-27 20:00:50,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {1543#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-27 20:00:50,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {1543#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1543#true} is VALID [2022-04-27 20:00:50,207 INFO L272 TraceCheckUtils]: 6: Hoare triple {1543#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {1543#true} is VALID [2022-04-27 20:00:50,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {1543#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1543#true} is VALID [2022-04-27 20:00:50,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {1543#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[] {1543#true} is VALID [2022-04-27 20:00:50,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {1543#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-27 20:00:50,208 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1543#true} {1543#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {1543#true} is VALID [2022-04-27 20:00:50,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {1543#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1581#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:50,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {1581#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1581#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:50,209 INFO L272 TraceCheckUtils]: 13: Hoare triple {1581#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1543#true} is VALID [2022-04-27 20:00:50,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {1543#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1543#true} is VALID [2022-04-27 20:00:50,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {1543#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[] {1543#true} is VALID [2022-04-27 20:00:50,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {1543#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-27 20:00:50,210 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1543#true} {1581#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1581#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:50,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {1581#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1603#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 20:00:50,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {1603#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1603#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 20:00:50,211 INFO L272 TraceCheckUtils]: 20: Hoare triple {1603#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1543#true} is VALID [2022-04-27 20:00:50,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {1543#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1543#true} is VALID [2022-04-27 20:00:50,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {1543#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[] {1543#true} is VALID [2022-04-27 20:00:50,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {1543#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-27 20:00:50,211 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1543#true} {1603#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1603#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 20:00:50,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {1603#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1625#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:00:50,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {1625#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:00:50,214 INFO L272 TraceCheckUtils]: 27: Hoare triple {1625#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1543#true} is VALID [2022-04-27 20:00:50,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {1543#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1543#true} is VALID [2022-04-27 20:00:50,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {1543#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[] {1543#true} is VALID [2022-04-27 20:00:50,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {1543#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-27 20:00:50,215 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1543#true} {1625#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1625#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:00:50,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {1625#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1647#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 20:00:50,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {1647#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1647#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 20:00:50,216 INFO L272 TraceCheckUtils]: 34: Hoare triple {1647#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1543#true} is VALID [2022-04-27 20:00:50,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {1543#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1543#true} is VALID [2022-04-27 20:00:50,216 INFO L290 TraceCheckUtils]: 36: Hoare triple {1543#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[] {1543#true} is VALID [2022-04-27 20:00:50,216 INFO L290 TraceCheckUtils]: 37: Hoare triple {1543#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-27 20:00:50,217 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1543#true} {1647#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1647#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 20:00:50,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {1647#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1669#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 20:00:50,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {1669#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1669#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 20:00:50,218 INFO L272 TraceCheckUtils]: 41: Hoare triple {1669#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1543#true} is VALID [2022-04-27 20:00:50,218 INFO L290 TraceCheckUtils]: 42: Hoare triple {1543#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1543#true} is VALID [2022-04-27 20:00:50,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {1543#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[] {1543#true} is VALID [2022-04-27 20:00:50,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {1543#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-27 20:00:50,223 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1543#true} {1669#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1669#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 20:00:50,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {1669#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1691#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 20:00:50,224 INFO L272 TraceCheckUtils]: 47: Hoare triple {1691#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [77] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~k~0_9 v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 v_main_~y~0_9))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_9, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1695#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:00:50,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {1695#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1699#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:00:50,225 INFO L290 TraceCheckUtils]: 49: Hoare triple {1699#(<= 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[] {1544#false} is VALID [2022-04-27 20:00:50,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {1544#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1544#false} is VALID [2022-04-27 20:00:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 20:00:50,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:00:50,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:00:50,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229962241] [2022-04-27 20:00:50,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:00:50,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713877287] [2022-04-27 20:00:50,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713877287] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:00:50,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:00:50,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 20:00:50,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544724970] [2022-04-27 20:00:50,711 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:00:50,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (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 51 [2022-04-27 20:00:50,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:00:50,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (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:00:50,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:50,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 20:00:50,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:00:50,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 20:00:50,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-27 20:00:50,739 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (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:00:51,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:51,152 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-27 20:00:51,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 20:00:51,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (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 51 [2022-04-27 20:00:51,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:00:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (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:00:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-27 20:00:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (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:00:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-27 20:00:51,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2022-04-27 20:00:51,222 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:00:51,223 INFO L225 Difference]: With dead ends: 46 [2022-04-27 20:00:51,223 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 20:00:51,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-27 20:00:51,224 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 20:00:51,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 202 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 20:00:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 20:00:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 20:00:51,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:00:51,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:00:51,227 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:00:51,227 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:00:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:51,229 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-27 20:00:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 20:00:51,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:51,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:51,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-27 20:00:51,229 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-27 20:00:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:51,230 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-27 20:00:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 20:00:51,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:51,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:51,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:00:51,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:00:51,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:00:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-27 20:00:51,232 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 51 [2022-04-27 20:00:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:00:51,232 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-27 20:00:51,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (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:00:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 20:00:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 20:00:51,233 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:00:51,233 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:00:51,272 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:00:51,447 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:00:51,448 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:00:51,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:00:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1658817134, now seen corresponding path program 5 times [2022-04-27 20:00:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:00:51,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248831141] [2022-04-27 20:00:51,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:00:51,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:00:51,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [436589772] [2022-04-27 20:00:51,465 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 20:00:51,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:00:51,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:00:51,472 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:00:51,484 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:00:51,593 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 20:00:51,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:00:51,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 20:00:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:51,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:00:51,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {1992#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1992#true} is VALID [2022-04-27 20:00:51,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {1992#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1992#true} is VALID [2022-04-27 20:00:51,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {1992#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1992#true} is VALID [2022-04-27 20:00:51,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1992#true} {1992#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1992#true} is VALID [2022-04-27 20:00:52,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {1992#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1992#true} is VALID [2022-04-27 20:00:52,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {1992#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1992#true} is VALID [2022-04-27 20:00:52,003 INFO L272 TraceCheckUtils]: 6: Hoare triple {1992#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {1992#true} is VALID [2022-04-27 20:00:52,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {1992#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1992#true} is VALID [2022-04-27 20:00:52,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {1992#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[] {1992#true} is VALID [2022-04-27 20:00:52,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {1992#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1992#true} is VALID [2022-04-27 20:00:52,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1992#true} {1992#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {1992#true} is VALID [2022-04-27 20:00:52,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {1992#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {2030#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:52,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {2030#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2030#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:52,004 INFO L272 TraceCheckUtils]: 13: Hoare triple {2030#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1992#true} is VALID [2022-04-27 20:00:52,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {1992#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1992#true} is VALID [2022-04-27 20:00:52,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {1992#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[] {1992#true} is VALID [2022-04-27 20:00:52,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {1992#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1992#true} is VALID [2022-04-27 20:00:52,005 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1992#true} {2030#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2030#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:52,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {2030#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2052#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:00:52,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {2052#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2052#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:00:52,006 INFO L272 TraceCheckUtils]: 20: Hoare triple {2052#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1992#true} is VALID [2022-04-27 20:00:52,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1992#true} is VALID [2022-04-27 20:00:52,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {1992#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[] {1992#true} is VALID [2022-04-27 20:00:52,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1992#true} is VALID [2022-04-27 20:00:52,007 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1992#true} {2052#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2052#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:00:52,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {2052#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2074#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 20:00:52,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {2074#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2074#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 20:00:52,008 INFO L272 TraceCheckUtils]: 27: Hoare triple {2074#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1992#true} is VALID [2022-04-27 20:00:52,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {1992#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1992#true} is VALID [2022-04-27 20:00:52,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {1992#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[] {1992#true} is VALID [2022-04-27 20:00:52,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {1992#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1992#true} is VALID [2022-04-27 20:00:52,009 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1992#true} {2074#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2074#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 20:00:52,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {2074#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2096#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 20:00:52,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {2096#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2096#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 20:00:52,010 INFO L272 TraceCheckUtils]: 34: Hoare triple {2096#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1992#true} is VALID [2022-04-27 20:00:52,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {1992#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1992#true} is VALID [2022-04-27 20:00:52,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {1992#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[] {1992#true} is VALID [2022-04-27 20:00:52,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {1992#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1992#true} is VALID [2022-04-27 20:00:52,010 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1992#true} {2096#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2096#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 20:00:52,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {2096#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2118#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 20:00:52,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {2118#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 20:00:52,011 INFO L272 TraceCheckUtils]: 41: Hoare triple {2118#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1992#true} is VALID [2022-04-27 20:00:52,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {1992#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1992#true} is VALID [2022-04-27 20:00:52,012 INFO L290 TraceCheckUtils]: 43: Hoare triple {1992#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[] {1992#true} is VALID [2022-04-27 20:00:52,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {1992#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1992#true} is VALID [2022-04-27 20:00:52,013 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1992#true} {2118#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2118#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 20:00:52,013 INFO L290 TraceCheckUtils]: 46: Hoare triple {2118#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2140#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 20:00:52,019 INFO L290 TraceCheckUtils]: 47: Hoare triple {2140#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2140#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 20:00:52,019 INFO L272 TraceCheckUtils]: 48: Hoare triple {2140#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1992#true} is VALID [2022-04-27 20:00:52,019 INFO L290 TraceCheckUtils]: 49: Hoare triple {1992#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1992#true} is VALID [2022-04-27 20:00:52,019 INFO L290 TraceCheckUtils]: 50: Hoare triple {1992#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[] {1992#true} is VALID [2022-04-27 20:00:52,020 INFO L290 TraceCheckUtils]: 51: Hoare triple {1992#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1992#true} is VALID [2022-04-27 20:00:52,020 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1992#true} {2140#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2140#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 20:00:52,021 INFO L290 TraceCheckUtils]: 53: Hoare triple {2140#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {2162#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 20:00:52,022 INFO L272 TraceCheckUtils]: 54: Hoare triple {2162#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [77] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~k~0_9 v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 v_main_~y~0_9))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_9, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2166#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:00:52,022 INFO L290 TraceCheckUtils]: 55: Hoare triple {2166#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2170#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:00:52,023 INFO L290 TraceCheckUtils]: 56: Hoare triple {2170#(<= 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[] {1993#false} is VALID [2022-04-27 20:00:52,023 INFO L290 TraceCheckUtils]: 57: Hoare triple {1993#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1993#false} is VALID [2022-04-27 20:00:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 20:00:52,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:00:52,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:00:52,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248831141] [2022-04-27 20:00:52,380 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:00:52,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436589772] [2022-04-27 20:00:52,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436589772] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:00:52,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:00:52,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 20:00:52,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787781014] [2022-04-27 20:00:52,380 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:00:52,382 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (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 58 [2022-04-27 20:00:52,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:00:52,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (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:00:52,412 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:00:52,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 20:00:52,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:00:52,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 20:00:52,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 20:00:52,413 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (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:00:52,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:52,874 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-27 20:00:52,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 20:00:52,874 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (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 58 [2022-04-27 20:00:52,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:00:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (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:00:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-27 20:00:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (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:00:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-27 20:00:52,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2022-04-27 20:00:52,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:52,932 INFO L225 Difference]: With dead ends: 49 [2022-04-27 20:00:52,932 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 20:00:52,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 20:00:52,933 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 20:00:52,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 239 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 20:00:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 20:00:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-27 20:00:52,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:00:52,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:00:52,935 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:00:52,936 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:00:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:52,937 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-27 20:00:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 20:00:52,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:52,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:52,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-27 20:00:52,937 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-27 20:00:52,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:52,938 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-27 20:00:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 20:00:52,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:52,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:52,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:00:52,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:00:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:00:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-27 20:00:52,940 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 58 [2022-04-27 20:00:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:00:52,940 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-27 20:00:52,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (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:00:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 20:00:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 20:00:52,941 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:00:52,941 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:00:52,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 20:00:53,141 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:00:53,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:00:53,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:00:53,142 INFO L85 PathProgramCache]: Analyzing trace with hash 270583808, now seen corresponding path program 6 times [2022-04-27 20:00:53,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:00:53,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689407218] [2022-04-27 20:00:53,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:53,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:00:53,160 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:00:53,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639161326] [2022-04-27 20:00:53,161 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 20:00:53,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:00:53,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:00:53,162 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:00:53,164 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:00:53,293 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 20:00:53,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:00:53,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 20:00:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:53,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:00:53,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {2409#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2409#true} is VALID [2022-04-27 20:00:53,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {2409#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2409#true} is VALID [2022-04-27 20:00:53,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {2409#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2409#true} is VALID [2022-04-27 20:00:53,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2409#true} {2409#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2409#true} is VALID [2022-04-27 20:00:53,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {2409#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2409#true} is VALID [2022-04-27 20:00:53,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {2409#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {2409#true} is VALID [2022-04-27 20:00:53,639 INFO L272 TraceCheckUtils]: 6: Hoare triple {2409#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {2409#true} is VALID [2022-04-27 20:00:53,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {2409#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2409#true} is VALID [2022-04-27 20:00:53,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {2409#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[] {2409#true} is VALID [2022-04-27 20:00:53,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {2409#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2409#true} is VALID [2022-04-27 20:00:53,640 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2409#true} {2409#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {2409#true} is VALID [2022-04-27 20:00:53,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {2409#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {2447#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:53,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {2447#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:53,641 INFO L272 TraceCheckUtils]: 13: Hoare triple {2447#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2409#true} is VALID [2022-04-27 20:00:53,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {2409#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2409#true} is VALID [2022-04-27 20:00:53,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {2409#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[] {2409#true} is VALID [2022-04-27 20:00:53,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {2409#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2409#true} is VALID [2022-04-27 20:00:53,642 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2409#true} {2447#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2447#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:53,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {2447#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2469#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:00:53,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {2469#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2469#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:00:53,643 INFO L272 TraceCheckUtils]: 20: Hoare triple {2469#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2409#true} is VALID [2022-04-27 20:00:53,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {2409#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2409#true} is VALID [2022-04-27 20:00:53,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {2409#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[] {2409#true} is VALID [2022-04-27 20:00:53,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {2409#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2409#true} is VALID [2022-04-27 20:00:53,644 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2409#true} {2469#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2469#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:00:53,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {2469#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2491#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 20:00:53,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {2491#(and (= main_~y~0 2) (= main_~c~0 2))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2491#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 20:00:53,645 INFO L272 TraceCheckUtils]: 27: Hoare triple {2491#(and (= main_~y~0 2) (= main_~c~0 2))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2409#true} is VALID [2022-04-27 20:00:53,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {2409#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2409#true} is VALID [2022-04-27 20:00:53,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {2409#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[] {2409#true} is VALID [2022-04-27 20:00:53,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {2409#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2409#true} is VALID [2022-04-27 20:00:53,646 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2409#true} {2491#(and (= main_~y~0 2) (= main_~c~0 2))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2491#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 20:00:53,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {2491#(and (= main_~y~0 2) (= main_~c~0 2))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2513#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 20:00:53,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {2513#(and (= main_~y~0 3) (= main_~c~0 3))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2513#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 20:00:53,647 INFO L272 TraceCheckUtils]: 34: Hoare triple {2513#(and (= main_~y~0 3) (= main_~c~0 3))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2409#true} is VALID [2022-04-27 20:00:53,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {2409#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2409#true} is VALID [2022-04-27 20:00:53,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {2409#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[] {2409#true} is VALID [2022-04-27 20:00:53,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {2409#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2409#true} is VALID [2022-04-27 20:00:53,648 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2409#true} {2513#(and (= main_~y~0 3) (= main_~c~0 3))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2513#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 20:00:53,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {2513#(and (= main_~y~0 3) (= main_~c~0 3))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2535#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 20:00:53,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {2535#(and (= main_~y~0 4) (= main_~c~0 4))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2535#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 20:00:53,649 INFO L272 TraceCheckUtils]: 41: Hoare triple {2535#(and (= main_~y~0 4) (= main_~c~0 4))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2409#true} is VALID [2022-04-27 20:00:53,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {2409#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2409#true} is VALID [2022-04-27 20:00:53,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {2409#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[] {2409#true} is VALID [2022-04-27 20:00:53,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {2409#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2409#true} is VALID [2022-04-27 20:00:53,649 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2409#true} {2535#(and (= main_~y~0 4) (= main_~c~0 4))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2535#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 20:00:53,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {2535#(and (= main_~y~0 4) (= main_~c~0 4))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2557#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 20:00:53,650 INFO L290 TraceCheckUtils]: 47: Hoare triple {2557#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2557#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 20:00:53,650 INFO L272 TraceCheckUtils]: 48: Hoare triple {2557#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2409#true} is VALID [2022-04-27 20:00:53,650 INFO L290 TraceCheckUtils]: 49: Hoare triple {2409#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2409#true} is VALID [2022-04-27 20:00:53,650 INFO L290 TraceCheckUtils]: 50: Hoare triple {2409#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[] {2409#true} is VALID [2022-04-27 20:00:53,650 INFO L290 TraceCheckUtils]: 51: Hoare triple {2409#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2409#true} is VALID [2022-04-27 20:00:53,651 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2409#true} {2557#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2557#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 20:00:53,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {2557#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2579#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= main_~c~0 6))} is VALID [2022-04-27 20:00:53,652 INFO L290 TraceCheckUtils]: 54: Hoare triple {2579#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= main_~c~0 6))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2579#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= main_~c~0 6))} is VALID [2022-04-27 20:00:53,652 INFO L272 TraceCheckUtils]: 55: Hoare triple {2579#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= main_~c~0 6))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2409#true} is VALID [2022-04-27 20:00:53,652 INFO L290 TraceCheckUtils]: 56: Hoare triple {2409#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2409#true} is VALID [2022-04-27 20:00:53,652 INFO L290 TraceCheckUtils]: 57: Hoare triple {2409#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[] {2409#true} is VALID [2022-04-27 20:00:53,652 INFO L290 TraceCheckUtils]: 58: Hoare triple {2409#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2409#true} is VALID [2022-04-27 20:00:53,653 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2409#true} {2579#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= main_~c~0 6))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2579#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= main_~c~0 6))} is VALID [2022-04-27 20:00:53,653 INFO L290 TraceCheckUtils]: 60: Hoare triple {2579#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= main_~c~0 6))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {2601#(and (<= main_~k~0 6) (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 20:00:53,654 INFO L272 TraceCheckUtils]: 61: Hoare triple {2601#(and (<= main_~k~0 6) (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4))} [77] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~k~0_9 v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 v_main_~y~0_9))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_9, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:00:53,654 INFO L290 TraceCheckUtils]: 62: Hoare triple {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2609#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:00:53,654 INFO L290 TraceCheckUtils]: 63: Hoare triple {2609#(<= 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[] {2410#false} is VALID [2022-04-27 20:00:53,655 INFO L290 TraceCheckUtils]: 64: Hoare triple {2410#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2410#false} is VALID [2022-04-27 20:00:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 14 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 20:00:53,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:00:53,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:00:53,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689407218] [2022-04-27 20:00:53,978 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:00:53,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639161326] [2022-04-27 20:00:53,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639161326] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:00:53,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:00:53,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 20:00:53,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309333484] [2022-04-27 20:00:53,980 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:00:53,981 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-27 20:00:53,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:00:53,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 20:00:54,002 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:00:54,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 20:00:54,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:00:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 20:00:54,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 20:00:54,003 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 20:00:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:54,604 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-04-27 20:00:54,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 20:00:54,604 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-27 20:00:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:00:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 20:00:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-27 20:00:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 20:00:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-27 20:00:54,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2022-04-27 20:00:54,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:54,651 INFO L225 Difference]: With dead ends: 52 [2022-04-27 20:00:54,651 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 20:00:54,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 20:00:54,651 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 20:00:54,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 20:00:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 20:00:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-27 20:00:54,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:00:54,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:00:54,655 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:00:54,655 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:00:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:54,656 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-27 20:00:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 20:00:54,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:54,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:54,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-27 20:00:54,657 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-27 20:00:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:54,658 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-27 20:00:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 20:00:54,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:54,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:54,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:00:54,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:00:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:00:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-04-27 20:00:54,660 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 65 [2022-04-27 20:00:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:00:54,660 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-04-27 20:00:54,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 20:00:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 20:00:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-27 20:00:54,660 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:00:54,660 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:00:54,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 20:00:54,875 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:00:54,876 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:00:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:00:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash 4292050, now seen corresponding path program 7 times [2022-04-27 20:00:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:00:54,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441858027] [2022-04-27 20:00:54,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:54,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:00:54,895 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:00:54,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2028788437] [2022-04-27 20:00:54,895 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 20:00:54,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:00:54,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:00:54,911 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:00:54,912 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:00:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:55,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 20:00:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:55,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:00:55,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {2860#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2860#true} is VALID [2022-04-27 20:00:55,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {2860#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2860#true} is VALID [2022-04-27 20:00:55,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {2860#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2860#true} is VALID [2022-04-27 20:00:55,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2860#true} {2860#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2860#true} is VALID [2022-04-27 20:00:55,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {2860#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2860#true} is VALID [2022-04-27 20:00:55,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {2860#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {2860#true} is VALID [2022-04-27 20:00:55,655 INFO L272 TraceCheckUtils]: 6: Hoare triple {2860#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {2860#true} is VALID [2022-04-27 20:00:55,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {2860#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2860#true} is VALID [2022-04-27 20:00:55,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {2860#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[] {2860#true} is VALID [2022-04-27 20:00:55,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {2860#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2860#true} is VALID [2022-04-27 20:00:55,655 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2860#true} {2860#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {2860#true} is VALID [2022-04-27 20:00:55,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {2860#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:55,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:55,660 INFO L272 TraceCheckUtils]: 13: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2860#true} is VALID [2022-04-27 20:00:55,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {2860#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2860#true} is VALID [2022-04-27 20:00:55,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {2860#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[] {2860#true} is VALID [2022-04-27 20:00:55,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {2860#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2860#true} is VALID [2022-04-27 20:00:55,661 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2860#true} {2898#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:55,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2920#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 20:00:55,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {2920#(and (= main_~y~0 1) (= main_~c~0 1))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2920#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 20:00:55,662 INFO L272 TraceCheckUtils]: 20: Hoare triple {2920#(and (= main_~y~0 1) (= main_~c~0 1))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2860#true} is VALID [2022-04-27 20:00:55,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {2860#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2860#true} is VALID [2022-04-27 20:00:55,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {2860#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[] {2860#true} is VALID [2022-04-27 20:00:55,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {2860#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2860#true} is VALID [2022-04-27 20:00:55,662 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2860#true} {2920#(and (= main_~y~0 1) (= main_~c~0 1))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2920#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 20:00:55,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {2920#(and (= main_~y~0 1) (= main_~c~0 1))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2942#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 20:00:55,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {2942#(and (= main_~y~0 2) (= main_~c~0 2))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2942#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 20:00:55,663 INFO L272 TraceCheckUtils]: 27: Hoare triple {2942#(and (= main_~y~0 2) (= main_~c~0 2))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2860#true} is VALID [2022-04-27 20:00:55,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {2860#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2860#true} is VALID [2022-04-27 20:00:55,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {2860#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[] {2860#true} is VALID [2022-04-27 20:00:55,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {2860#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2860#true} is VALID [2022-04-27 20:00:55,664 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2860#true} {2942#(and (= main_~y~0 2) (= main_~c~0 2))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2942#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 20:00:55,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {2942#(and (= main_~y~0 2) (= main_~c~0 2))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2964#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 20:00:55,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {2964#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 20:00:55,664 INFO L272 TraceCheckUtils]: 34: Hoare triple {2964#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2860#true} is VALID [2022-04-27 20:00:55,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {2860#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2860#true} is VALID [2022-04-27 20:00:55,665 INFO L290 TraceCheckUtils]: 36: Hoare triple {2860#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[] {2860#true} is VALID [2022-04-27 20:00:55,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {2860#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2860#true} is VALID [2022-04-27 20:00:55,665 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2860#true} {2964#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2964#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 20:00:55,665 INFO L290 TraceCheckUtils]: 39: Hoare triple {2964#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2986#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 20:00:55,666 INFO L290 TraceCheckUtils]: 40: Hoare triple {2986#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2986#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 20:00:55,666 INFO L272 TraceCheckUtils]: 41: Hoare triple {2986#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2860#true} is VALID [2022-04-27 20:00:55,666 INFO L290 TraceCheckUtils]: 42: Hoare triple {2860#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2860#true} is VALID [2022-04-27 20:00:55,666 INFO L290 TraceCheckUtils]: 43: Hoare triple {2860#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[] {2860#true} is VALID [2022-04-27 20:00:55,666 INFO L290 TraceCheckUtils]: 44: Hoare triple {2860#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2860#true} is VALID [2022-04-27 20:00:55,666 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2860#true} {2986#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2986#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 20:00:55,667 INFO L290 TraceCheckUtils]: 46: Hoare triple {2986#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3008#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 20:00:55,667 INFO L290 TraceCheckUtils]: 47: Hoare triple {3008#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3008#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 20:00:55,667 INFO L272 TraceCheckUtils]: 48: Hoare triple {3008#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2860#true} is VALID [2022-04-27 20:00:55,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {2860#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2860#true} is VALID [2022-04-27 20:00:55,667 INFO L290 TraceCheckUtils]: 50: Hoare triple {2860#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[] {2860#true} is VALID [2022-04-27 20:00:55,667 INFO L290 TraceCheckUtils]: 51: Hoare triple {2860#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2860#true} is VALID [2022-04-27 20:00:55,668 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2860#true} {3008#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3008#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 20:00:55,669 INFO L290 TraceCheckUtils]: 53: Hoare triple {3008#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3030#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 20:00:55,669 INFO L290 TraceCheckUtils]: 54: Hoare triple {3030#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3030#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 20:00:55,669 INFO L272 TraceCheckUtils]: 55: Hoare triple {3030#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2860#true} is VALID [2022-04-27 20:00:55,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {2860#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2860#true} is VALID [2022-04-27 20:00:55,670 INFO L290 TraceCheckUtils]: 57: Hoare triple {2860#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[] {2860#true} is VALID [2022-04-27 20:00:55,670 INFO L290 TraceCheckUtils]: 58: Hoare triple {2860#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2860#true} is VALID [2022-04-27 20:00:55,670 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2860#true} {3030#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3030#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 20:00:55,670 INFO L290 TraceCheckUtils]: 60: Hoare triple {3030#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3052#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} is VALID [2022-04-27 20:00:55,671 INFO L290 TraceCheckUtils]: 61: Hoare triple {3052#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3052#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} is VALID [2022-04-27 20:00:55,671 INFO L272 TraceCheckUtils]: 62: Hoare triple {3052#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2860#true} is VALID [2022-04-27 20:00:55,671 INFO L290 TraceCheckUtils]: 63: Hoare triple {2860#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2860#true} is VALID [2022-04-27 20:00:55,671 INFO L290 TraceCheckUtils]: 64: Hoare triple {2860#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[] {2860#true} is VALID [2022-04-27 20:00:55,671 INFO L290 TraceCheckUtils]: 65: Hoare triple {2860#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2860#true} is VALID [2022-04-27 20:00:55,671 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {2860#true} {3052#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3052#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} is VALID [2022-04-27 20:00:55,672 INFO L290 TraceCheckUtils]: 67: Hoare triple {3052#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {3074#(and (<= main_~k~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} is VALID [2022-04-27 20:00:55,673 INFO L272 TraceCheckUtils]: 68: Hoare triple {3074#(and (<= main_~k~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} [77] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~k~0_9 v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 v_main_~y~0_9))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_9, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {3078#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:00:55,687 INFO L290 TraceCheckUtils]: 69: Hoare triple {3078#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3082#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:00:55,687 INFO L290 TraceCheckUtils]: 70: Hoare triple {3082#(<= 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[] {2861#false} is VALID [2022-04-27 20:00:55,688 INFO L290 TraceCheckUtils]: 71: Hoare triple {2861#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2861#false} is VALID [2022-04-27 20:00:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 20:00:55,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:00:55,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:00:55,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441858027] [2022-04-27 20:00:55,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:00:55,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028788437] [2022-04-27 20:00:55,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028788437] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:00:55,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:00:55,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 20:00:55,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437730004] [2022-04-27 20:00:55,910 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:00:55,910 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-27 20:00:55,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:00:55,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 20:00:55,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:55,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 20:00:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:00:55,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 20:00:55,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 20:00:55,937 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 20:00:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:56,442 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-04-27 20:00:56,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 20:00:56,443 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-27 20:00:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:00:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 20:00:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2022-04-27 20:00:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 20:00:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2022-04-27 20:00:56,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 59 transitions. [2022-04-27 20:00:56,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:56,493 INFO L225 Difference]: With dead ends: 55 [2022-04-27 20:00:56,493 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 20:00:56,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-27 20:00:56,494 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 20:00:56,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 20:00:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 20:00:56,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 20:00:56,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:00:56,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 20:00:56,496 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 20:00:56,496 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 20:00:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:56,498 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 20:00:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 20:00:56,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:56,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:56,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-27 20:00:56,500 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-27 20:00:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:56,501 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 20:00:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 20:00:56,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:56,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:56,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:00:56,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:00:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 20:00:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-27 20:00:56,502 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 72 [2022-04-27 20:00:56,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:00:56,503 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-27 20:00:56,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 20:00:56,503 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 20:00:56,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-27 20:00:56,503 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:00:56,503 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:00:56,508 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:00:56,707 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:00:56,708 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:00:56,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:00:56,708 INFO L85 PathProgramCache]: Analyzing trace with hash 395442112, now seen corresponding path program 8 times [2022-04-27 20:00:56,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:00:56,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990688264] [2022-04-27 20:00:56,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:56,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:00:56,717 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:00:56,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955037536] [2022-04-27 20:00:56,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 20:00:56,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:00:56,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:00:56,718 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:00:56,720 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:00:57,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 20:00:57,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:00:57,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 20:00:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:57,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:00:57,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {3345#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {3345#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3345#true} is VALID [2022-04-27 20:00:57,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {3345#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3345#true} {3345#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {3345#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {3345#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {3345#true} is VALID [2022-04-27 20:00:57,769 INFO L272 TraceCheckUtils]: 6: Hoare triple {3345#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {3345#true} is VALID [2022-04-27 20:00:57,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {3345#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3345#true} is VALID [2022-04-27 20:00:57,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {3345#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[] {3345#true} is VALID [2022-04-27 20:00:57,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {3345#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,769 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3345#true} {3345#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {3345#true} is VALID [2022-04-27 20:00:57,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {3345#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {3383#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:57,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {3383#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3383#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:57,770 INFO L272 TraceCheckUtils]: 13: Hoare triple {3383#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3345#true} is VALID [2022-04-27 20:00:57,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {3345#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3345#true} is VALID [2022-04-27 20:00:57,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {3345#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[] {3345#true} is VALID [2022-04-27 20:00:57,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {3345#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,771 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3345#true} {3383#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3383#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:00:57,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {3383#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3405#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 20:00:57,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {3405#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3405#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 20:00:57,773 INFO L272 TraceCheckUtils]: 20: Hoare triple {3405#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3345#true} is VALID [2022-04-27 20:00:57,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {3345#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3345#true} is VALID [2022-04-27 20:00:57,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {3345#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[] {3345#true} is VALID [2022-04-27 20:00:57,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {3345#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,774 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3345#true} {3405#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3405#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 20:00:57,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {3405#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3427#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:00:57,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {3427#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3427#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:00:57,775 INFO L272 TraceCheckUtils]: 27: Hoare triple {3427#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3345#true} is VALID [2022-04-27 20:00:57,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {3345#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3345#true} is VALID [2022-04-27 20:00:57,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {3345#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[] {3345#true} is VALID [2022-04-27 20:00:57,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {3345#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,776 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3345#true} {3427#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3427#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:00:57,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {3427#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3449#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 20:00:57,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {3449#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3449#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 20:00:57,777 INFO L272 TraceCheckUtils]: 34: Hoare triple {3449#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3345#true} is VALID [2022-04-27 20:00:57,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {3345#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3345#true} is VALID [2022-04-27 20:00:57,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {3345#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[] {3345#true} is VALID [2022-04-27 20:00:57,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {3345#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,778 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3345#true} {3449#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3449#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 20:00:57,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {3449#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3471#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 20:00:57,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {3471#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3471#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 20:00:57,779 INFO L272 TraceCheckUtils]: 41: Hoare triple {3471#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3345#true} is VALID [2022-04-27 20:00:57,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {3345#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3345#true} is VALID [2022-04-27 20:00:57,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {3345#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[] {3345#true} is VALID [2022-04-27 20:00:57,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {3345#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,780 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3345#true} {3471#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3471#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 20:00:57,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {3471#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3493#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 20:00:57,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {3493#(and (= 5 main_~c~0) (= 5 main_~y~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3493#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 20:00:57,781 INFO L272 TraceCheckUtils]: 48: Hoare triple {3493#(and (= 5 main_~c~0) (= 5 main_~y~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3345#true} is VALID [2022-04-27 20:00:57,782 INFO L290 TraceCheckUtils]: 49: Hoare triple {3345#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3345#true} is VALID [2022-04-27 20:00:57,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {3345#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[] {3345#true} is VALID [2022-04-27 20:00:57,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {3345#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,782 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3345#true} {3493#(and (= 5 main_~c~0) (= 5 main_~y~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3493#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 20:00:57,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {3493#(and (= 5 main_~c~0) (= 5 main_~y~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3515#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 20:00:57,783 INFO L290 TraceCheckUtils]: 54: Hoare triple {3515#(and (= main_~y~0 6) (= main_~c~0 6))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3515#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 20:00:57,784 INFO L272 TraceCheckUtils]: 55: Hoare triple {3515#(and (= main_~y~0 6) (= main_~c~0 6))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3345#true} is VALID [2022-04-27 20:00:57,784 INFO L290 TraceCheckUtils]: 56: Hoare triple {3345#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3345#true} is VALID [2022-04-27 20:00:57,784 INFO L290 TraceCheckUtils]: 57: Hoare triple {3345#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[] {3345#true} is VALID [2022-04-27 20:00:57,784 INFO L290 TraceCheckUtils]: 58: Hoare triple {3345#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,785 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3345#true} {3515#(and (= main_~y~0 6) (= main_~c~0 6))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3515#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 20:00:57,785 INFO L290 TraceCheckUtils]: 60: Hoare triple {3515#(and (= main_~y~0 6) (= main_~c~0 6))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3537#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 20:00:57,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {3537#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3537#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 20:00:57,786 INFO L272 TraceCheckUtils]: 62: Hoare triple {3537#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3345#true} is VALID [2022-04-27 20:00:57,786 INFO L290 TraceCheckUtils]: 63: Hoare triple {3345#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3345#true} is VALID [2022-04-27 20:00:57,786 INFO L290 TraceCheckUtils]: 64: Hoare triple {3345#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[] {3345#true} is VALID [2022-04-27 20:00:57,786 INFO L290 TraceCheckUtils]: 65: Hoare triple {3345#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,787 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3345#true} {3537#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3537#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 20:00:57,787 INFO L290 TraceCheckUtils]: 67: Hoare triple {3537#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3559#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 20:00:57,788 INFO L290 TraceCheckUtils]: 68: Hoare triple {3559#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3559#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 20:00:57,788 INFO L272 TraceCheckUtils]: 69: Hoare triple {3559#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3345#true} is VALID [2022-04-27 20:00:57,788 INFO L290 TraceCheckUtils]: 70: Hoare triple {3345#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3345#true} is VALID [2022-04-27 20:00:57,788 INFO L290 TraceCheckUtils]: 71: Hoare triple {3345#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[] {3345#true} is VALID [2022-04-27 20:00:57,788 INFO L290 TraceCheckUtils]: 72: Hoare triple {3345#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#true} is VALID [2022-04-27 20:00:57,789 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3345#true} {3559#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3559#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 20:00:57,790 INFO L290 TraceCheckUtils]: 74: Hoare triple {3559#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {3581#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} is VALID [2022-04-27 20:00:57,790 INFO L272 TraceCheckUtils]: 75: Hoare triple {3581#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} [77] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~k~0_9 v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 v_main_~y~0_9))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_9, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {3585#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:00:57,791 INFO L290 TraceCheckUtils]: 76: Hoare triple {3585#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3589#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:00:57,791 INFO L290 TraceCheckUtils]: 77: Hoare triple {3589#(<= 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[] {3346#false} is VALID [2022-04-27 20:00:57,791 INFO L290 TraceCheckUtils]: 78: Hoare triple {3346#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3346#false} is VALID [2022-04-27 20:00:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 20:00:57,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:00:58,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:00:58,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990688264] [2022-04-27 20:00:58,080 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:00:58,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955037536] [2022-04-27 20:00:58,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955037536] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:00:58,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:00:58,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 20:00:58,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429207201] [2022-04-27 20:00:58,081 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:00:58,081 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 79 [2022-04-27 20:00:58,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:00:58,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 20:00:58,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:58,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 20:00:58,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:00:58,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 20:00:58,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 20:00:58,128 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 20:00:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:59,042 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-27 20:00:59,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 20:00:59,043 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 79 [2022-04-27 20:00:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:00:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 20:00:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2022-04-27 20:00:59,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 20:00:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2022-04-27 20:00:59,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 63 transitions. [2022-04-27 20:00:59,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:00:59,097 INFO L225 Difference]: With dead ends: 58 [2022-04-27 20:00:59,097 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 20:00:59,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-27 20:00:59,098 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 20:00:59,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 353 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 20:00:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 20:00:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 20:00:59,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:00:59,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 20:00:59,101 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 20:00:59,102 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 20:00:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:59,103 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-27 20:00:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 20:00:59,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:59,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:59,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-27 20:00:59,104 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-27 20:00:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:00:59,105 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-27 20:00:59,105 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 20:00:59,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:00:59,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:00:59,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:00:59,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:00:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 20:00:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-04-27 20:00:59,107 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 79 [2022-04-27 20:00:59,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:00:59,107 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-04-27 20:00:59,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 20:00:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 20:00:59,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-27 20:00:59,108 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:00:59,108 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:00:59,114 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:00:59,310 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:00:59,311 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:00:59,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:00:59,311 INFO L85 PathProgramCache]: Analyzing trace with hash 667883026, now seen corresponding path program 9 times [2022-04-27 20:00:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:00:59,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583314009] [2022-04-27 20:00:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:00:59,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:00:59,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:00:59,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [657566923] [2022-04-27 20:00:59,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 20:00:59,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:00:59,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:00:59,349 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:00:59,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 20:00:59,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 20:00:59,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:00:59,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-27 20:00:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:00:59,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:01:00,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {3864#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {3864#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3864#true} is VALID [2022-04-27 20:01:00,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {3864#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3864#true} {3864#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {3864#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {3864#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {3864#true} is VALID [2022-04-27 20:01:00,203 INFO L272 TraceCheckUtils]: 6: Hoare triple {3864#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {3864#true} is VALID [2022-04-27 20:01:00,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {3864#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3864#true} is VALID [2022-04-27 20:01:00,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {3864#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[] {3864#true} is VALID [2022-04-27 20:01:00,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {3864#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,203 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3864#true} {3864#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {3864#true} is VALID [2022-04-27 20:01:00,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {3864#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {3902#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:01:00,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {3902#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3902#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:01:00,204 INFO L272 TraceCheckUtils]: 13: Hoare triple {3902#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3864#true} is VALID [2022-04-27 20:01:00,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {3864#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3864#true} is VALID [2022-04-27 20:01:00,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {3864#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[] {3864#true} is VALID [2022-04-27 20:01:00,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {3864#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,205 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3864#true} {3902#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3902#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:01:00,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {3902#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3924#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 20:01:00,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {3924#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3924#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 20:01:00,206 INFO L272 TraceCheckUtils]: 20: Hoare triple {3924#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3864#true} is VALID [2022-04-27 20:01:00,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {3864#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3864#true} is VALID [2022-04-27 20:01:00,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {3864#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[] {3864#true} is VALID [2022-04-27 20:01:00,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {3864#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,206 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3864#true} {3924#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3924#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 20:01:00,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {3924#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3946#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 20:01:00,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {3946#(and (= main_~y~0 2) (= main_~c~0 2))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3946#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 20:01:00,215 INFO L272 TraceCheckUtils]: 27: Hoare triple {3946#(and (= main_~y~0 2) (= main_~c~0 2))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3864#true} is VALID [2022-04-27 20:01:00,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {3864#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3864#true} is VALID [2022-04-27 20:01:00,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {3864#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[] {3864#true} is VALID [2022-04-27 20:01:00,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {3864#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,216 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3864#true} {3946#(and (= main_~y~0 2) (= main_~c~0 2))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3946#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 20:01:00,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {3946#(and (= main_~y~0 2) (= main_~c~0 2))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3968#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 20:01:00,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {3968#(and (= main_~y~0 3) (= main_~c~0 3))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3968#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 20:01:00,216 INFO L272 TraceCheckUtils]: 34: Hoare triple {3968#(and (= main_~y~0 3) (= main_~c~0 3))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3864#true} is VALID [2022-04-27 20:01:00,217 INFO L290 TraceCheckUtils]: 35: Hoare triple {3864#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3864#true} is VALID [2022-04-27 20:01:00,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {3864#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[] {3864#true} is VALID [2022-04-27 20:01:00,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {3864#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,217 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3864#true} {3968#(and (= main_~y~0 3) (= main_~c~0 3))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3968#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 20:01:00,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {3968#(and (= main_~y~0 3) (= main_~c~0 3))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3990#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 20:01:00,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {3990#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3990#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 20:01:00,218 INFO L272 TraceCheckUtils]: 41: Hoare triple {3990#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3864#true} is VALID [2022-04-27 20:01:00,218 INFO L290 TraceCheckUtils]: 42: Hoare triple {3864#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3864#true} is VALID [2022-04-27 20:01:00,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {3864#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[] {3864#true} is VALID [2022-04-27 20:01:00,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {3864#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,219 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3864#true} {3990#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3990#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 20:01:00,219 INFO L290 TraceCheckUtils]: 46: Hoare triple {3990#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4012#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 20:01:00,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {4012#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4012#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 20:01:00,220 INFO L272 TraceCheckUtils]: 48: Hoare triple {4012#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3864#true} is VALID [2022-04-27 20:01:00,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {3864#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3864#true} is VALID [2022-04-27 20:01:00,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {3864#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[] {3864#true} is VALID [2022-04-27 20:01:00,220 INFO L290 TraceCheckUtils]: 51: Hoare triple {3864#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,220 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3864#true} {4012#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4012#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 20:01:00,221 INFO L290 TraceCheckUtils]: 53: Hoare triple {4012#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4034#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 20:01:00,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {4034#(and (= main_~y~0 6) (= main_~c~0 6))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4034#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 20:01:00,235 INFO L272 TraceCheckUtils]: 55: Hoare triple {4034#(and (= main_~y~0 6) (= main_~c~0 6))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3864#true} is VALID [2022-04-27 20:01:00,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {3864#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3864#true} is VALID [2022-04-27 20:01:00,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {3864#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[] {3864#true} is VALID [2022-04-27 20:01:00,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {3864#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,236 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3864#true} {4034#(and (= main_~y~0 6) (= main_~c~0 6))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4034#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 20:01:00,236 INFO L290 TraceCheckUtils]: 60: Hoare triple {4034#(and (= main_~y~0 6) (= main_~c~0 6))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4056#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-27 20:01:00,236 INFO L290 TraceCheckUtils]: 61: Hoare triple {4056#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4056#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-27 20:01:00,237 INFO L272 TraceCheckUtils]: 62: Hoare triple {4056#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3864#true} is VALID [2022-04-27 20:01:00,237 INFO L290 TraceCheckUtils]: 63: Hoare triple {3864#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3864#true} is VALID [2022-04-27 20:01:00,237 INFO L290 TraceCheckUtils]: 64: Hoare triple {3864#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[] {3864#true} is VALID [2022-04-27 20:01:00,237 INFO L290 TraceCheckUtils]: 65: Hoare triple {3864#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,237 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3864#true} {4056#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4056#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-27 20:01:00,238 INFO L290 TraceCheckUtils]: 67: Hoare triple {4056#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4078#(and (= main_~y~0 8) (= main_~c~0 8) (< 6 main_~k~0))} is VALID [2022-04-27 20:01:00,238 INFO L290 TraceCheckUtils]: 68: Hoare triple {4078#(and (= main_~y~0 8) (= main_~c~0 8) (< 6 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4078#(and (= main_~y~0 8) (= main_~c~0 8) (< 6 main_~k~0))} is VALID [2022-04-27 20:01:00,238 INFO L272 TraceCheckUtils]: 69: Hoare triple {4078#(and (= main_~y~0 8) (= main_~c~0 8) (< 6 main_~k~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3864#true} is VALID [2022-04-27 20:01:00,238 INFO L290 TraceCheckUtils]: 70: Hoare triple {3864#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3864#true} is VALID [2022-04-27 20:01:00,238 INFO L290 TraceCheckUtils]: 71: Hoare triple {3864#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[] {3864#true} is VALID [2022-04-27 20:01:00,238 INFO L290 TraceCheckUtils]: 72: Hoare triple {3864#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,239 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3864#true} {4078#(and (= main_~y~0 8) (= main_~c~0 8) (< 6 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4078#(and (= main_~y~0 8) (= main_~c~0 8) (< 6 main_~k~0))} is VALID [2022-04-27 20:01:00,239 INFO L290 TraceCheckUtils]: 74: Hoare triple {4078#(and (= main_~y~0 8) (= main_~c~0 8) (< 6 main_~k~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4100#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 20:01:00,240 INFO L290 TraceCheckUtils]: 75: Hoare triple {4100#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4100#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 20:01:00,240 INFO L272 TraceCheckUtils]: 76: Hoare triple {4100#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3864#true} is VALID [2022-04-27 20:01:00,240 INFO L290 TraceCheckUtils]: 77: Hoare triple {3864#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3864#true} is VALID [2022-04-27 20:01:00,240 INFO L290 TraceCheckUtils]: 78: Hoare triple {3864#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[] {3864#true} is VALID [2022-04-27 20:01:00,240 INFO L290 TraceCheckUtils]: 79: Hoare triple {3864#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3864#true} is VALID [2022-04-27 20:01:00,240 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {3864#true} {4100#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4100#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 20:01:00,241 INFO L290 TraceCheckUtils]: 81: Hoare triple {4100#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {4122#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 20:01:00,242 INFO L272 TraceCheckUtils]: 82: Hoare triple {4122#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} [77] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~k~0_9 v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 v_main_~y~0_9))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_9, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {4126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:01:00,242 INFO L290 TraceCheckUtils]: 83: Hoare triple {4126#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:01:00,242 INFO L290 TraceCheckUtils]: 84: Hoare triple {4130#(<= 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[] {3865#false} is VALID [2022-04-27 20:01:00,242 INFO L290 TraceCheckUtils]: 85: Hoare triple {3865#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3865#false} is VALID [2022-04-27 20:01:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 20:01:00,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:01:00,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:01:00,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583314009] [2022-04-27 20:01:00,689 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:01:00,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657566923] [2022-04-27 20:01:00,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657566923] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:01:00,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:01:00,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 20:01:00,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797754140] [2022-04-27 20:01:00,689 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:01:00,690 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-27 20:01:00,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:01:00,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 20:01:00,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:01:00,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 20:01:00,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:01:00,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 20:01:00,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-27 20:01:00,731 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 20:01:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:01:01,659 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-27 20:01:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 20:01:01,659 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-27 20:01:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:01:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 20:01:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2022-04-27 20:01:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 20:01:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2022-04-27 20:01:01,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 67 transitions. [2022-04-27 20:01:01,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:01:01,699 INFO L225 Difference]: With dead ends: 61 [2022-04-27 20:01:01,699 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 20:01:01,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-04-27 20:01:01,700 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 20:01:01,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 393 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 20:01:01,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 20:01:01,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 20:01:01,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:01:01,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 20:01:01,703 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 20:01:01,703 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 20:01:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:01:01,704 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-27 20:01:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 20:01:01,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:01:01,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:01:01,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-27 20:01:01,705 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-27 20:01:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:01:01,709 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-27 20:01:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 20:01:01,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:01:01,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:01:01,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:01:01,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:01:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 20:01:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-27 20:01:01,710 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 86 [2022-04-27 20:01:01,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:01:01,711 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-27 20:01:01,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 20:01:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 20:01:01,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-27 20:01:01,711 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:01:01,711 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:01:01,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 20:01:01,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 20:01:01,917 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:01:01,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:01:01,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1918146432, now seen corresponding path program 10 times [2022-04-27 20:01:01,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:01:01,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310801980] [2022-04-27 20:01:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:01:01,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:01:01,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:01:01,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264756247] [2022-04-27 20:01:01,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 20:01:01,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:01:01,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:01:01,939 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:01:01,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 20:01:02,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 20:01:02,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:01:02,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 20:01:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:01:02,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:01:02,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {4461#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {4461#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4461#true} is VALID [2022-04-27 20:01:02,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {4461#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4461#true} {4461#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {4461#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {4461#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {4461#true} is VALID [2022-04-27 20:01:02,773 INFO L272 TraceCheckUtils]: 6: Hoare triple {4461#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {4461#true} is VALID [2022-04-27 20:01:02,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {4461#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4461#true} is VALID [2022-04-27 20:01:02,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {4461#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[] {4461#true} is VALID [2022-04-27 20:01:02,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {4461#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,774 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4461#true} {4461#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {4461#true} is VALID [2022-04-27 20:01:02,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {4461#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {4499#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:01:02,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {4499#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4499#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:01:02,774 INFO L272 TraceCheckUtils]: 13: Hoare triple {4499#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4461#true} is VALID [2022-04-27 20:01:02,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {4461#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4461#true} is VALID [2022-04-27 20:01:02,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {4461#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[] {4461#true} is VALID [2022-04-27 20:01:02,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {4461#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,775 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4461#true} {4499#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4499#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:01:02,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {4499#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4521#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 20:01:02,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {4521#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4521#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 20:01:02,775 INFO L272 TraceCheckUtils]: 20: Hoare triple {4521#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4461#true} is VALID [2022-04-27 20:01:02,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {4461#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4461#true} is VALID [2022-04-27 20:01:02,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {4461#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[] {4461#true} is VALID [2022-04-27 20:01:02,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {4461#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,776 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4461#true} {4521#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4521#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 20:01:02,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {4521#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4543#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 20:01:02,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {4543#(and (= main_~y~0 2) (= main_~c~0 2))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4543#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 20:01:02,776 INFO L272 TraceCheckUtils]: 27: Hoare triple {4543#(and (= main_~y~0 2) (= main_~c~0 2))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4461#true} is VALID [2022-04-27 20:01:02,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {4461#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4461#true} is VALID [2022-04-27 20:01:02,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {4461#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[] {4461#true} is VALID [2022-04-27 20:01:02,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {4461#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,777 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4461#true} {4543#(and (= main_~y~0 2) (= main_~c~0 2))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4543#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 20:01:02,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {4543#(and (= main_~y~0 2) (= main_~c~0 2))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4565#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 20:01:02,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {4565#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4565#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 20:01:02,778 INFO L272 TraceCheckUtils]: 34: Hoare triple {4565#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4461#true} is VALID [2022-04-27 20:01:02,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {4461#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4461#true} is VALID [2022-04-27 20:01:02,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {4461#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[] {4461#true} is VALID [2022-04-27 20:01:02,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {4461#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,778 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4461#true} {4565#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4565#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 20:01:02,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {4565#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4587#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 20:01:02,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {4587#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4587#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 20:01:02,779 INFO L272 TraceCheckUtils]: 41: Hoare triple {4587#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4461#true} is VALID [2022-04-27 20:01:02,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {4461#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4461#true} is VALID [2022-04-27 20:01:02,779 INFO L290 TraceCheckUtils]: 43: Hoare triple {4461#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[] {4461#true} is VALID [2022-04-27 20:01:02,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {4461#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,780 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4461#true} {4587#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4587#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 20:01:02,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {4587#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4609#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 20:01:02,780 INFO L290 TraceCheckUtils]: 47: Hoare triple {4609#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4609#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 20:01:02,780 INFO L272 TraceCheckUtils]: 48: Hoare triple {4609#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4461#true} is VALID [2022-04-27 20:01:02,780 INFO L290 TraceCheckUtils]: 49: Hoare triple {4461#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4461#true} is VALID [2022-04-27 20:01:02,781 INFO L290 TraceCheckUtils]: 50: Hoare triple {4461#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[] {4461#true} is VALID [2022-04-27 20:01:02,781 INFO L290 TraceCheckUtils]: 51: Hoare triple {4461#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,781 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4461#true} {4609#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4609#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 20:01:02,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {4609#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4631#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:01:02,782 INFO L290 TraceCheckUtils]: 54: Hoare triple {4631#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4631#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:01:02,782 INFO L272 TraceCheckUtils]: 55: Hoare triple {4631#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4461#true} is VALID [2022-04-27 20:01:02,782 INFO L290 TraceCheckUtils]: 56: Hoare triple {4461#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4461#true} is VALID [2022-04-27 20:01:02,782 INFO L290 TraceCheckUtils]: 57: Hoare triple {4461#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[] {4461#true} is VALID [2022-04-27 20:01:02,782 INFO L290 TraceCheckUtils]: 58: Hoare triple {4461#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,782 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4461#true} {4631#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4631#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:01:02,783 INFO L290 TraceCheckUtils]: 60: Hoare triple {4631#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4653#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 20:01:02,783 INFO L290 TraceCheckUtils]: 61: Hoare triple {4653#(and (= 7 main_~y~0) (= 7 main_~c~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4653#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 20:01:02,783 INFO L272 TraceCheckUtils]: 62: Hoare triple {4653#(and (= 7 main_~y~0) (= 7 main_~c~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4461#true} is VALID [2022-04-27 20:01:02,783 INFO L290 TraceCheckUtils]: 63: Hoare triple {4461#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4461#true} is VALID [2022-04-27 20:01:02,783 INFO L290 TraceCheckUtils]: 64: Hoare triple {4461#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[] {4461#true} is VALID [2022-04-27 20:01:02,783 INFO L290 TraceCheckUtils]: 65: Hoare triple {4461#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,784 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4461#true} {4653#(and (= 7 main_~y~0) (= 7 main_~c~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4653#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 20:01:02,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {4653#(and (= 7 main_~y~0) (= 7 main_~c~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4675#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 20:01:02,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {4675#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4675#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 20:01:02,784 INFO L272 TraceCheckUtils]: 69: Hoare triple {4675#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4461#true} is VALID [2022-04-27 20:01:02,784 INFO L290 TraceCheckUtils]: 70: Hoare triple {4461#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4461#true} is VALID [2022-04-27 20:01:02,784 INFO L290 TraceCheckUtils]: 71: Hoare triple {4461#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[] {4461#true} is VALID [2022-04-27 20:01:02,784 INFO L290 TraceCheckUtils]: 72: Hoare triple {4461#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,785 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4461#true} {4675#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4675#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 20:01:02,785 INFO L290 TraceCheckUtils]: 74: Hoare triple {4675#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4697#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:01:02,785 INFO L290 TraceCheckUtils]: 75: Hoare triple {4697#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4697#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:01:02,786 INFO L272 TraceCheckUtils]: 76: Hoare triple {4697#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4461#true} is VALID [2022-04-27 20:01:02,786 INFO L290 TraceCheckUtils]: 77: Hoare triple {4461#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4461#true} is VALID [2022-04-27 20:01:02,786 INFO L290 TraceCheckUtils]: 78: Hoare triple {4461#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[] {4461#true} is VALID [2022-04-27 20:01:02,786 INFO L290 TraceCheckUtils]: 79: Hoare triple {4461#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,786 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4461#true} {4697#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4697#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:01:02,786 INFO L290 TraceCheckUtils]: 81: Hoare triple {4697#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4719#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 20:01:02,787 INFO L290 TraceCheckUtils]: 82: Hoare triple {4719#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4719#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 20:01:02,787 INFO L272 TraceCheckUtils]: 83: Hoare triple {4719#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4461#true} is VALID [2022-04-27 20:01:02,787 INFO L290 TraceCheckUtils]: 84: Hoare triple {4461#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4461#true} is VALID [2022-04-27 20:01:02,787 INFO L290 TraceCheckUtils]: 85: Hoare triple {4461#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[] {4461#true} is VALID [2022-04-27 20:01:02,787 INFO L290 TraceCheckUtils]: 86: Hoare triple {4461#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4461#true} is VALID [2022-04-27 20:01:02,787 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {4461#true} {4719#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4719#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 20:01:02,788 INFO L290 TraceCheckUtils]: 88: Hoare triple {4719#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {4741#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 20:01:02,789 INFO L272 TraceCheckUtils]: 89: Hoare triple {4741#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} [77] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~k~0_9 v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 v_main_~y~0_9))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_9, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {4745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:01:02,789 INFO L290 TraceCheckUtils]: 90: Hoare triple {4745#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:01:02,789 INFO L290 TraceCheckUtils]: 91: Hoare triple {4749#(<= 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[] {4462#false} is VALID [2022-04-27 20:01:02,789 INFO L290 TraceCheckUtils]: 92: Hoare triple {4462#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4462#false} is VALID [2022-04-27 20:01:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 22 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 20:01:02,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:01:03,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:01:03,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310801980] [2022-04-27 20:01:03,023 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:01:03,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264756247] [2022-04-27 20:01:03,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264756247] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:01:03,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:01:03,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 20:01:03,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299626117] [2022-04-27 20:01:03,023 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:01:03,024 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-27 20:01:03,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:01:03,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 20:01:03,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:01:03,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 20:01:03,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:01:03,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 20:01:03,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-27 20:01:03,105 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 20:01:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:01:04,192 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-27 20:01:04,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 20:01:04,192 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-27 20:01:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:01:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 20:01:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-27 20:01:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 20:01:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-27 20:01:04,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 71 transitions. [2022-04-27 20:01:04,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:01:04,245 INFO L225 Difference]: With dead ends: 64 [2022-04-27 20:01:04,245 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 20:01:04,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-27 20:01:04,246 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 20:01:04,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 20:01:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 20:01:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 20:01:04,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:01:04,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 20:01:04,249 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 20:01:04,249 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 20:01:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:01:04,250 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-27 20:01:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 20:01:04,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:01:04,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:01:04,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-27 20:01:04,250 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-27 20:01:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:01:04,252 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-27 20:01:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 20:01:04,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:01:04,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:01:04,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:01:04,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:01:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 20:01:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-27 20:01:04,257 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 93 [2022-04-27 20:01:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:01:04,258 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-27 20:01:04,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 20:01:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 20:01:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 20:01:04,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:01:04,259 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:01:04,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 20:01:04,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 20:01:04,475 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:01:04,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:01:04,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1384988242, now seen corresponding path program 11 times [2022-04-27 20:01:04,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:01:04,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742063149] [2022-04-27 20:01:04,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:01:04,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:01:04,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:01:04,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964495024] [2022-04-27 20:01:04,494 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 20:01:04,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:01:04,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:01:04,495 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:01:04,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 20:01:04,556 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-27 20:01:04,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:01:04,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 20:01:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:01:04,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:01:05,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {5048#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {5048#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5048#true} is VALID [2022-04-27 20:01:05,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {5048#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5048#true} {5048#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {5048#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {5048#true} [67] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {5048#true} is VALID [2022-04-27 20:01:05,370 INFO L272 TraceCheckUtils]: 6: Hoare triple {5048#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {5048#true} is VALID [2022-04-27 20:01:05,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {5048#true} [71] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5074#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 20:01:05,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {5074#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [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[] {5078#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 20:01:05,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {5078#(not (= |assume_abort_if_not_#in~cond| 0))} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5078#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 20:01:05,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5078#(not (= |assume_abort_if_not_#in~cond| 0))} {5048#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_8) (<= v_main_~k~0_8 10)) 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] {5085#(and (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 20:01:05,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {5085#(and (<= main_~k~0 10) (<= 0 main_~k~0))} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_3 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {5089#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 20:01:05,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {5089#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5089#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 20:01:05,373 INFO L272 TraceCheckUtils]: 13: Hoare triple {5089#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5048#true} is VALID [2022-04-27 20:01:05,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {5048#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5048#true} is VALID [2022-04-27 20:01:05,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {5048#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[] {5048#true} is VALID [2022-04-27 20:01:05,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {5048#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,373 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5048#true} {5089#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5089#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 20:01:05,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {5089#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5111#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 20:01:05,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {5111#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5111#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 20:01:05,375 INFO L272 TraceCheckUtils]: 20: Hoare triple {5111#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5048#true} is VALID [2022-04-27 20:01:05,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {5048#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5048#true} is VALID [2022-04-27 20:01:05,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {5048#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[] {5048#true} is VALID [2022-04-27 20:01:05,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {5048#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,376 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5048#true} {5111#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5111#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 20:01:05,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {5111#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5133#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 20:01:05,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {5133#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5133#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 20:01:05,377 INFO L272 TraceCheckUtils]: 27: Hoare triple {5133#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5048#true} is VALID [2022-04-27 20:01:05,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {5048#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5048#true} is VALID [2022-04-27 20:01:05,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {5048#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[] {5048#true} is VALID [2022-04-27 20:01:05,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {5048#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,378 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5048#true} {5133#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5133#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 20:01:05,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {5133#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5155#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 20:01:05,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {5155#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5155#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 20:01:05,379 INFO L272 TraceCheckUtils]: 34: Hoare triple {5155#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5048#true} is VALID [2022-04-27 20:01:05,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {5048#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5048#true} is VALID [2022-04-27 20:01:05,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {5048#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[] {5048#true} is VALID [2022-04-27 20:01:05,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {5048#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,379 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5048#true} {5155#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5155#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 20:01:05,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {5155#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5177#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 20:01:05,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {5177#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5177#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 20:01:05,380 INFO L272 TraceCheckUtils]: 41: Hoare triple {5177#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5048#true} is VALID [2022-04-27 20:01:05,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {5048#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5048#true} is VALID [2022-04-27 20:01:05,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {5048#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[] {5048#true} is VALID [2022-04-27 20:01:05,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {5048#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,381 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5048#true} {5177#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5177#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 20:01:05,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {5177#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5199#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 20:01:05,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {5199#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5199#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 20:01:05,382 INFO L272 TraceCheckUtils]: 48: Hoare triple {5199#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5048#true} is VALID [2022-04-27 20:01:05,382 INFO L290 TraceCheckUtils]: 49: Hoare triple {5048#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5048#true} is VALID [2022-04-27 20:01:05,382 INFO L290 TraceCheckUtils]: 50: Hoare triple {5048#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[] {5048#true} is VALID [2022-04-27 20:01:05,382 INFO L290 TraceCheckUtils]: 51: Hoare triple {5048#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,383 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5048#true} {5199#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5199#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 20:01:05,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {5199#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5221#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-27 20:01:05,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {5221#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5221#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-27 20:01:05,384 INFO L272 TraceCheckUtils]: 55: Hoare triple {5221#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5048#true} is VALID [2022-04-27 20:01:05,384 INFO L290 TraceCheckUtils]: 56: Hoare triple {5048#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5048#true} is VALID [2022-04-27 20:01:05,384 INFO L290 TraceCheckUtils]: 57: Hoare triple {5048#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[] {5048#true} is VALID [2022-04-27 20:01:05,384 INFO L290 TraceCheckUtils]: 58: Hoare triple {5048#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,385 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5048#true} {5221#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5221#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-27 20:01:05,385 INFO L290 TraceCheckUtils]: 60: Hoare triple {5221#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5243#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-27 20:01:05,386 INFO L290 TraceCheckUtils]: 61: Hoare triple {5243#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5243#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-27 20:01:05,386 INFO L272 TraceCheckUtils]: 62: Hoare triple {5243#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5048#true} is VALID [2022-04-27 20:01:05,386 INFO L290 TraceCheckUtils]: 63: Hoare triple {5048#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5048#true} is VALID [2022-04-27 20:01:05,386 INFO L290 TraceCheckUtils]: 64: Hoare triple {5048#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[] {5048#true} is VALID [2022-04-27 20:01:05,386 INFO L290 TraceCheckUtils]: 65: Hoare triple {5048#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,387 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5048#true} {5243#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5243#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-27 20:01:05,387 INFO L290 TraceCheckUtils]: 67: Hoare triple {5243#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5265#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-27 20:01:05,388 INFO L290 TraceCheckUtils]: 68: Hoare triple {5265#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-27 20:01:05,388 INFO L272 TraceCheckUtils]: 69: Hoare triple {5265#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5048#true} is VALID [2022-04-27 20:01:05,388 INFO L290 TraceCheckUtils]: 70: Hoare triple {5048#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5048#true} is VALID [2022-04-27 20:01:05,388 INFO L290 TraceCheckUtils]: 71: Hoare triple {5048#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[] {5048#true} is VALID [2022-04-27 20:01:05,388 INFO L290 TraceCheckUtils]: 72: Hoare triple {5048#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,389 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5048#true} {5265#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5265#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-27 20:01:05,389 INFO L290 TraceCheckUtils]: 74: Hoare triple {5265#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5287#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 20:01:05,390 INFO L290 TraceCheckUtils]: 75: Hoare triple {5287#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5287#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 20:01:05,390 INFO L272 TraceCheckUtils]: 76: Hoare triple {5287#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5048#true} is VALID [2022-04-27 20:01:05,390 INFO L290 TraceCheckUtils]: 77: Hoare triple {5048#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5048#true} is VALID [2022-04-27 20:01:05,390 INFO L290 TraceCheckUtils]: 78: Hoare triple {5048#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[] {5048#true} is VALID [2022-04-27 20:01:05,390 INFO L290 TraceCheckUtils]: 79: Hoare triple {5048#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,390 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5048#true} {5287#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5287#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 20:01:05,391 INFO L290 TraceCheckUtils]: 81: Hoare triple {5287#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5309#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 20:01:05,392 INFO L290 TraceCheckUtils]: 82: Hoare triple {5309#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5309#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 20:01:05,392 INFO L272 TraceCheckUtils]: 83: Hoare triple {5309#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5048#true} is VALID [2022-04-27 20:01:05,392 INFO L290 TraceCheckUtils]: 84: Hoare triple {5048#true} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5048#true} is VALID [2022-04-27 20:01:05,392 INFO L290 TraceCheckUtils]: 85: Hoare triple {5048#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[] {5048#true} is VALID [2022-04-27 20:01:05,392 INFO L290 TraceCheckUtils]: 86: Hoare triple {5048#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5048#true} is VALID [2022-04-27 20:01:05,392 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5048#true} {5309#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5309#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 20:01:05,393 INFO L290 TraceCheckUtils]: 88: Hoare triple {5309#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} [83] L28-1-->L27-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_6) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5))))) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5049#false} is VALID [2022-04-27 20:01:05,393 INFO L290 TraceCheckUtils]: 89: Hoare triple {5049#false} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5049#false} is VALID [2022-04-27 20:01:05,393 INFO L272 TraceCheckUtils]: 90: Hoare triple {5049#false} [78] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5049#false} is VALID [2022-04-27 20:01:05,393 INFO L290 TraceCheckUtils]: 91: Hoare triple {5049#false} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5049#false} is VALID [2022-04-27 20:01:05,393 INFO L290 TraceCheckUtils]: 92: Hoare triple {5049#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[] {5049#false} is VALID [2022-04-27 20:01:05,393 INFO L290 TraceCheckUtils]: 93: Hoare triple {5049#false} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5049#false} is VALID [2022-04-27 20:01:05,393 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {5049#false} {5049#false} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (* v_main_~y~0_8 v_main_~y~0_8))) (+ (* v_main_~x~0_7 4) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* (* v_main_~y~0_8 .cse0) v_main_~y~0_8)) (* (- 1) .cse0))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5049#false} is VALID [2022-04-27 20:01:05,394 INFO L290 TraceCheckUtils]: 95: Hoare triple {5049#false} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {5049#false} is VALID [2022-04-27 20:01:05,394 INFO L272 TraceCheckUtils]: 96: Hoare triple {5049#false} [77] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~k~0_9 v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 v_main_~y~0_9))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_9, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {5049#false} is VALID [2022-04-27 20:01:05,394 INFO L290 TraceCheckUtils]: 97: Hoare triple {5049#false} [81] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5049#false} is VALID [2022-04-27 20:01:05,394 INFO L290 TraceCheckUtils]: 98: Hoare triple {5049#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[] {5049#false} is VALID [2022-04-27 20:01:05,394 INFO L290 TraceCheckUtils]: 99: Hoare triple {5049#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5049#false} is VALID [2022-04-27 20:01:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-04-27 20:01:05,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 20:01:05,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:01:05,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742063149] [2022-04-27 20:01:05,395 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:01:05,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964495024] [2022-04-27 20:01:05,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964495024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:01:05,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:01:05,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-27 20:01:05,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2599474] [2022-04-27 20:01:05,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:01:05,395 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-27 20:01:05,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:01:05,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 20:01:05,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:01:05,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 20:01:05,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:01:05,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 20:01:05,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2022-04-27 20:01:05,447 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 20:01:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:01:05,806 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 20:01:05,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 20:01:05,806 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-27 20:01:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:01:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 20:01:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 59 transitions. [2022-04-27 20:01:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 20:01:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 59 transitions. [2022-04-27 20:01:05,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 59 transitions. [2022-04-27 20:01:05,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:01:05,837 INFO L225 Difference]: With dead ends: 53 [2022-04-27 20:01:05,837 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 20:01:05,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2022-04-27 20:01:05,839 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:01:05,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 216 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:01:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 20:01:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 20:01:05,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:01:05,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 20:01:05,840 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 20:01:05,840 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 20:01:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:01:05,840 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 20:01:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:01:05,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:01:05,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:01:05,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 20:01:05,841 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 20:01:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:01:05,841 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 20:01:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:01:05,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:01:05,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:01:05,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:01:05,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:01:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 20:01:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 20:01:05,841 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2022-04-27 20:01:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:01:05,841 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 20:01:05,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 20:01:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:01:05,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:01:05,857 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 20:01:05,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 20:01:06,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 20:01:06,062 INFO L356 BasicCegarLoop]: Path program histogram: [11, 1, 1, 1] [2022-04-27 20:01:06,063 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 20:01:06,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:01:06 BasicIcfg [2022-04-27 20:01:06,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 20:01:06,073 INFO L158 Benchmark]: Toolchain (without parser) took 22645.75ms. Allocated memory was 185.6MB in the beginning and 335.5MB in the end (delta: 149.9MB). Free memory was 136.6MB in the beginning and 213.1MB in the end (delta: -76.4MB). Peak memory consumption was 75.0MB. Max. memory is 8.0GB. [2022-04-27 20:01:06,073 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory was 152.8MB in the beginning and 152.7MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 20:01:06,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.91ms. Allocated memory is still 185.6MB. Free memory was 136.5MB in the beginning and 161.3MB in the end (delta: -24.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 20:01:06,073 INFO L158 Benchmark]: Boogie Preprocessor took 20.17ms. Allocated memory is still 185.6MB. Free memory was 161.3MB in the beginning and 159.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 20:01:06,073 INFO L158 Benchmark]: RCFGBuilder took 253.15ms. Allocated memory is still 185.6MB. Free memory was 159.8MB in the beginning and 148.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 20:01:06,073 INFO L158 Benchmark]: IcfgTransformer took 64.75ms. Allocated memory is still 185.6MB. Free memory was 148.8MB in the beginning and 147.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 20:01:06,073 INFO L158 Benchmark]: TraceAbstraction took 22088.02ms. Allocated memory was 185.6MB in the beginning and 335.5MB in the end (delta: 149.9MB). Free memory was 146.7MB in the beginning and 213.1MB in the end (delta: -66.4MB). Peak memory consumption was 84.6MB. Max. memory is 8.0GB. [2022-04-27 20:01:06,074 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 185.6MB. Free memory was 152.8MB in the beginning and 152.7MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.91ms. Allocated memory is still 185.6MB. Free memory was 136.5MB in the beginning and 161.3MB in the end (delta: -24.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.17ms. Allocated memory is still 185.6MB. Free memory was 161.3MB in the beginning and 159.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 253.15ms. Allocated memory is still 185.6MB. Free memory was 159.8MB in the beginning and 148.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 64.75ms. Allocated memory is still 185.6MB. Free memory was 148.8MB in the beginning and 147.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 22088.02ms. Allocated memory was 185.6MB in the beginning and 335.5MB in the end (delta: 149.9MB). Free memory was 146.7MB in the beginning and 213.1MB in the end (delta: -66.4MB). Peak memory consumption was 84.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 14, TraceHistogramMax: 13, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 3037 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2537 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2552 IncrementalHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 500 mSDtfsCounter, 2552 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 962 GetRequests, 774 SyntacticMatches, 12 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=13, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 773 NumberOfCodeBlocks, 769 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 3026 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2079 ConjunctsInSsa, 337 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 1502/2164 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 20:01:06,103 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...