/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 02:39:26,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 02:39:26,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 02:39:26,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 02:39:26,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 02:39:26,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 02:39:26,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 02:39:26,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 02:39:26,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 02:39:26,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 02:39:26,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 02:39:26,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 02:39:26,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 02:39:26,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 02:39:26,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 02:39:26,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 02:39:26,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 02:39:26,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 02:39:26,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 02:39:26,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 02:39:26,383 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 02:39:26,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 02:39:26,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 02:39:26,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 02:39:26,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 02:39:26,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 02:39:26,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 02:39:26,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 02:39:26,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 02:39:26,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 02:39:26,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 02:39:26,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 02:39:26,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 02:39:26,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 02:39:26,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 02:39:26,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 02:39:26,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 02:39:26,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 02:39:26,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 02:39:26,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 02:39:26,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 02:39:26,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 02:39:26,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 02:39:26,417 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 02:39:26,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 02:39:26,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 02:39:26,419 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 02:39:26,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 02:39:26,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 02:39:26,420 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 02:39:26,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 02:39:26,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 02:39:26,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 02:39:26,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 02:39:26,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 02:39:26,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 02:39:26,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 02:39:26,421 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 02:39:26,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 02:39:26,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 02:39:26,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 02:39:26,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 02:39:26,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:39:26,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 02:39:26,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 02:39:26,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 02:39:26,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 02:39:26,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 02:39:26,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 02:39:26,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 02:39:26,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 02:39:26,423 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 02:39:26,424 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 02:39:26,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 02:39:26,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 02:39:26,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 02:39:26,639 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 02:39:26,640 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 02:39:26,641 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound1.c [2022-04-08 02:39:26,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253f6bd3c/4ab8b6f310af476a811b1d25ab321ef1/FLAGf9bfd03f7 [2022-04-08 02:39:27,022 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 02:39:27,023 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound1.c [2022-04-08 02:39:27,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253f6bd3c/4ab8b6f310af476a811b1d25ab321ef1/FLAGf9bfd03f7 [2022-04-08 02:39:27,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253f6bd3c/4ab8b6f310af476a811b1d25ab321ef1 [2022-04-08 02:39:27,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 02:39:27,467 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 02:39:27,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 02:39:27,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 02:39:27,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 02:39:27,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:39:27" (1/1) ... [2022-04-08 02:39:27,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d86a4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:27, skipping insertion in model container [2022-04-08 02:39:27,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:39:27" (1/1) ... [2022-04-08 02:39:27,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 02:39:27,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 02:39:27,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound1.c[458,471] [2022-04-08 02:39:27,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:39:27,646 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 02:39:27,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound1.c[458,471] [2022-04-08 02:39:27,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:39:27,670 INFO L208 MainTranslator]: Completed translation [2022-04-08 02:39:27,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:27 WrapperNode [2022-04-08 02:39:27,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 02:39:27,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 02:39:27,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 02:39:27,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 02:39:27,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:27" (1/1) ... [2022-04-08 02:39:27,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:27" (1/1) ... [2022-04-08 02:39:27,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:27" (1/1) ... [2022-04-08 02:39:27,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:27" (1/1) ... [2022-04-08 02:39:27,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:27" (1/1) ... [2022-04-08 02:39:27,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:27" (1/1) ... [2022-04-08 02:39:27,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:27" (1/1) ... [2022-04-08 02:39:27,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 02:39:27,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 02:39:27,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 02:39:27,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 02:39:27,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:27" (1/1) ... [2022-04-08 02:39:27,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:39:27,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:39:27,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 02:39:27,787 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-08 02:39:27,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 02:39:27,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 02:39:27,798 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 02:39:27,798 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 02:39:27,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 02:39:27,798 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 02:39:27,799 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 02:39:27,799 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 02:39:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 02:39:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 02:39:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 02:39:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 02:39:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 02:39:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 02:39:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 02:39:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 02:39:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 02:39:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 02:39:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 02:39:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 02:39:27,847 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 02:39:27,849 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 02:39:27,974 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 02:39:27,978 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 02:39:27,978 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 02:39:27,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:39:27 BoogieIcfgContainer [2022-04-08 02:39:27,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 02:39:27,979 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 02:39:27,980 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 02:39:27,993 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 02:39:27,996 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:39:27" (1/1) ... [2022-04-08 02:39:27,997 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 02:39:28,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:39:28 BasicIcfg [2022-04-08 02:39:28,013 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 02:39:28,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 02:39:28,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 02:39:28,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 02:39:28,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:39:27" (1/4) ... [2022-04-08 02:39:28,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db6a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:39:28, skipping insertion in model container [2022-04-08 02:39:28,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:27" (2/4) ... [2022-04-08 02:39:28,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db6a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:39:28, skipping insertion in model container [2022-04-08 02:39:28,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:39:27" (3/4) ... [2022-04-08 02:39:28,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db6a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:39:28, skipping insertion in model container [2022-04-08 02:39:28,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:39:28" (4/4) ... [2022-04-08 02:39:28,028 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound1.cqvasr [2022-04-08 02:39:28,032 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 02:39:28,032 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 02:39:28,057 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 02:39:28,061 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 02:39:28,061 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 02:39:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:39:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 02:39:28,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:39:28,080 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:39:28,080 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:39:28,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:39:28,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1187991702, now seen corresponding path program 1 times [2022-04-08 02:39:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:39:28,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564575165] [2022-04-08 02:39:28,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:39:28,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:39:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:28,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:39:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:28,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-08 02:39:28,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-08 02:39:28,251 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-08 02:39:28,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 02:39:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:28,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-08 02:39:28,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:28,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:28,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-08 02:39:28,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 02:39:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:28,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-08 02:39:28,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:28,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:28,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-08 02:39:28,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:39:28,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-08 02:39:28,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-08 02:39:28,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-08 02:39:28,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-08 02:39:28,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {32#true} is VALID [2022-04-08 02:39:28,278 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-08 02:39:28,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-08 02:39:28,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:28,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:28,281 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-08 02:39:28,281 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-08 02:39:28,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-08 02:39:28,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:28,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:28,282 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-08 02:39:28,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {33#false} is VALID [2022-04-08 02:39:28,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:28,283 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {33#false} is VALID [2022-04-08 02:39:28,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33#false} is VALID [2022-04-08 02:39:28,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:28,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 02:39:28,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:39:28,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564575165] [2022-04-08 02:39:28,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564575165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:39:28,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:39:28,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 02:39:28,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454219949] [2022-04-08 02:39:28,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:39:28,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 02:39:28,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:39:28,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:39:28,323 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-08 02:39:28,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 02:39:28,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:39:28,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 02:39:28,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 02:39:28,345 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:39:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:28,750 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-08 02:39:28,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 02:39:28,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 02:39:28,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:39:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:39:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 02:39:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:39:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 02:39:28,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-08 02:39:28,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:39:28,864 INFO L225 Difference]: With dead ends: 51 [2022-04-08 02:39:28,864 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 02:39:28,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 02:39:28,868 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:39:28,869 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:39:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 02:39:28,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 02:39:28,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:39:28,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 02:39:28,920 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 02:39:28,920 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 02:39:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:28,924 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 02:39:28,924 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 02:39:28,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:39:28,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:39:28,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 02:39:28,925 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 02:39:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:28,928 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 02:39:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 02:39:28,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:39:28,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:39:28,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:39:28,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:39:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 02:39:28,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 02:39:28,932 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-08 02:39:28,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:39:28,932 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 02:39:28,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:39:28,933 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 02:39:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 02:39:28,933 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:39:28,933 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:39:28,933 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 02:39:28,934 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:39:28,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:39:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash 793962506, now seen corresponding path program 1 times [2022-04-08 02:39:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:39:28,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074774364] [2022-04-08 02:39:28,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:39:28,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:39:28,971 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:39:28,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1964299273] [2022-04-08 02:39:28,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:39:28,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:39:28,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:39:28,984 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-08 02:39:28,985 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-08 02:39:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:29,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 02:39:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:29,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:39:29,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:29,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {202#true} is VALID [2022-04-08 02:39:29,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:29,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:29,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:29,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {202#true} is VALID [2022-04-08 02:39:29,161 INFO L272 TraceCheckUtils]: 6: Hoare triple {202#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {202#true} is VALID [2022-04-08 02:39:29,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {202#true} is VALID [2022-04-08 02:39:29,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:29,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:29,163 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#true} {202#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {202#true} is VALID [2022-04-08 02:39:29,163 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {202#true} is VALID [2022-04-08 02:39:29,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {202#true} is VALID [2022-04-08 02:39:29,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:29,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:29,166 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {202#true} {202#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {202#true} is VALID [2022-04-08 02:39:29,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:39:29,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:39:29,171 INFO L272 TraceCheckUtils]: 18: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:39:29,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:39:29,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {203#false} is VALID [2022-04-08 02:39:29,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {203#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {203#false} is VALID [2022-04-08 02:39:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 02:39:29,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 02:39:29,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:39:29,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074774364] [2022-04-08 02:39:29,173 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:39:29,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964299273] [2022-04-08 02:39:29,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964299273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:39:29,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:39:29,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 02:39:29,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301022783] [2022-04-08 02:39:29,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:39:29,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 02:39:29,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:39:29,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 02:39:29,188 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-08 02:39:29,189 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:39:29,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:39:29,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:39:29,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:39:29,190 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 02:39:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:29,433 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 02:39:29,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:39:29,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 02:39:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:39:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 02:39:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 02:39:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 02:39:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 02:39:29,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 02:39:29,473 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-08 02:39:29,474 INFO L225 Difference]: With dead ends: 35 [2022-04-08 02:39:29,474 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 02:39:29,475 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-08 02:39:29,476 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:39:29,476 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:39:29,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 02:39:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 02:39:29,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:39:29,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:39:29,485 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:39:29,485 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:39:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:29,487 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 02:39:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 02:39:29,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:39:29,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:39:29,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-08 02:39:29,488 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-08 02:39:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:29,490 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 02:39:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 02:39:29,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:39:29,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:39:29,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:39:29,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:39:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:39:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-08 02:39:29,498 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-08 02:39:29,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:39:29,501 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-08 02:39:29,502 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), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 02:39:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 02:39:29,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 02:39:29,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:39:29,503 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:39:29,525 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-08 02:39:29,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:39:29,716 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:39:29,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:39:29,716 INFO L85 PathProgramCache]: Analyzing trace with hash -503871754, now seen corresponding path program 1 times [2022-04-08 02:39:29,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:39:29,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714249002] [2022-04-08 02:39:29,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:39:29,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:39:29,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:39:29,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44430610] [2022-04-08 02:39:29,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:39:29,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:39:29,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:39:29,732 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-08 02:39:29,733 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-08 02:39:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:29,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 02:39:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:29,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:39:29,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:29,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {434#true} is VALID [2022-04-08 02:39:29,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:29,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:29,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:29,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {434#true} is VALID [2022-04-08 02:39:29,935 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:39:29,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {434#true} is VALID [2022-04-08 02:39:29,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:29,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:29,936 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:39:29,936 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:39:29,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {434#true} is VALID [2022-04-08 02:39:29,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:29,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:29,937 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:39:29,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:39:29,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:39:29,938 INFO L272 TraceCheckUtils]: 18: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {434#true} is VALID [2022-04-08 02:39:29,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {434#true} is VALID [2022-04-08 02:39:29,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:29,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:29,939 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {487#(and (= main_~x~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:39:29,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-08 02:39:29,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-08 02:39:29,942 INFO L272 TraceCheckUtils]: 25: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:39:29,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:39:29,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {435#false} is VALID [2022-04-08 02:39:29,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {435#false} is VALID [2022-04-08 02:39:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 02:39:29,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:39:30,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {435#false} is VALID [2022-04-08 02:39:30,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {435#false} is VALID [2022-04-08 02:39:30,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:39:30,128 INFO L272 TraceCheckUtils]: 25: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:39:30,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 02:39:30,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 02:39:30,175 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 02:39:30,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:30,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:30,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {434#true} is VALID [2022-04-08 02:39:30,175 INFO L272 TraceCheckUtils]: 18: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {434#true} is VALID [2022-04-08 02:39:30,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 02:39:30,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 02:39:30,177 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:39:30,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:30,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:30,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {434#true} is VALID [2022-04-08 02:39:30,177 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:39:30,177 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:39:30,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:30,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:30,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {434#true} is VALID [2022-04-08 02:39:30,178 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:39:30,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {434#true} is VALID [2022-04-08 02:39:30,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:30,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:30,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:30,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {434#true} is VALID [2022-04-08 02:39:30,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:39:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 02:39:30,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:39:30,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714249002] [2022-04-08 02:39:30,180 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:39:30,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44430610] [2022-04-08 02:39:30,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44430610] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 02:39:30,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:39:30,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 02:39:30,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783942676] [2022-04-08 02:39:30,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:39:30,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 02:39:30,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:39:30,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:39:30,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:39:30,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:39:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:39:30,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:39:30,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 02:39:30,242 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:39:30,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:30,346 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 02:39:30,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:39:30,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 02:39:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:39:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:39:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 02:39:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:39:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 02:39:30,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 02:39:30,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:39:30,492 INFO L225 Difference]: With dead ends: 37 [2022-04-08 02:39:30,492 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 02:39:30,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 02:39:30,493 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:39:30,493 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:39:30,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 02:39:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 02:39:30,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:39:30,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:39:30,503 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:39:30,503 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:39:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:30,504 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 02:39:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 02:39:30,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:39:30,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:39:30,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-08 02:39:30,505 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-08 02:39:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:30,507 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 02:39:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 02:39:30,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:39:30,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:39:30,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:39:30,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:39:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:39:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-08 02:39:30,509 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-08 02:39:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:39:30,509 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-08 02:39:30,509 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:39:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 02:39:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 02:39:30,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:39:30,510 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:39:30,524 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-08 02:39:30,714 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 02:39:30,715 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:39:30,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:39:30,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1285656823, now seen corresponding path program 1 times [2022-04-08 02:39:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:39:30,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169666812] [2022-04-08 02:39:30,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:39:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:39:30,736 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:39:30,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [636945396] [2022-04-08 02:39:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:39:30,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:39:30,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:39:30,741 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-08 02:39:30,743 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-08 02:39:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:30,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 02:39:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:30,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:39:31,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:39:31,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {784#true} is VALID [2022-04-08 02:39:31,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:39:31,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:39:31,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:39:31,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {784#true} is VALID [2022-04-08 02:39:31,239 INFO L272 TraceCheckUtils]: 6: Hoare triple {784#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {784#true} is VALID [2022-04-08 02:39:31,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {784#true} is VALID [2022-04-08 02:39:31,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:39:31,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:39:31,240 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {784#true} {784#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {784#true} is VALID [2022-04-08 02:39:31,240 INFO L272 TraceCheckUtils]: 11: Hoare triple {784#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {784#true} is VALID [2022-04-08 02:39:31,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {784#true} is VALID [2022-04-08 02:39:31,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:39:31,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:39:31,240 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {784#true} {784#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {784#true} is VALID [2022-04-08 02:39:31,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {837#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:39:31,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {837#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:39:31,242 INFO L272 TraceCheckUtils]: 18: Hoare triple {837#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {784#true} is VALID [2022-04-08 02:39:31,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {784#true} is VALID [2022-04-08 02:39:31,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:39:31,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:39:31,243 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {784#true} {837#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {837#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:39:31,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (<= main_~c~0 1))} is VALID [2022-04-08 02:39:31,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (<= main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (<= main_~c~0 1))} is VALID [2022-04-08 02:39:31,244 INFO L272 TraceCheckUtils]: 25: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (<= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {784#true} is VALID [2022-04-08 02:39:31,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {784#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {869#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:39:31,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {869#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:39:31,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {873#(not (= |__VERIFIER_assert_#in~cond| 0))} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:39:31,246 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {873#(not (= |__VERIFIER_assert_#in~cond| 0))} {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (<= main_~c~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {880#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 02:39:31,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {880#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {884#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 02:39:31,246 INFO L272 TraceCheckUtils]: 31: Hoare triple {884#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {784#true} is VALID [2022-04-08 02:39:31,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {784#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {784#true} is VALID [2022-04-08 02:39:31,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {784#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:39:31,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {784#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:39:31,247 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {784#true} {884#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {884#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 02:39:31,248 INFO L272 TraceCheckUtils]: 36: Hoare triple {884#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:39:31,248 INFO L290 TraceCheckUtils]: 37: Hoare triple {903#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:39:31,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {907#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-08 02:39:31,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {785#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-08 02:39:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 02:39:31,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:39:50,460 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 18) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse1 (* (- 2) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse2 (* (- 119) c_main_~y~0 c_main_~y~0)) (.cse3 (* (- 65) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (not (= (mod (+ .cse0 .cse1 .cse2 (* (- 120) c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse3) 12) 0)) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse4 (+ c_main_~y~0 1))) (= (* .cse4 .cse4) (* main_~k~0 .cse4))))) (not (<= (+ (* 10 (* c_main_~y~0 c_main_~y~0)) (* 5 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1) (div (+ .cse0 .cse1 .cse2 (- 12) .cse3) (- 12)))))) is different from false [2022-04-08 02:39:52,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:39:52,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169666812] [2022-04-08 02:39:52,607 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:39:52,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636945396] [2022-04-08 02:39:52,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636945396] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:39:52,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:39:52,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 02:39:52,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547380840] [2022-04-08 02:39:52,608 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:39:52,608 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 02:39:52,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:39:52,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 02:39:52,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:39:52,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 02:39:52,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:39:52,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 02:39:52,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=140, Unknown=1, NotChecked=24, Total=210 [2022-04-08 02:39:52,634 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 02:39:52,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:52,990 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 02:39:52,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 02:39:52,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 02:39:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:39:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 02:39:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-08 02:39:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 02:39:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-08 02:39:52,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2022-04-08 02:39:53,030 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-08 02:39:53,031 INFO L225 Difference]: With dead ends: 42 [2022-04-08 02:39:53,031 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 02:39:53,031 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=66, Invalid=209, Unknown=1, NotChecked=30, Total=306 [2022-04-08 02:39:53,032 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:39:53,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 134 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:39:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 02:39:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 02:39:53,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:39:53,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:39:53,042 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:39:53,042 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:39:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:53,044 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 02:39:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 02:39:53,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:39:53,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:39:53,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 02:39:53,045 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 02:39:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:53,046 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 02:39:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 02:39:53,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:39:53,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:39:53,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:39:53,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:39:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:39:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-08 02:39:53,048 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-08 02:39:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:39:53,048 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-08 02:39:53,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 02:39:53,049 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 02:39:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 02:39:53,049 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:39:53,050 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:39:53,071 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-08 02:39:53,272 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:39:53,272 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:39:53,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:39:53,272 INFO L85 PathProgramCache]: Analyzing trace with hash -542323485, now seen corresponding path program 2 times [2022-04-08 02:39:53,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:39:53,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980100927] [2022-04-08 02:39:53,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:39:53,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:39:53,296 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:39:53,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [118121533] [2022-04-08 02:39:53,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 02:39:53,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:39:53,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:39:53,297 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-08 02:39:53,298 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-08 02:39:53,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 02:39:53,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:39:53,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 02:39:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:53,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:39:53,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1167#true} is VALID [2022-04-08 02:39:53,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1167#true} is VALID [2022-04-08 02:39:53,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {1167#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1167#true} is VALID [2022-04-08 02:39:53,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {1167#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1193#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 02:39:53,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {1193#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1197#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:39:53,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(not (= |assume_abort_if_not_#in~cond| 0))} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1197#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:39:53,583 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1197#(not (= |assume_abort_if_not_#in~cond| 0))} {1167#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1204#(and (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-08 02:39:53,583 INFO L272 TraceCheckUtils]: 11: Hoare triple {1204#(and (<= 0 main_~k~0) (<= main_~k~0 1))} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1167#true} is VALID [2022-04-08 02:39:53,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {1167#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1167#true} is VALID [2022-04-08 02:39:53,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {1167#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {1167#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,584 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1167#true} {1204#(and (<= 0 main_~k~0) (<= main_~k~0 1))} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1204#(and (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-08 02:39:53,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {1204#(and (<= 0 main_~k~0) (<= main_~k~0 1))} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1223#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-08 02:39:53,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {1223#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1223#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-08 02:39:53,585 INFO L272 TraceCheckUtils]: 18: Hoare triple {1223#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1167#true} is VALID [2022-04-08 02:39:53,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {1167#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1167#true} is VALID [2022-04-08 02:39:53,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {1167#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {1167#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,586 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1167#true} {1223#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1223#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-08 02:39:53,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {1223#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1245#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-08 02:39:53,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {1245#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1245#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-08 02:39:53,588 INFO L272 TraceCheckUtils]: 25: Hoare triple {1245#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1167#true} is VALID [2022-04-08 02:39:53,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {1167#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1167#true} is VALID [2022-04-08 02:39:53,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {1167#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {1167#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,589 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1167#true} {1245#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1245#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-08 02:39:53,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {1245#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1168#false} is VALID [2022-04-08 02:39:53,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {1168#false} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#false} is VALID [2022-04-08 02:39:53,591 INFO L272 TraceCheckUtils]: 32: Hoare triple {1168#false} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1168#false} is VALID [2022-04-08 02:39:53,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {1168#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1168#false} is VALID [2022-04-08 02:39:53,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {1168#false} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1168#false} is VALID [2022-04-08 02:39:53,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {1168#false} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#false} is VALID [2022-04-08 02:39:53,591 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1168#false} {1168#false} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1168#false} is VALID [2022-04-08 02:39:53,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {1168#false} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {1168#false} is VALID [2022-04-08 02:39:53,592 INFO L272 TraceCheckUtils]: 38: Hoare triple {1168#false} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1168#false} is VALID [2022-04-08 02:39:53,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {1168#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1168#false} is VALID [2022-04-08 02:39:53,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {1168#false} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1168#false} is VALID [2022-04-08 02:39:53,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {1168#false} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#false} is VALID [2022-04-08 02:39:53,592 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1168#false} {1168#false} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1168#false} is VALID [2022-04-08 02:39:53,592 INFO L272 TraceCheckUtils]: 43: Hoare triple {1168#false} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1168#false} is VALID [2022-04-08 02:39:53,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {1168#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1168#false} is VALID [2022-04-08 02:39:53,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {1168#false} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1168#false} is VALID [2022-04-08 02:39:53,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {1168#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#false} is VALID [2022-04-08 02:39:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 02:39:53,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:39:53,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {1168#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#false} is VALID [2022-04-08 02:39:53,839 INFO L290 TraceCheckUtils]: 45: Hoare triple {1168#false} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1168#false} is VALID [2022-04-08 02:39:53,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {1168#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1168#false} is VALID [2022-04-08 02:39:53,840 INFO L272 TraceCheckUtils]: 43: Hoare triple {1168#false} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1168#false} is VALID [2022-04-08 02:39:53,840 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1167#true} {1168#false} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1168#false} is VALID [2022-04-08 02:39:53,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {1167#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,840 INFO L290 TraceCheckUtils]: 40: Hoare triple {1167#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {1167#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1167#true} is VALID [2022-04-08 02:39:53,840 INFO L272 TraceCheckUtils]: 38: Hoare triple {1168#false} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1167#true} is VALID [2022-04-08 02:39:53,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {1168#false} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {1168#false} is VALID [2022-04-08 02:39:53,841 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1167#true} {1168#false} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1168#false} is VALID [2022-04-08 02:39:53,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {1167#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {1167#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {1167#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1167#true} is VALID [2022-04-08 02:39:53,841 INFO L272 TraceCheckUtils]: 32: Hoare triple {1168#false} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1167#true} is VALID [2022-04-08 02:39:53,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {1168#false} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#false} is VALID [2022-04-08 02:39:53,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {1363#(not (< main_~c~0 main_~k~0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1168#false} is VALID [2022-04-08 02:39:53,842 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1167#true} {1363#(not (< main_~c~0 main_~k~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1363#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-08 02:39:53,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {1167#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {1167#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {1167#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1167#true} is VALID [2022-04-08 02:39:53,843 INFO L272 TraceCheckUtils]: 25: Hoare triple {1363#(not (< main_~c~0 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1167#true} is VALID [2022-04-08 02:39:53,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {1363#(not (< main_~c~0 main_~k~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1363#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-08 02:39:53,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {1385#(<= main_~k~0 (+ main_~c~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1363#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-08 02:39:53,845 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1167#true} {1385#(<= main_~k~0 (+ main_~c~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1385#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-08 02:39:53,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {1167#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {1167#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {1167#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1167#true} is VALID [2022-04-08 02:39:53,845 INFO L272 TraceCheckUtils]: 18: Hoare triple {1385#(<= main_~k~0 (+ main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1167#true} is VALID [2022-04-08 02:39:53,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {1385#(<= main_~k~0 (+ main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1385#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-08 02:39:53,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {1407#(<= main_~k~0 1)} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1385#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-08 02:39:53,846 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1167#true} {1407#(<= main_~k~0 1)} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1407#(<= main_~k~0 1)} is VALID [2022-04-08 02:39:53,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {1167#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {1167#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {1167#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1167#true} is VALID [2022-04-08 02:39:53,847 INFO L272 TraceCheckUtils]: 11: Hoare triple {1407#(<= main_~k~0 1)} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1167#true} is VALID [2022-04-08 02:39:53,847 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1197#(not (= |assume_abort_if_not_#in~cond| 0))} {1167#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1407#(<= main_~k~0 1)} is VALID [2022-04-08 02:39:53,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(not (= |assume_abort_if_not_#in~cond| 0))} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1197#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:39:53,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {1435#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1197#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:39:53,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {1167#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1435#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 02:39:53,848 INFO L272 TraceCheckUtils]: 6: Hoare triple {1167#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1167#true} is VALID [2022-04-08 02:39:53,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1167#true} is VALID [2022-04-08 02:39:53,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1167#true} is VALID [2022-04-08 02:39:53,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1167#true} is VALID [2022-04-08 02:39:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-08 02:39:53,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:39:53,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980100927] [2022-04-08 02:39:53,850 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:39:53,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118121533] [2022-04-08 02:39:53,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118121533] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 02:39:53,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 02:39:53,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-04-08 02:39:53,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677441268] [2022-04-08 02:39:53,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 02:39:53,851 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-08 02:39:53,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:39:53,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-08 02:39:53,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:39:53,891 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 02:39:53,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:39:53,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 02:39:53,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-08 02:39:53,892 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-08 02:39:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:54,055 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-08 02:39:54,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 02:39:54,056 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-08 02:39:54,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:39:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-08 02:39:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-08 02:39:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-08 02:39:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-08 02:39:54,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-08 02:39:54,094 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-08 02:39:54,095 INFO L225 Difference]: With dead ends: 42 [2022-04-08 02:39:54,095 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 02:39:54,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 02:39:54,096 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:39:54,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 90 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:39:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 02:39:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 02:39:54,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:39:54,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 02:39:54,097 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 02:39:54,097 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 02:39:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:54,098 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:39:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:39:54,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:39:54,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:39:54,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 02:39:54,098 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 02:39:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:54,098 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:39:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:39:54,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:39:54,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:39:54,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:39:54,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:39:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 02:39:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 02:39:54,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2022-04-08 02:39:54,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:39:54,099 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 02:39:54,099 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-08 02:39:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:39:54,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:39:54,102 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 02:39:54,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 02:39:54,318 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:39:54,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 02:39:54,500 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 02:39:54,500 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:39:54,500 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:39:54,500 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 02:39:54,500 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 02:39:54,500 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:39:54,500 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:39:54,500 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-08 02:39:54,500 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-08 02:39:54,500 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-08 02:39:54,501 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-08 02:39:54,501 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 17 42) the Hoare annotation is: true [2022-04-08 02:39:54,501 INFO L885 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-08 02:39:54,501 INFO L878 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= 0 main_~k~0) (<= main_~k~0 1)) [2022-04-08 02:39:54,501 INFO L882 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-08 02:39:54,501 INFO L878 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 1)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (<= 1 main_~c~0) .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (<= main_~c~0 1)) (and (<= 0 main_~k~0) .cse0 .cse1 (= main_~c~0 0) (= main_~y~0 0)))) [2022-04-08 02:39:54,501 INFO L878 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (<= main_~k~0 1) (= main_~y~0 1) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))) (< 0 main_~k~0) (<= main_~c~0 1))) [2022-04-08 02:39:54,501 INFO L878 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 1)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (<= 1 main_~c~0) .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (<= main_~c~0 1)) (and (<= 0 main_~k~0) .cse0 .cse1 (= main_~c~0 0) (= main_~y~0 0)))) [2022-04-08 02:39:54,501 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (<= main_~k~0 1) (= main_~y~0 1) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))) (< 0 main_~k~0) (<= main_~c~0 1))) [2022-04-08 02:39:54,501 INFO L882 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2022-04-08 02:39:54,501 INFO L882 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-04-08 02:39:54,501 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 17 42) no Hoare annotation was computed. [2022-04-08 02:39:54,501 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 17 42) no Hoare annotation was computed. [2022-04-08 02:39:54,501 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-08 02:39:54,502 INFO L882 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-04-08 02:39:54,502 INFO L882 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-04-08 02:39:54,502 INFO L882 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-04-08 02:39:54,502 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-08 02:39:54,502 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-04-08 02:39:54,504 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-08 02:39:54,504 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 02:39:54,507 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:39:54,507 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 02:39:54,507 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-08 02:39:54,507 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:39:54,507 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 02:39:54,507 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 02:39:54,507 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-08 02:39:54,507 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-08 02:39:54,507 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 02:39:54,508 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-08 02:39:54,508 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-08 02:39:54,508 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-08 02:39:54,508 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-08 02:39:54,508 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 02:39:54,508 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 02:39:54,508 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:39:54,508 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:39:54,508 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:39:54,508 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-08 02:39:54,508 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-08 02:39:54,508 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-08 02:39:54,508 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-08 02:39:54,513 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:39:54,513 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 02:39:54,513 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 02:39:54,513 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 02:39:54,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:39:54 BasicIcfg [2022-04-08 02:39:54,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 02:39:54,522 INFO L158 Benchmark]: Toolchain (without parser) took 27054.78ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 129.5MB in the beginning and 162.4MB in the end (delta: -32.9MB). Peak memory consumption was 4.1MB. Max. memory is 8.0GB. [2022-04-08 02:39:54,522 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 02:39:54,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.48ms. Allocated memory is still 178.3MB. Free memory was 129.3MB in the beginning and 155.4MB in the end (delta: -26.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 02:39:54,522 INFO L158 Benchmark]: Boogie Preprocessor took 28.76ms. Allocated memory is still 178.3MB. Free memory was 155.4MB in the beginning and 154.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 02:39:54,523 INFO L158 Benchmark]: RCFGBuilder took 270.59ms. Allocated memory is still 178.3MB. Free memory was 154.0MB in the beginning and 142.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 02:39:54,523 INFO L158 Benchmark]: IcfgTransformer took 33.38ms. Allocated memory is still 178.3MB. Free memory was 142.9MB in the beginning and 141.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 02:39:54,523 INFO L158 Benchmark]: TraceAbstraction took 26507.08ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 140.8MB in the beginning and 162.4MB in the end (delta: -21.6MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2022-04-08 02:39:54,524 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.11ms. Allocated memory is still 178.3MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.48ms. Allocated memory is still 178.3MB. Free memory was 129.3MB in the beginning and 155.4MB in the end (delta: -26.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.76ms. Allocated memory is still 178.3MB. Free memory was 155.4MB in the beginning and 154.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 270.59ms. Allocated memory is still 178.3MB. Free memory was 154.0MB in the beginning and 142.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 33.38ms. Allocated memory is still 178.3MB. Free memory was 142.9MB in the beginning and 141.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 26507.08ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 140.8MB in the beginning and 162.4MB in the end (delta: -21.6MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.4s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 414 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 298 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 116 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 25 PreInvPairs, 34 NumberOfFragments, 320 HoareAnnotationTreeSize, 25 FomulaSimplifications, 22 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 38 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 23.0s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 685 SizeOfPredicates, 7 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 124/139 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((1 <= c && k <= 1) && y == 1) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && 0 < k) && c <= 1) || ((((0 <= k && k <= 1) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && c == 0) && y == 0) RESULT: Ultimate proved your program to be correct! [2022-04-08 02:39:54,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...