/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/cohencu-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 20:34:03,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 20:34:03,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 20:34:03,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 20:34:03,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 20:34:03,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 20:34:03,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 20:34:03,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 20:34:03,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 20:34:03,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 20:34:03,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 20:34:03,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 20:34:03,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 20:34:03,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 20:34:03,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 20:34:03,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 20:34:03,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 20:34:03,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 20:34:03,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 20:34:03,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 20:34:03,217 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 20:34:03,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 20:34:03,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 20:34:03,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 20:34:03,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 20:34:03,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 20:34:03,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 20:34:03,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 20:34:03,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 20:34:03,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 20:34:03,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 20:34:03,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 20:34:03,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 20:34:03,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 20:34:03,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 20:34:03,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 20:34:03,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 20:34:03,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 20:34:03,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 20:34:03,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 20:34:03,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 20:34:03,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 20:34:03,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 20:34:03,255 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 20:34:03,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 20:34:03,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 20:34:03,257 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 20:34:03,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 20:34:03,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 20:34:03,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 20:34:03,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 20:34:03,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 20:34:03,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 20:34:03,258 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 20:34:03,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 20:34:03,259 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 20:34:03,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 20:34:03,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 20:34:03,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 20:34:03,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 20:34:03,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 20:34:03,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:34:03,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 20:34:03,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 20:34:03,261 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 20:34:03,261 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-14 20:34:03,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 20:34:03,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 20:34:03,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 20:34:03,499 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 20:34:03,501 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 20:34:03,503 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-04-14 20:34:03,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/791631d82/1653a3cee5b24b2fa6b197fbe027055a/FLAGf26973166 [2022-04-14 20:34:03,945 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 20:34:03,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-04-14 20:34:03,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/791631d82/1653a3cee5b24b2fa6b197fbe027055a/FLAGf26973166 [2022-04-14 20:34:04,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/791631d82/1653a3cee5b24b2fa6b197fbe027055a [2022-04-14 20:34:04,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 20:34:04,362 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 20:34:04,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 20:34:04,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 20:34:04,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 20:34:04,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:34:04" (1/1) ... [2022-04-14 20:34:04,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689f11de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:34:04, skipping insertion in model container [2022-04-14 20:34:04,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:34:04" (1/1) ... [2022-04-14 20:34:04,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 20:34:04,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 20:34:04,528 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/cohencu-ll_unwindbound2.c[588,601] [2022-04-14 20:34:04,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:34:04,565 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 20:34:04,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/cohencu-ll_unwindbound2.c[588,601] [2022-04-14 20:34:04,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:34:04,613 INFO L208 MainTranslator]: Completed translation [2022-04-14 20:34:04,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:34:04 WrapperNode [2022-04-14 20:34:04,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 20:34:04,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 20:34:04,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 20:34:04,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 20:34:04,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:34:04" (1/1) ... [2022-04-14 20:34:04,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:34:04" (1/1) ... [2022-04-14 20:34:04,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:34:04" (1/1) ... [2022-04-14 20:34:04,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:34:04" (1/1) ... [2022-04-14 20:34:04,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:34:04" (1/1) ... [2022-04-14 20:34:04,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:34:04" (1/1) ... [2022-04-14 20:34:04,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:34:04" (1/1) ... [2022-04-14 20:34:04,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 20:34:04,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 20:34:04,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 20:34:04,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 20:34:04,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:34:04" (1/1) ... [2022-04-14 20:34:04,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:34:04,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:34:04,701 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-14 20:34:04,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-14 20:34:04,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 20:34:04,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 20:34:04,735 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 20:34:04,735 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 20:34:04,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 20:34:04,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 20:34:04,736 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 20:34:04,736 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 20:34:04,736 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 20:34:04,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 20:34:04,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-14 20:34:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 20:34:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 20:34:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 20:34:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 20:34:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 20:34:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 20:34:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 20:34:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 20:34:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 20:34:04,794 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 20:34:04,796 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 20:34:04,972 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 20:34:04,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 20:34:04,979 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 20:34:04,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:34:04 BoogieIcfgContainer [2022-04-14 20:34:04,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 20:34:04,982 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 20:34:04,982 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 20:34:04,983 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 20:34:04,985 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:34:04" (1/1) ... [2022-04-14 20:34:04,987 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 20:34:05,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:34:05 BasicIcfg [2022-04-14 20:34:05,020 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 20:34:05,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 20:34:05,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 20:34:05,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 20:34:05,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 08:34:04" (1/4) ... [2022-04-14 20:34:05,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf25192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:34:05, skipping insertion in model container [2022-04-14 20:34:05,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:34:04" (2/4) ... [2022-04-14 20:34:05,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf25192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:34:05, skipping insertion in model container [2022-04-14 20:34:05,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:34:04" (3/4) ... [2022-04-14 20:34:05,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf25192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:34:05, skipping insertion in model container [2022-04-14 20:34:05,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:34:05" (4/4) ... [2022-04-14 20:34:05,033 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound2.cJordan [2022-04-14 20:34:05,045 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 20:34:05,045 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 20:34:05,096 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 20:34:05,104 INFO L340 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 [2022-04-14 20:34:05,105 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 20:34:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 20:34:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 20:34:05,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:34:05,140 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:34:05,141 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:34:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:34:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1427487266, now seen corresponding path program 1 times [2022-04-14 20:34:05,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:34:05,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282143533] [2022-04-14 20:34:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:05,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:34:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:05,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:34:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:05,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-14 20:34:05,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-14 20:34:05,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-14 20:34:05,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:34:05,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-14 20:34:05,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-14 20:34:05,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-14 20:34:05,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-14 20:34:05,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {34#true} is VALID [2022-04-14 20:34:05,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} [90] L33-3-->L33-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-14 20:34:05,355 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {35#false} is VALID [2022-04-14 20:34:05,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID [2022-04-14 20:34:05,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-14 20:34:05,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-14 20:34:05,357 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-14 20:34:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:34:05,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282143533] [2022-04-14 20:34:05,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282143533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:34:05,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:34:05,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 20:34:05,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003538823] [2022-04-14 20:34:05,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:34:05,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 20:34:05,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:34:05,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:05,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:05,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 20:34:05,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:34:05,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 20:34:05,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 20:34:05,410 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:05,595 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-14 20:34:05,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 20:34:05,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 20:34:05,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:34:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-14 20:34:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-14 20:34:05,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-14 20:34:05,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:05,717 INFO L225 Difference]: With dead ends: 32 [2022-04-14 20:34:05,718 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 20:34:05,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-14 20:34:05,725 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 20:34:05,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 20:34:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 20:34:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-14 20:34:05,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:34:05,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 20:34:05,761 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 20:34:05,762 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 20:34:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:05,771 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-14 20:34:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-14 20:34:05,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:05,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:05,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-14 20:34:05,775 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-14 20:34:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:05,782 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-14 20:34:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-14 20:34:05,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:05,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:05,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:34:05,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:34:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 20:34:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-14 20:34:05,792 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-14 20:34:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:34:05,793 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-14 20:34:05,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-14 20:34:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 20:34:05,796 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:34:05,797 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:34:05,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 20:34:05,802 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:34:05,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:34:05,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1331862890, now seen corresponding path program 1 times [2022-04-14 20:34:05,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:34:05,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29613494] [2022-04-14 20:34:05,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:34:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:05,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:34:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:05,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {159#(= ~counter~0 0)} is VALID [2022-04-14 20:34:05,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#(= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-14 20:34:05,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#(= ~counter~0 0)} {154#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-14 20:34:05,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:34:05,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {159#(= ~counter~0 0)} is VALID [2022-04-14 20:34:05,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#(= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-14 20:34:05,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#(= ~counter~0 0)} {154#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-14 20:34:05,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#(= ~counter~0 0)} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-14 20:34:05,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#(= ~counter~0 0)} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {159#(= ~counter~0 0)} is VALID [2022-04-14 20:34:05,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(= ~counter~0 0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {160#(= |main_#t~post5| 0)} is VALID [2022-04-14 20:34:05,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {160#(= |main_#t~post5| 0)} [93] L33-1-->L33-4: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {155#false} is VALID [2022-04-14 20:34:05,954 INFO L272 TraceCheckUtils]: 8: Hoare triple {155#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {155#false} is VALID [2022-04-14 20:34:05,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {155#false} is VALID [2022-04-14 20:34:05,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {155#false} is VALID [2022-04-14 20:34:05,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#false} is VALID [2022-04-14 20:34:05,956 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-14 20:34:05,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:34:05,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29613494] [2022-04-14 20:34:05,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29613494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:34:05,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:34:05,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 20:34:05,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189214082] [2022-04-14 20:34:05,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:34:05,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 20:34:05,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:34:05,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:05,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:05,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:34:05,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:34:05,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:34:05,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:34:05,975 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:06,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:06,307 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-14 20:34:06,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:34:06,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 20:34:06,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:34:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-14 20:34:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-14 20:34:06,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-14 20:34:06,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:06,372 INFO L225 Difference]: With dead ends: 28 [2022-04-14 20:34:06,372 INFO L226 Difference]: Without dead ends: 28 [2022-04-14 20:34:06,376 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-14 20:34:06,378 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 20:34:06,378 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 20:34:06,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-14 20:34:06,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-14 20:34:06,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:34:06,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 20:34:06,387 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 20:34:06,388 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 20:34:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:06,395 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-14 20:34:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 20:34:06,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:06,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:06,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-14 20:34:06,397 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-14 20:34:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:06,400 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-14 20:34:06,400 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 20:34:06,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:06,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:06,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:34:06,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:34:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 20:34:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-14 20:34:06,404 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-14 20:34:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:34:06,404 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-14 20:34:06,405 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 20:34:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 20:34:06,405 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:34:06,406 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:34:06,406 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 20:34:06,406 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:34:06,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:34:06,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1332935366, now seen corresponding path program 1 times [2022-04-14 20:34:06,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:34:06,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178682815] [2022-04-14 20:34:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:06,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:34:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:06,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:34:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:06,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {278#true} is VALID [2022-04-14 20:34:06,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-14 20:34:06,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-14 20:34:06,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {278#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:34:06,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {278#true} is VALID [2022-04-14 20:34:06,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-14 20:34:06,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-14 20:34:06,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {278#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-14 20:34:06,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {278#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-14 20:34:06,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-14 20:34:06,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-14 20:34:06,569 INFO L272 TraceCheckUtils]: 8: Hoare triple {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {284#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:34:06,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {285#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 20:34:06,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {285#(not (= __VERIFIER_assert_~cond 0))} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {279#false} is VALID [2022-04-14 20:34:06,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {279#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {279#false} is VALID [2022-04-14 20:34:06,570 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-14 20:34:06,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:34:06,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178682815] [2022-04-14 20:34:06,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178682815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:34:06,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:34:06,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 20:34:06,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154269484] [2022-04-14 20:34:06,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:34:06,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 20:34:06,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:34:06,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:06,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:06,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:34:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:34:06,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:34:06,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 20:34:06,588 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:07,088 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-14 20:34:07,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 20:34:07,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 20:34:07,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:34:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-14 20:34:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-14 20:34:07,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-14 20:34:07,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:07,142 INFO L225 Difference]: With dead ends: 32 [2022-04-14 20:34:07,142 INFO L226 Difference]: Without dead ends: 32 [2022-04-14 20:34:07,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-14 20:34:07,143 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 20:34:07,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 20:34:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-14 20:34:07,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-14 20:34:07,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:34:07,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 20:34:07,147 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 20:34:07,148 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 20:34:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:07,150 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-14 20:34:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 20:34:07,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:07,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:07,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-14 20:34:07,151 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-14 20:34:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:07,153 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-14 20:34:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 20:34:07,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:07,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:07,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:34:07,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:34:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 20:34:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-14 20:34:07,156 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-14 20:34:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:34:07,157 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-14 20:34:07,157 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:34:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 20:34:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 20:34:07,157 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:34:07,158 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:34:07,158 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 20:34:07,158 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:34:07,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:34:07,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1273314772, now seen corresponding path program 1 times [2022-04-14 20:34:07,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:34:07,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223867626] [2022-04-14 20:34:07,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:07,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:34:07,171 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:34:07,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575988422] [2022-04-14 20:34:07,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:07,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:07,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:34:07,199 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-14 20:34:07,237 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-14 20:34:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:07,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 20:34:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:07,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:34:07,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-14 20:34:07,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {425#true} is VALID [2022-04-14 20:34:07,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-14 20:34:07,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-14 20:34:07,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-14 20:34:07,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {445#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 20:34:07,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {445#(and (= main_~n~0 0) (= main_~y~0 1))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {445#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 20:34:07,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#(and (= main_~n~0 0) (= main_~y~0 1))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {445#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 20:34:07,434 INFO L272 TraceCheckUtils]: 8: Hoare triple {445#(and (= main_~n~0 0) (= main_~y~0 1))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {425#true} is VALID [2022-04-14 20:34:07,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {425#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {425#true} is VALID [2022-04-14 20:34:07,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {425#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-14 20:34:07,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {425#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-14 20:34:07,435 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {425#true} {445#(and (= main_~n~0 0) (= main_~y~0 1))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {445#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 20:34:07,436 INFO L272 TraceCheckUtils]: 13: Hoare triple {445#(and (= main_~n~0 0) (= main_~y~0 1))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {470#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:34:07,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {470#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {474#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:34:07,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {426#false} is VALID [2022-04-14 20:34:07,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {426#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {426#false} is VALID [2022-04-14 20:34:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:34:07,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 20:34:07,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:34:07,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223867626] [2022-04-14 20:34:07,438 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:34:07,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575988422] [2022-04-14 20:34:07,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575988422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:34:07,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:34:07,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 20:34:07,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272269470] [2022-04-14 20:34:07,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:34:07,439 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), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-14 20:34:07,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:34:07,440 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 20:34:07,454 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-14 20:34:07,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:34:07,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:34:07,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:34:07,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:34:07,455 INFO L87 Difference]: Start difference. First operand 32 states and 42 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 20:34:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:07,684 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-14 20:34:07,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:34:07,684 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), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-14 20:34:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:34:07,685 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 20:34:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-14 20:34:07,687 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 20:34:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-14 20:34:07,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-14 20:34:07,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:07,765 INFO L225 Difference]: With dead ends: 48 [2022-04-14 20:34:07,766 INFO L226 Difference]: Without dead ends: 48 [2022-04-14 20:34:07,766 INFO L912 BasicCegarLoop]: 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-14 20:34:07,767 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 20:34:07,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 133 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 20:34:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-14 20:34:07,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-14 20:34:07,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:34:07,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 20:34:07,783 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 20:34:07,784 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 20:34:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:07,788 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-14 20:34:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-14 20:34:07,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:07,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:07,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-14 20:34:07,790 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-14 20:34:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:07,793 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-14 20:34:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-14 20:34:07,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:07,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:07,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:34:07,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:34:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 20:34:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-14 20:34:07,806 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-14 20:34:07,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:34:07,807 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-14 20:34:07,807 INFO L479 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 20:34:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-14 20:34:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 20:34:07,807 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:34:07,808 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:34:07,835 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-14 20:34:08,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:08,024 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:34:08,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:34:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1649805282, now seen corresponding path program 1 times [2022-04-14 20:34:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:34:08,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132445706] [2022-04-14 20:34:08,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:08,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:34:08,038 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:34:08,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434014465] [2022-04-14 20:34:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:08,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:08,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:34:08,042 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-14 20:34:08,043 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-14 20:34:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:08,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 20:34:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:08,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:34:08,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {664#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-14 20:34:08,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {664#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {664#true} is VALID [2022-04-14 20:34:08,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {664#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-14 20:34:08,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {664#true} {664#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-14 20:34:08,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {664#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-14 20:34:08,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {664#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 20:34:08,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 20:34:08,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 20:34:08,241 INFO L272 TraceCheckUtils]: 8: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {664#true} is VALID [2022-04-14 20:34:08,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {664#true} is VALID [2022-04-14 20:34:08,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-14 20:34:08,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-14 20:34:08,242 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {664#true} {684#(and (= main_~x~0 0) (= main_~n~0 0))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 20:34:08,243 INFO L272 TraceCheckUtils]: 13: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {664#true} is VALID [2022-04-14 20:34:08,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {664#true} is VALID [2022-04-14 20:34:08,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-14 20:34:08,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-14 20:34:08,245 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {664#true} {684#(and (= main_~x~0 0) (= main_~n~0 0))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 20:34:08,246 INFO L272 TraceCheckUtils]: 18: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {724#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:34:08,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {724#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {728#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:34:08,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {728#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {665#false} is VALID [2022-04-14 20:34:08,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {665#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {665#false} is VALID [2022-04-14 20:34:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 20:34:08,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 20:34:08,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:34:08,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132445706] [2022-04-14 20:34:08,248 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:34:08,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434014465] [2022-04-14 20:34:08,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434014465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:34:08,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:34:08,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 20:34:08,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353749099] [2022-04-14 20:34:08,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:34:08,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 20:34:08,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:34:08,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 20:34:08,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:08,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:34:08,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:34:08,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:34:08,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:34:08,268 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 20:34:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:08,630 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-14 20:34:08,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:34:08,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 20:34:08,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:34:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 20:34:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-14 20:34:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 20:34:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-14 20:34:08,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-14 20:34:08,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:08,708 INFO L225 Difference]: With dead ends: 52 [2022-04-14 20:34:08,708 INFO L226 Difference]: Without dead ends: 52 [2022-04-14 20:34:08,709 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 20:34:08,709 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 20:34:08,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 20:34:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-14 20:34:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-14 20:34:08,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:34:08,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 20:34:08,716 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 20:34:08,716 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 20:34:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:08,720 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-14 20:34:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-14 20:34:08,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:08,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:08,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-14 20:34:08,721 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-14 20:34:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:08,725 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-14 20:34:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-14 20:34:08,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:08,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:08,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:34:08,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:34:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 20:34:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-14 20:34:08,728 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-14 20:34:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:34:08,729 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-14 20:34:08,729 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 20:34:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-14 20:34:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 20:34:08,729 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:34:08,729 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:34:08,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-14 20:34:08,943 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:08,944 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:34:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:34:08,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1442767915, now seen corresponding path program 1 times [2022-04-14 20:34:08,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:34:08,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125560414] [2022-04-14 20:34:08,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:08,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:34:08,966 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:34:08,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363096897] [2022-04-14 20:34:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:08,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:08,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:34:08,968 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-14 20:34:08,971 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-14 20:34:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:09,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 20:34:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:09,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:34:09,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {940#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-14 20:34:09,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {940#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {940#true} is VALID [2022-04-14 20:34:09,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {940#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-14 20:34:09,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {940#true} {940#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-14 20:34:09,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {940#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-14 20:34:09,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {940#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:09,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:09,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:09,147 INFO L272 TraceCheckUtils]: 8: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {940#true} is VALID [2022-04-14 20:34:09,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {940#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {940#true} is VALID [2022-04-14 20:34:09,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {940#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-14 20:34:09,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {940#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-14 20:34:09,149 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {940#true} {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:09,150 INFO L272 TraceCheckUtils]: 13: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {940#true} is VALID [2022-04-14 20:34:09,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {940#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {940#true} is VALID [2022-04-14 20:34:09,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {940#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-14 20:34:09,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {940#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-14 20:34:09,151 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {940#true} {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:09,151 INFO L272 TraceCheckUtils]: 18: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {940#true} is VALID [2022-04-14 20:34:09,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {940#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {940#true} is VALID [2022-04-14 20:34:09,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {940#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-14 20:34:09,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {940#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-14 20:34:09,155 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {940#true} {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:09,156 INFO L272 TraceCheckUtils]: 23: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:34:09,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {1015#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:34:09,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {1019#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {941#false} is VALID [2022-04-14 20:34:09,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {941#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {941#false} is VALID [2022-04-14 20:34:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 20:34:09,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 20:34:09,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:34:09,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125560414] [2022-04-14 20:34:09,159 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:34:09,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363096897] [2022-04-14 20:34:09,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363096897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:34:09,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:34:09,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 20:34:09,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072876546] [2022-04-14 20:34:09,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:34:09,160 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-14 20:34:09,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:34:09,160 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 20:34:09,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:09,178 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:34:09,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:34:09,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:34:09,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:34:09,179 INFO L87 Difference]: Start difference. First operand 48 states and 64 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 20:34:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:09,517 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-04-14 20:34:09,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:34:09,517 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-14 20:34:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:34:09,518 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 20:34:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-14 20:34:09,520 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 20:34:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-14 20:34:09,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-14 20:34:09,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:09,595 INFO L225 Difference]: With dead ends: 60 [2022-04-14 20:34:09,595 INFO L226 Difference]: Without dead ends: 50 [2022-04-14 20:34:09,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-14 20:34:09,600 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 20:34:09,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 20:34:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-14 20:34:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-14 20:34:09,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:34:09,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:09,605 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:09,606 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:09,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:09,609 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-14 20:34:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 20:34:09,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:09,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:09,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-14 20:34:09,610 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-14 20:34:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:09,612 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-14 20:34:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 20:34:09,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:09,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:09,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:34:09,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:34:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-14 20:34:09,616 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-14 20:34:09,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:34:09,616 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-14 20:34:09,616 INFO L479 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 20:34:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 20:34:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 20:34:09,617 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:34:09,617 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:34:09,646 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-14 20:34:09,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:09,841 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:34:09,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:34:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1251454759, now seen corresponding path program 1 times [2022-04-14 20:34:09,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:34:09,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611793078] [2022-04-14 20:34:09,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:09,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:34:09,872 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:34:09,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464169615] [2022-04-14 20:34:09,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:09,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:09,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:34:09,873 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-14 20:34:09,875 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-14 20:34:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:09,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 20:34:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:09,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:34:10,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {1237#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {1237#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1245#(<= ~counter~0 0)} is VALID [2022-04-14 20:34:10,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {1245#(<= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1245#(<= ~counter~0 0)} is VALID [2022-04-14 20:34:10,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1245#(<= ~counter~0 0)} {1237#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1245#(<= ~counter~0 0)} is VALID [2022-04-14 20:34:10,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {1245#(<= ~counter~0 0)} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1245#(<= ~counter~0 0)} is VALID [2022-04-14 20:34:10,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {1245#(<= ~counter~0 0)} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {1245#(<= ~counter~0 0)} is VALID [2022-04-14 20:34:10,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(<= ~counter~0 0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {1261#(<= ~counter~0 1)} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,227 INFO L272 TraceCheckUtils]: 8: Hoare triple {1261#(<= ~counter~0 1)} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {1261#(<= ~counter~0 1)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {1261#(<= ~counter~0 1)} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {1261#(<= ~counter~0 1)} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,231 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1261#(<= ~counter~0 1)} {1261#(<= ~counter~0 1)} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,240 INFO L272 TraceCheckUtils]: 13: Hoare triple {1261#(<= ~counter~0 1)} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {1261#(<= ~counter~0 1)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {1261#(<= ~counter~0 1)} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {1261#(<= ~counter~0 1)} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,242 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1261#(<= ~counter~0 1)} {1261#(<= ~counter~0 1)} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,242 INFO L272 TraceCheckUtils]: 18: Hoare triple {1261#(<= ~counter~0 1)} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {1261#(<= ~counter~0 1)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#(<= ~counter~0 1)} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {1261#(<= ~counter~0 1)} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,244 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1261#(<= ~counter~0 1)} {1261#(<= ~counter~0 1)} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,245 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#(<= ~counter~0 1)} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#(<= ~counter~0 1)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#(<= ~counter~0 1)} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#(<= ~counter~0 1)} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,246 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1261#(<= ~counter~0 1)} {1261#(<= ~counter~0 1)} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,247 INFO L272 TraceCheckUtils]: 28: Hoare triple {1261#(<= ~counter~0 1)} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {1261#(<= ~counter~0 1)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {1261#(<= ~counter~0 1)} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {1261#(<= ~counter~0 1)} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,248 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1261#(<= ~counter~0 1)} {1261#(<= ~counter~0 1)} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {1261#(<= ~counter~0 1)} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {1261#(<= ~counter~0 1)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1346#(<= |main_#t~post5| 1)} is VALID [2022-04-14 20:34:10,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {1346#(<= |main_#t~post5| 1)} [93] L33-1-->L33-4: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1238#false} is VALID [2022-04-14 20:34:10,250 INFO L272 TraceCheckUtils]: 36: Hoare triple {1238#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1238#false} is VALID [2022-04-14 20:34:10,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {1238#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1238#false} is VALID [2022-04-14 20:34:10,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {1238#false} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1238#false} is VALID [2022-04-14 20:34:10,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {1238#false} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1238#false} is VALID [2022-04-14 20:34:10,251 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1238#false} {1238#false} [121] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1238#false} is VALID [2022-04-14 20:34:10,251 INFO L272 TraceCheckUtils]: 41: Hoare triple {1238#false} [95] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) (* v_main_~x~0_13 v_main_~z~0_19)) (* v_main_~x~0_13 (* v_main_~a~0_8 6)) (* v_main_~x~0_13 12)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_19, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~a~0] {1238#false} is VALID [2022-04-14 20:34:10,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {1238#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1238#false} is VALID [2022-04-14 20:34:10,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {1238#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1238#false} is VALID [2022-04-14 20:34:10,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {1238#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1238#false} is VALID [2022-04-14 20:34:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-14 20:34:10,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:34:10,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {1238#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1238#false} is VALID [2022-04-14 20:34:10,493 INFO L290 TraceCheckUtils]: 43: Hoare triple {1238#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1238#false} is VALID [2022-04-14 20:34:10,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {1238#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1238#false} is VALID [2022-04-14 20:34:10,493 INFO L272 TraceCheckUtils]: 41: Hoare triple {1238#false} [95] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) (* v_main_~x~0_13 v_main_~z~0_19)) (* v_main_~x~0_13 (* v_main_~a~0_8 6)) (* v_main_~x~0_13 12)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_19, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~a~0] {1238#false} is VALID [2022-04-14 20:34:10,493 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1237#true} {1238#false} [121] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1238#false} is VALID [2022-04-14 20:34:10,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {1237#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {1237#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {1237#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1237#true} is VALID [2022-04-14 20:34:10,494 INFO L272 TraceCheckUtils]: 36: Hoare triple {1238#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1237#true} is VALID [2022-04-14 20:34:10,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {1346#(<= |main_#t~post5| 1)} [93] L33-1-->L33-4: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1238#false} is VALID [2022-04-14 20:34:10,495 INFO L290 TraceCheckUtils]: 34: Hoare triple {1261#(<= ~counter~0 1)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1346#(<= |main_#t~post5| 1)} is VALID [2022-04-14 20:34:10,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {1261#(<= ~counter~0 1)} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,498 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1237#true} {1261#(<= ~counter~0 1)} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {1237#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {1237#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {1237#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1237#true} is VALID [2022-04-14 20:34:10,498 INFO L272 TraceCheckUtils]: 28: Hoare triple {1261#(<= ~counter~0 1)} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1237#true} is VALID [2022-04-14 20:34:10,499 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1237#true} {1261#(<= ~counter~0 1)} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {1237#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {1237#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {1237#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1237#true} is VALID [2022-04-14 20:34:10,500 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#(<= ~counter~0 1)} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1237#true} is VALID [2022-04-14 20:34:10,501 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1237#true} {1261#(<= ~counter~0 1)} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {1237#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {1237#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {1237#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1237#true} is VALID [2022-04-14 20:34:10,501 INFO L272 TraceCheckUtils]: 18: Hoare triple {1261#(<= ~counter~0 1)} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1237#true} is VALID [2022-04-14 20:34:10,502 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1237#true} {1261#(<= ~counter~0 1)} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {1237#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {1237#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {1237#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1237#true} is VALID [2022-04-14 20:34:10,503 INFO L272 TraceCheckUtils]: 13: Hoare triple {1261#(<= ~counter~0 1)} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1237#true} is VALID [2022-04-14 20:34:10,503 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1237#true} {1261#(<= ~counter~0 1)} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {1237#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {1237#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {1237#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1237#true} is VALID [2022-04-14 20:34:10,504 INFO L272 TraceCheckUtils]: 8: Hoare triple {1261#(<= ~counter~0 1)} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1237#true} is VALID [2022-04-14 20:34:10,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {1261#(<= ~counter~0 1)} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(<= ~counter~0 0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1261#(<= ~counter~0 1)} is VALID [2022-04-14 20:34:10,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {1245#(<= ~counter~0 0)} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {1245#(<= ~counter~0 0)} is VALID [2022-04-14 20:34:10,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {1245#(<= ~counter~0 0)} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1245#(<= ~counter~0 0)} is VALID [2022-04-14 20:34:10,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1245#(<= ~counter~0 0)} {1237#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1245#(<= ~counter~0 0)} is VALID [2022-04-14 20:34:10,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {1245#(<= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1245#(<= ~counter~0 0)} is VALID [2022-04-14 20:34:10,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {1237#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1245#(<= ~counter~0 0)} is VALID [2022-04-14 20:34:10,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {1237#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-14 20:34:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 20:34:10,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:34:10,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611793078] [2022-04-14 20:34:10,512 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:34:10,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464169615] [2022-04-14 20:34:10,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464169615] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:34:10,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:34:10,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-14 20:34:10,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193772303] [2022-04-14 20:34:10,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 20:34:10,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 45 [2022-04-14 20:34:10,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:34:10,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-14 20:34:10,566 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-14 20:34:10,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:34:10,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:34:10,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:34:10,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:34:10,567 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-14 20:34:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:10,887 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-14 20:34:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:34:10,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 45 [2022-04-14 20:34:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:34:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-14 20:34:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-14 20:34:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-14 20:34:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-14 20:34:10,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-14 20:34:10,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:10,942 INFO L225 Difference]: With dead ends: 56 [2022-04-14 20:34:10,942 INFO L226 Difference]: Without dead ends: 56 [2022-04-14 20:34:10,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-14 20:34:10,943 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:34:10,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 113 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:34:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-14 20:34:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-14 20:34:10,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:34:10,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:10,949 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:10,949 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:10,952 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-14 20:34:10,952 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-14 20:34:10,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:10,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:10,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-14 20:34:10,953 INFO L87 Difference]: Start difference. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-14 20:34:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:10,955 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-14 20:34:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-14 20:34:10,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:10,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:10,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:34:10,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:34:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-14 20:34:10,958 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 45 [2022-04-14 20:34:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:34:10,959 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-14 20:34:10,959 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-14 20:34:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-14 20:34:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 20:34:10,960 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:34:10,960 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:34:10,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-14 20:34:11,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:11,176 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:34:11,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:34:11,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1899744846, now seen corresponding path program 1 times [2022-04-14 20:34:11,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:34:11,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439216538] [2022-04-14 20:34:11,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:11,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:34:11,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:34:11,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [772468307] [2022-04-14 20:34:11,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:11,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:11,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:34:11,196 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-14 20:34:11,198 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-14 20:34:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:11,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 20:34:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:11,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:34:11,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {1737#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {1737#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1737#true} is VALID [2022-04-14 20:34:11,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {1737#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1737#true} {1737#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {1737#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {1737#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:11,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:11,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:11,503 INFO L272 TraceCheckUtils]: 8: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1737#true} is VALID [2022-04-14 20:34:11,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-14 20:34:11,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,504 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1737#true} {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:11,504 INFO L272 TraceCheckUtils]: 13: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1737#true} is VALID [2022-04-14 20:34:11,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-14 20:34:11,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,505 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1737#true} {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:11,505 INFO L272 TraceCheckUtils]: 18: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1737#true} is VALID [2022-04-14 20:34:11,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-14 20:34:11,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,507 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1737#true} {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:11,507 INFO L272 TraceCheckUtils]: 23: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1737#true} is VALID [2022-04-14 20:34:11,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-14 20:34:11,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,508 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1737#true} {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:11,508 INFO L272 TraceCheckUtils]: 28: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1737#true} is VALID [2022-04-14 20:34:11,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-14 20:34:11,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,510 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1737#true} {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:11,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 20:34:11,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 20:34:11,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 20:34:11,511 INFO L272 TraceCheckUtils]: 36: Hoare triple {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1737#true} is VALID [2022-04-14 20:34:11,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-14 20:34:11,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,512 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1737#true} {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 20:34:11,513 INFO L272 TraceCheckUtils]: 41: Hoare triple {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:34:11,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {1867#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:34:11,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {1871#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1738#false} is VALID [2022-04-14 20:34:11,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {1738#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1738#false} is VALID [2022-04-14 20:34:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 20:34:11,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:34:11,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {1738#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1738#false} is VALID [2022-04-14 20:34:11,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {1871#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1738#false} is VALID [2022-04-14 20:34:11,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {1867#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:34:11,741 INFO L272 TraceCheckUtils]: 41: Hoare triple {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:34:11,741 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1737#true} {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 20:34:11,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-14 20:34:11,742 INFO L272 TraceCheckUtils]: 36: Hoare triple {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1737#true} is VALID [2022-04-14 20:34:11,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 20:34:11,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 20:34:11,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 20:34:11,751 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1737#true} {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 20:34:11,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-14 20:34:11,752 INFO L272 TraceCheckUtils]: 28: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1737#true} is VALID [2022-04-14 20:34:11,752 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1737#true} {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 20:34:11,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-14 20:34:11,753 INFO L272 TraceCheckUtils]: 23: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1737#true} is VALID [2022-04-14 20:34:11,753 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1737#true} {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 20:34:11,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-14 20:34:11,754 INFO L272 TraceCheckUtils]: 18: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1737#true} is VALID [2022-04-14 20:34:11,755 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1737#true} {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 20:34:11,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-14 20:34:11,755 INFO L272 TraceCheckUtils]: 13: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1737#true} is VALID [2022-04-14 20:34:11,756 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1737#true} {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 20:34:11,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-14 20:34:11,756 INFO L272 TraceCheckUtils]: 8: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1737#true} is VALID [2022-04-14 20:34:11,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 20:34:11,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 20:34:11,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {1737#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 20:34:11,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {1737#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1737#true} {1737#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {1737#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {1737#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1737#true} is VALID [2022-04-14 20:34:11,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {1737#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-14 20:34:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 20:34:11,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:34:11,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439216538] [2022-04-14 20:34:11,759 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:34:11,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772468307] [2022-04-14 20:34:11,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772468307] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:34:11,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:34:11,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 20:34:11,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589829285] [2022-04-14 20:34:11,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 20:34:11,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-14 20:34:11,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:34:11,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 20:34:11,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:11,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 20:34:11,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:34:11,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 20:34:11,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 20:34:11,817 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 20:34:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:12,889 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-14 20:34:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 20:34:12,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-14 20:34:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:34:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 20:34:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-14 20:34:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 20:34:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-14 20:34:12,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-14 20:34:12,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:12,998 INFO L225 Difference]: With dead ends: 76 [2022-04-14 20:34:12,998 INFO L226 Difference]: Without dead ends: 76 [2022-04-14 20:34:12,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-14 20:34:12,999 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 20:34:12,999 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 20:34:13,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-14 20:34:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-04-14 20:34:13,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:34:13,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:13,005 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:13,005 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:13,008 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-14 20:34:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-14 20:34:13,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:13,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:13,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 76 states. [2022-04-14 20:34:13,010 INFO L87 Difference]: Start difference. First operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 76 states. [2022-04-14 20:34:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:13,013 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-14 20:34:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-14 20:34:13,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:13,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:13,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:34:13,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:34:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2022-04-14 20:34:13,016 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 45 [2022-04-14 20:34:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:34:13,017 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2022-04-14 20:34:13,017 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 20:34:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-04-14 20:34:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-14 20:34:13,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:34:13,018 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:34:13,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-14 20:34:13,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:13,231 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:34:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:34:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash 400776220, now seen corresponding path program 2 times [2022-04-14 20:34:13,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:34:13,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800825608] [2022-04-14 20:34:13,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:13,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:34:13,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:34:13,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [383732845] [2022-04-14 20:34:13,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 20:34:13,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:13,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:34:13,253 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-14 20:34:13,285 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-14 20:34:13,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 20:34:13,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 20:34:13,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 20:34:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:13,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:34:13,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {2312#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2312#true} is VALID [2022-04-14 20:34:13,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {2312#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2312#true} {2312#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {2312#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {2312#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 20:34:13,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 20:34:13,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 20:34:13,565 INFO L272 TraceCheckUtils]: 8: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2312#true} is VALID [2022-04-14 20:34:13,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,567 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2312#true} {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 20:34:13,567 INFO L272 TraceCheckUtils]: 13: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2312#true} is VALID [2022-04-14 20:34:13,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,570 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2312#true} {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 20:34:13,570 INFO L272 TraceCheckUtils]: 18: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2312#true} is VALID [2022-04-14 20:34:13,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,571 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2312#true} {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 20:34:13,571 INFO L272 TraceCheckUtils]: 23: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2312#true} is VALID [2022-04-14 20:34:13,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,572 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2312#true} {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 20:34:13,572 INFO L272 TraceCheckUtils]: 28: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2312#true} is VALID [2022-04-14 20:34:13,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,573 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2312#true} {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 20:34:13,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 20:34:13,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 20:34:13,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 20:34:13,574 INFO L272 TraceCheckUtils]: 36: Hoare triple {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2312#true} is VALID [2022-04-14 20:34:13,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,575 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2312#true} {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 20:34:13,575 INFO L272 TraceCheckUtils]: 41: Hoare triple {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2312#true} is VALID [2022-04-14 20:34:13,575 INFO L290 TraceCheckUtils]: 42: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,575 INFO L290 TraceCheckUtils]: 43: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,575 INFO L290 TraceCheckUtils]: 44: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,577 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2312#true} {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 20:34:13,578 INFO L272 TraceCheckUtils]: 46: Hoare triple {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2457#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:34:13,578 INFO L290 TraceCheckUtils]: 47: Hoare triple {2457#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2461#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:34:13,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {2461#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2313#false} is VALID [2022-04-14 20:34:13,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {2313#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2313#false} is VALID [2022-04-14 20:34:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-14 20:34:13,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:34:13,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {2313#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2313#false} is VALID [2022-04-14 20:34:13,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {2461#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2313#false} is VALID [2022-04-14 20:34:13,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {2457#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2461#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:34:13,811 INFO L272 TraceCheckUtils]: 46: Hoare triple {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2457#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:34:13,811 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2312#true} {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 20:34:13,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,812 INFO L272 TraceCheckUtils]: 41: Hoare triple {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2312#true} is VALID [2022-04-14 20:34:13,813 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2312#true} {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 20:34:13,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,813 INFO L272 TraceCheckUtils]: 36: Hoare triple {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2312#true} is VALID [2022-04-14 20:34:13,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 20:34:13,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 20:34:13,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 20:34:13,817 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2312#true} {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 20:34:13,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,818 INFO L272 TraceCheckUtils]: 28: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2312#true} is VALID [2022-04-14 20:34:13,818 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2312#true} {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 20:34:13,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,819 INFO L272 TraceCheckUtils]: 23: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2312#true} is VALID [2022-04-14 20:34:13,820 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2312#true} {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 20:34:13,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,820 INFO L272 TraceCheckUtils]: 18: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2312#true} is VALID [2022-04-14 20:34:13,821 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2312#true} {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 20:34:13,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,821 INFO L272 TraceCheckUtils]: 13: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2312#true} is VALID [2022-04-14 20:34:13,822 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2312#true} {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 20:34:13,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-14 20:34:13,822 INFO L272 TraceCheckUtils]: 8: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2312#true} is VALID [2022-04-14 20:34:13,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 20:34:13,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 20:34:13,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {2312#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 20:34:13,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {2312#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2312#true} {2312#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {2312#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2312#true} is VALID [2022-04-14 20:34:13,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {2312#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-14 20:34:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-14 20:34:13,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:34:13,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800825608] [2022-04-14 20:34:13,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:34:13,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383732845] [2022-04-14 20:34:13,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383732845] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:34:13,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:34:13,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 20:34:13,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993511585] [2022-04-14 20:34:13,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 20:34:13,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-14 20:34:13,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:34:13,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 20:34:13,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:13,886 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 20:34:13,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:34:13,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 20:34:13,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 20:34:13,887 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 20:34:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:14,672 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-04-14 20:34:14,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:34:14,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-14 20:34:14,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:34:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 20:34:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-14 20:34:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 20:34:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-14 20:34:14,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2022-04-14 20:34:14,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:14,795 INFO L225 Difference]: With dead ends: 80 [2022-04-14 20:34:14,795 INFO L226 Difference]: Without dead ends: 80 [2022-04-14 20:34:14,796 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-14 20:34:14,798 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 20:34:14,798 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 240 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 20:34:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-14 20:34:14,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2022-04-14 20:34:14,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:34:14,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 20:34:14,808 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 20:34:14,809 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 20:34:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:14,812 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-04-14 20:34:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-14 20:34:14,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:14,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:14,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 80 states. [2022-04-14 20:34:14,813 INFO L87 Difference]: Start difference. First operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 80 states. [2022-04-14 20:34:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:14,826 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-04-14 20:34:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-14 20:34:14,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:14,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:14,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:34:14,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:34:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 20:34:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-04-14 20:34:14,831 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 50 [2022-04-14 20:34:14,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:34:14,831 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-04-14 20:34:14,832 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 20:34:14,832 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-04-14 20:34:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-14 20:34:14,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:34:14,835 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:34:14,862 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-14 20:34:15,049 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:15,049 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:34:15,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:34:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash -895540175, now seen corresponding path program 3 times [2022-04-14 20:34:15,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:34:15,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010463958] [2022-04-14 20:34:15,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:15,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:34:15,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:34:15,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [505170376] [2022-04-14 20:34:15,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 20:34:15,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:15,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:34:15,062 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-14 20:34:15,087 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-14 20:34:15,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-14 20:34:15,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 20:34:15,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-14 20:34:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:15,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:34:15,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2932#true} is VALID [2022-04-14 20:34:15,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:15,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:15,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:15,445 INFO L272 TraceCheckUtils]: 8: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2932#true} is VALID [2022-04-14 20:34:15,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,446 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2932#true} {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:15,446 INFO L272 TraceCheckUtils]: 13: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2932#true} is VALID [2022-04-14 20:34:15,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,447 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2932#true} {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:15,447 INFO L272 TraceCheckUtils]: 18: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2932#true} is VALID [2022-04-14 20:34:15,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,448 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2932#true} {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:15,448 INFO L272 TraceCheckUtils]: 23: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2932#true} is VALID [2022-04-14 20:34:15,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,448 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2932#true} {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:15,448 INFO L272 TraceCheckUtils]: 28: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2932#true} is VALID [2022-04-14 20:34:15,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,456 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2932#true} {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 20:34:15,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 20:34:15,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 20:34:15,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 20:34:15,457 INFO L272 TraceCheckUtils]: 36: Hoare triple {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2932#true} is VALID [2022-04-14 20:34:15,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,458 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2932#true} {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 20:34:15,459 INFO L272 TraceCheckUtils]: 41: Hoare triple {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2932#true} is VALID [2022-04-14 20:34:15,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,459 INFO L290 TraceCheckUtils]: 43: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,460 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2932#true} {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 20:34:15,460 INFO L272 TraceCheckUtils]: 46: Hoare triple {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2932#true} is VALID [2022-04-14 20:34:15,461 INFO L290 TraceCheckUtils]: 47: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,462 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2932#true} {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 20:34:15,462 INFO L272 TraceCheckUtils]: 51: Hoare triple {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3092#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:34:15,463 INFO L290 TraceCheckUtils]: 52: Hoare triple {3092#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3096#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:34:15,463 INFO L290 TraceCheckUtils]: 53: Hoare triple {3096#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2933#false} is VALID [2022-04-14 20:34:15,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {2933#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2933#false} is VALID [2022-04-14 20:34:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-14 20:34:15,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:34:15,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {2933#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2933#false} is VALID [2022-04-14 20:34:15,922 INFO L290 TraceCheckUtils]: 53: Hoare triple {3096#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2933#false} is VALID [2022-04-14 20:34:15,923 INFO L290 TraceCheckUtils]: 52: Hoare triple {3092#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3096#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:34:15,923 INFO L272 TraceCheckUtils]: 51: Hoare triple {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3092#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:34:15,924 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2932#true} {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 20:34:15,924 INFO L290 TraceCheckUtils]: 49: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,924 INFO L272 TraceCheckUtils]: 46: Hoare triple {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2932#true} is VALID [2022-04-14 20:34:15,925 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2932#true} {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 20:34:15,925 INFO L290 TraceCheckUtils]: 44: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,926 INFO L272 TraceCheckUtils]: 41: Hoare triple {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2932#true} is VALID [2022-04-14 20:34:15,926 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2932#true} {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 20:34:15,926 INFO L290 TraceCheckUtils]: 39: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,927 INFO L272 TraceCheckUtils]: 36: Hoare triple {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2932#true} is VALID [2022-04-14 20:34:15,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 20:34:15,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 20:34:15,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 20:34:15,933 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2932#true} {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 20:34:15,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,935 INFO L272 TraceCheckUtils]: 28: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2932#true} is VALID [2022-04-14 20:34:15,936 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2932#true} {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 20:34:15,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,936 INFO L272 TraceCheckUtils]: 23: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2932#true} is VALID [2022-04-14 20:34:15,937 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2932#true} {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 20:34:15,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,937 INFO L272 TraceCheckUtils]: 18: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2932#true} is VALID [2022-04-14 20:34:15,938 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2932#true} {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 20:34:15,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,938 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2932#true} is VALID [2022-04-14 20:34:15,939 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2932#true} {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 20:34:15,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-14 20:34:15,939 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2932#true} is VALID [2022-04-14 20:34:15,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 20:34:15,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 20:34:15,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 20:34:15,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2932#true} is VALID [2022-04-14 20:34:15,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-14 20:34:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-14 20:34:15,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:34:15,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010463958] [2022-04-14 20:34:15,942 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:34:15,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505170376] [2022-04-14 20:34:15,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505170376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:34:15,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:34:15,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 20:34:15,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043500528] [2022-04-14 20:34:15,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 20:34:15,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-14 20:34:15,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:34:15,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 20:34:15,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:15,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 20:34:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:34:15,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 20:34:15,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 20:34:15,999 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 20:34:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:17,221 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2022-04-14 20:34:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 20:34:17,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-14 20:34:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:34:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 20:34:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-14 20:34:17,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 20:34:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-14 20:34:17,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-14 20:34:17,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:17,333 INFO L225 Difference]: With dead ends: 88 [2022-04-14 20:34:17,333 INFO L226 Difference]: Without dead ends: 82 [2022-04-14 20:34:17,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-14 20:34:17,333 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-14 20:34:17,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 136 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-14 20:34:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-14 20:34:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2022-04-14 20:34:17,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:34:17,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:17,339 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:17,339 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:17,341 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-14 20:34:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-14 20:34:17,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:17,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:17,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 82 states. [2022-04-14 20:34:17,342 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 82 states. [2022-04-14 20:34:17,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:17,345 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-14 20:34:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-14 20:34:17,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:17,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:17,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:34:17,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:34:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 20:34:17,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-04-14 20:34:17,347 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 55 [2022-04-14 20:34:17,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:34:17,348 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-04-14 20:34:17,348 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 20:34:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-14 20:34:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-14 20:34:17,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:34:17,349 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:34:17,368 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-14 20:34:17,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:17,563 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:34:17,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:34:17,564 INFO L85 PathProgramCache]: Analyzing trace with hash 999510626, now seen corresponding path program 1 times [2022-04-14 20:34:17,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:34:17,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109014922] [2022-04-14 20:34:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:34:17,574 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:34:17,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342932759] [2022-04-14 20:34:17,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:17,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:17,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:34:17,576 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-14 20:34:17,585 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-14 20:34:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:17,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-14 20:34:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:34:17,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:34:22,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {3601#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {3601#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3601#true} is VALID [2022-04-14 20:34:22,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {3601#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3601#true} {3601#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {3601#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {3601#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 20:34:22,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 20:34:22,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 20:34:22,247 INFO L272 TraceCheckUtils]: 8: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:22,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:22,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,256 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3601#true} {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 20:34:22,256 INFO L272 TraceCheckUtils]: 13: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:22,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:22,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,257 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3601#true} {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 20:34:22,257 INFO L272 TraceCheckUtils]: 18: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:22,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:22,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,257 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3601#true} {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 20:34:22,258 INFO L272 TraceCheckUtils]: 23: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-14 20:34:22,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:22,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,258 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3601#true} {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 20:34:22,258 INFO L272 TraceCheckUtils]: 28: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-14 20:34:22,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:22,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,259 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3601#true} {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 20:34:22,260 INFO L290 TraceCheckUtils]: 33: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 20:34:22,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 20:34:22,261 INFO L290 TraceCheckUtils]: 35: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 20:34:22,261 INFO L272 TraceCheckUtils]: 36: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:22,261 INFO L290 TraceCheckUtils]: 37: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:22,261 INFO L290 TraceCheckUtils]: 38: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,261 INFO L290 TraceCheckUtils]: 39: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,261 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3601#true} {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 20:34:22,261 INFO L272 TraceCheckUtils]: 41: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:22,261 INFO L290 TraceCheckUtils]: 42: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:22,262 INFO L290 TraceCheckUtils]: 43: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,262 INFO L290 TraceCheckUtils]: 44: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,262 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3601#true} {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 20:34:22,262 INFO L272 TraceCheckUtils]: 46: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:22,262 INFO L290 TraceCheckUtils]: 47: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:22,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,263 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3601#true} {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 20:34:22,263 INFO L272 TraceCheckUtils]: 51: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-14 20:34:22,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:22,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,264 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3601#true} {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 20:34:22,264 INFO L272 TraceCheckUtils]: 56: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-14 20:34:22,264 INFO L290 TraceCheckUtils]: 57: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:22,264 INFO L290 TraceCheckUtils]: 58: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,264 INFO L290 TraceCheckUtils]: 59: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,264 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3601#true} {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 20:34:22,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [111] L38-->L33-4: Formula: (not (<= v_main_~n~0_8 v_main_~a~0_6)) InVars {main_~n~0=v_main_~n~0_8, main_~a~0=v_main_~a~0_6} OutVars{main_~n~0=v_main_~n~0_8, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[] {3791#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-14 20:34:22,265 INFO L272 TraceCheckUtils]: 62: Hoare triple {3791#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:22,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:22,265 INFO L290 TraceCheckUtils]: 64: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,265 INFO L290 TraceCheckUtils]: 65: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:22,266 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3601#true} {3791#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} [121] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3791#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-14 20:34:22,266 INFO L272 TraceCheckUtils]: 67: Hoare triple {3791#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} [95] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) (* v_main_~x~0_13 v_main_~z~0_19)) (* v_main_~x~0_13 (* v_main_~a~0_8 6)) (* v_main_~x~0_13 12)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_19, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~a~0] {3810#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:34:22,267 INFO L290 TraceCheckUtils]: 68: Hoare triple {3810#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:34:22,267 INFO L290 TraceCheckUtils]: 69: Hoare triple {3814#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3602#false} is VALID [2022-04-14 20:34:22,267 INFO L290 TraceCheckUtils]: 70: Hoare triple {3602#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3602#false} is VALID [2022-04-14 20:34:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-14 20:34:22,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:34:23,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {3602#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3602#false} is VALID [2022-04-14 20:34:23,044 INFO L290 TraceCheckUtils]: 69: Hoare triple {3814#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3602#false} is VALID [2022-04-14 20:34:23,045 INFO L290 TraceCheckUtils]: 68: Hoare triple {3810#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:34:23,046 INFO L272 TraceCheckUtils]: 67: Hoare triple {3830#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} [95] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) (* v_main_~x~0_13 v_main_~z~0_19)) (* v_main_~x~0_13 (* v_main_~a~0_8 6)) (* v_main_~x~0_13 12)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_19, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~a~0] {3810#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:34:23,046 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3601#true} {3830#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} [121] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3830#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-14 20:34:23,046 INFO L290 TraceCheckUtils]: 65: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,047 INFO L290 TraceCheckUtils]: 64: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,047 INFO L290 TraceCheckUtils]: 63: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:23,047 INFO L272 TraceCheckUtils]: 62: Hoare triple {3830#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:23,047 INFO L290 TraceCheckUtils]: 61: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [111] L38-->L33-4: Formula: (not (<= v_main_~n~0_8 v_main_~a~0_6)) InVars {main_~n~0=v_main_~n~0_8, main_~a~0=v_main_~a~0_6} OutVars{main_~n~0=v_main_~n~0_8, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[] {3830#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-14 20:34:23,048 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3601#true} {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 20:34:23,048 INFO L290 TraceCheckUtils]: 59: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,048 INFO L290 TraceCheckUtils]: 58: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,048 INFO L290 TraceCheckUtils]: 57: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:23,048 INFO L272 TraceCheckUtils]: 56: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-14 20:34:23,049 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3601#true} {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 20:34:23,049 INFO L290 TraceCheckUtils]: 54: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,049 INFO L290 TraceCheckUtils]: 52: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:23,049 INFO L272 TraceCheckUtils]: 51: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-14 20:34:23,050 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3601#true} {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 20:34:23,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,050 INFO L290 TraceCheckUtils]: 48: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,050 INFO L290 TraceCheckUtils]: 47: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:23,050 INFO L272 TraceCheckUtils]: 46: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:23,051 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3601#true} {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 20:34:23,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,051 INFO L290 TraceCheckUtils]: 43: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:23,051 INFO L272 TraceCheckUtils]: 41: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:23,052 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3601#true} {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 20:34:23,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:23,052 INFO L272 TraceCheckUtils]: 36: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:23,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 20:34:23,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 20:34:23,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 20:34:23,057 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3601#true} {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 20:34:23,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:23,058 INFO L272 TraceCheckUtils]: 28: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-14 20:34:23,059 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3601#true} {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 20:34:23,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:23,059 INFO L272 TraceCheckUtils]: 23: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-14 20:34:23,060 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3601#true} {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 20:34:23,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:23,060 INFO L272 TraceCheckUtils]: 18: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:23,061 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3601#true} {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 20:34:23,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:23,061 INFO L272 TraceCheckUtils]: 13: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:23,062 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3601#true} {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 20:34:23,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-14 20:34:23,062 INFO L272 TraceCheckUtils]: 8: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3601#true} is VALID [2022-04-14 20:34:23,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 20:34:23,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 20:34:23,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {3601#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 20:34:23,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {3601#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3601#true} {3601#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {3601#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {3601#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3601#true} is VALID [2022-04-14 20:34:23,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {3601#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-14 20:34:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-14 20:34:23,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:34:23,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109014922] [2022-04-14 20:34:23,066 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:34:23,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342932759] [2022-04-14 20:34:23,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342932759] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:34:23,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:34:23,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-14 20:34:23,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717600446] [2022-04-14 20:34:23,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 20:34:23,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-14 20:34:23,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:34:23,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 20:34:23,159 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-14 20:34:23,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 20:34:23,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:34:23,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 20:34:23,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-14 20:34:23,160 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 20:34:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:24,063 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2022-04-14 20:34:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 20:34:24,064 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-14 20:34:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:34:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 20:34:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-14 20:34:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 20:34:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-14 20:34:24,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2022-04-14 20:34:24,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:34:24,183 INFO L225 Difference]: With dead ends: 107 [2022-04-14 20:34:24,183 INFO L226 Difference]: Without dead ends: 107 [2022-04-14 20:34:24,183 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-14 20:34:24,184 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 20:34:24,184 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 168 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 20:34:24,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-14 20:34:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2022-04-14 20:34:24,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:34:24,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 20:34:24,190 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 20:34:24,190 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 20:34:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:24,193 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2022-04-14 20:34:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2022-04-14 20:34:24,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:24,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:24,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 107 states. [2022-04-14 20:34:24,195 INFO L87 Difference]: Start difference. First operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 107 states. [2022-04-14 20:34:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:34:24,198 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2022-04-14 20:34:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2022-04-14 20:34:24,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:34:24,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:34:24,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:34:24,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:34:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 20:34:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2022-04-14 20:34:24,201 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 71 [2022-04-14 20:34:24,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:34:24,201 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2022-04-14 20:34:24,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 20:34:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2022-04-14 20:34:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-14 20:34:24,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:34:24,202 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:34:24,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-14 20:34:24,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-14 20:34:24,416 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:34:24,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:34:24,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1401496737, now seen corresponding path program 2 times [2022-04-14 20:34:24,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:34:24,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611496762] [2022-04-14 20:34:24,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:34:24,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:34:24,427 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:34:24,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080679305] [2022-04-14 20:34:24,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 20:34:24,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:24,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:34:24,429 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-14 20:34:24,437 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-14 20:34:24,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 20:34:24,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-14 20:34:24,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 20:34:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 20:34:24,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 20:34:24,534 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 20:34:24,535 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 20:34:24,562 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-14 20:34:24,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:34:24,739 INFO L719 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:34:24,742 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 20:34:24,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:34:24 BasicIcfg [2022-04-14 20:34:24,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 20:34:24,782 INFO L158 Benchmark]: Toolchain (without parser) took 20419.44ms. Allocated memory was 186.6MB in the beginning and 280.0MB in the end (delta: 93.3MB). Free memory was 128.2MB in the beginning and 182.3MB in the end (delta: -54.1MB). Peak memory consumption was 40.4MB. Max. memory is 8.0GB. [2022-04-14 20:34:24,782 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 186.6MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:34:24,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.19ms. Allocated memory was 186.6MB in the beginning and 280.0MB in the end (delta: 93.3MB). Free memory was 128.1MB in the beginning and 252.1MB in the end (delta: -124.0MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2022-04-14 20:34:24,782 INFO L158 Benchmark]: Boogie Preprocessor took 52.44ms. Allocated memory is still 280.0MB. Free memory was 252.1MB in the beginning and 250.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 20:34:24,783 INFO L158 Benchmark]: RCFGBuilder took 313.08ms. Allocated memory is still 280.0MB. Free memory was 250.6MB in the beginning and 237.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-14 20:34:24,783 INFO L158 Benchmark]: IcfgTransformer took 38.90ms. Allocated memory is still 280.0MB. Free memory was 237.5MB in the beginning and 235.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 20:34:24,783 INFO L158 Benchmark]: TraceAbstraction took 19759.06ms. Allocated memory is still 280.0MB. Free memory was 235.4MB in the beginning and 182.3MB in the end (delta: 53.1MB). Peak memory consumption was 54.1MB. Max. memory is 8.0GB. [2022-04-14 20:34:24,784 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.27ms. Allocated memory is still 186.6MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.19ms. Allocated memory was 186.6MB in the beginning and 280.0MB in the end (delta: 93.3MB). Free memory was 128.1MB in the beginning and 252.1MB in the end (delta: -124.0MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.44ms. Allocated memory is still 280.0MB. Free memory was 252.1MB in the beginning and 250.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 313.08ms. Allocated memory is still 280.0MB. Free memory was 250.6MB in the beginning and 237.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 38.90ms. Allocated memory is still 280.0MB. Free memory was 237.5MB in the beginning and 235.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 19759.06ms. Allocated memory is still 280.0MB. Free memory was 235.4MB in the beginning and 182.3MB in the end (delta: 53.1MB). Peak memory consumption was 54.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=5, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=2, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=2, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=2, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND FALSE !(counter++<2) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=2, counter=3, n=2, x=8, y=19, z=18] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 1355 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 875 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1066 IncrementalHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 480 mSDtfsCounter, 1066 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 556 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=11, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 52 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 440 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 2945 SizeOfPredicates, 12 NumberOfNonLiveVariables, 981 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 1252/1302 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-14 20:34:24,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...