/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/sqrt1-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 02:42:40,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 02:42:40,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 02:42:40,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 02:42:40,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 02:42:40,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 02:42:40,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 02:42:40,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 02:42:40,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 02:42:40,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 02:42:40,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 02:42:40,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 02:42:40,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 02:42:40,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 02:42:40,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 02:42:40,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 02:42:40,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 02:42:40,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 02:42:40,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 02:42:40,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 02:42:40,438 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 02:42:40,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 02:42:40,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 02:42:40,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 02:42:40,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 02:42:40,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 02:42:40,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 02:42:40,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 02:42:40,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 02:42:40,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 02:42:40,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 02:42:40,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 02:42:40,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 02:42:40,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 02:42:40,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 02:42:40,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 02:42:40,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 02:42:40,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 02:42:40,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 02:42:40,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 02:42:40,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 02:42:40,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 02:42:40,452 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:42:40,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 02:42:40,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 02:42:40,472 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 02:42:40,472 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 02:42:40,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 02:42:40,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 02:42:40,473 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 02:42:40,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 02:42:40,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 02:42:40,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 02:42:40,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 02:42:40,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 02:42:40,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 02:42:40,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 02:42:40,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 02:42:40,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 02:42:40,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 02:42:40,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 02:42:40,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 02:42:40,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:42:40,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 02:42:40,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 02:42:40,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 02:42:40,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 02:42:40,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 02:42:40,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 02:42:40,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 02:42:40,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 02:42:40,477 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 02:42:40,477 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:42:40,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 02:42:40,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 02:42:40,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 02:42:40,708 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 02:42:40,709 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 02:42:40,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound20.c [2022-04-08 02:42:40,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5253a8f/5078bc6ff2af487a8ec0825211ec72da/FLAG6baef68f4 [2022-04-08 02:42:41,143 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 02:42:41,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound20.c [2022-04-08 02:42:41,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5253a8f/5078bc6ff2af487a8ec0825211ec72da/FLAG6baef68f4 [2022-04-08 02:42:41,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5253a8f/5078bc6ff2af487a8ec0825211ec72da [2022-04-08 02:42:41,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 02:42:41,596 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 02:42:41,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 02:42:41,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 02:42:41,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 02:42:41,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:42:41" (1/1) ... [2022-04-08 02:42:41,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5bb86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:42:41, skipping insertion in model container [2022-04-08 02:42:41,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:42:41" (1/1) ... [2022-04-08 02:42:41,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 02:42:41,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 02:42:41,740 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/sqrt1-ll_unwindbound20.c[520,533] [2022-04-08 02:42:41,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:42:41,763 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 02:42:41,773 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/sqrt1-ll_unwindbound20.c[520,533] [2022-04-08 02:42:41,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:42:41,794 INFO L208 MainTranslator]: Completed translation [2022-04-08 02:42:41,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:42:41 WrapperNode [2022-04-08 02:42:41,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 02:42:41,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 02:42:41,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 02:42:41,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 02:42:41,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:42:41" (1/1) ... [2022-04-08 02:42:41,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:42:41" (1/1) ... [2022-04-08 02:42:41,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:42:41" (1/1) ... [2022-04-08 02:42:41,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:42:41" (1/1) ... [2022-04-08 02:42:41,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:42:41" (1/1) ... [2022-04-08 02:42:41,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:42:41" (1/1) ... [2022-04-08 02:42:41,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:42:41" (1/1) ... [2022-04-08 02:42:41,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 02:42:41,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 02:42:41,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 02:42:41,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 02:42:41,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:42:41" (1/1) ... [2022-04-08 02:42:41,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:42:41,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:42:41,850 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:42:41,858 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:42:41,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 02:42:41,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 02:42:41,879 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 02:42:41,879 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 02:42:41,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 02:42:41,880 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 02:42:41,880 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 02:42:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 02:42:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 02:42:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 02:42:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 02:42:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 02:42:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 02:42:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 02:42:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 02:42:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 02:42:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 02:42:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 02:42:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 02:42:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 02:42:41,927 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 02:42:41,929 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 02:42:42,026 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 02:42:42,031 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 02:42:42,031 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 02:42:42,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:42:42 BoogieIcfgContainer [2022-04-08 02:42:42,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 02:42:42,033 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 02:42:42,033 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 02:42:42,033 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 02:42:42,036 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:42:42" (1/1) ... [2022-04-08 02:42:42,037 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 02:42:42,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:42:42 BasicIcfg [2022-04-08 02:42:42,051 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 02:42:42,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 02:42:42,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 02:42:42,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 02:42:42,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:42:41" (1/4) ... [2022-04-08 02:42:42,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c3136e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:42:42, skipping insertion in model container [2022-04-08 02:42:42,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:42:41" (2/4) ... [2022-04-08 02:42:42,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c3136e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:42:42, skipping insertion in model container [2022-04-08 02:42:42,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:42:42" (3/4) ... [2022-04-08 02:42:42,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c3136e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:42:42, skipping insertion in model container [2022-04-08 02:42:42,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:42:42" (4/4) ... [2022-04-08 02:42:42,064 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound20.cqvasr [2022-04-08 02:42:42,067 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 02:42:42,067 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 02:42:42,095 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 02:42:42,099 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:42:42,099 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 02:42:42,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 02:42:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 02:42:42,118 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:42:42,118 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:42:42,120 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:42:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:42:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1238828824, now seen corresponding path program 1 times [2022-04-08 02:42:42,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:42:42,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869787412] [2022-04-08 02:42:42,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:42:42,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:42:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:42,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:42:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:42,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {29#true} is VALID [2022-04-08 02:42:42,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-08 02:42:42,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-08 02:42:42,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:42:42,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {29#true} is VALID [2022-04-08 02:42:42,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-08 02:42:42,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-08 02:42:42,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-08 02:42:42,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {29#true} is VALID [2022-04-08 02:42:42,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} [75] L30-3-->L30-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-08 02:42:42,347 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} [77] L30-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_12 (+ (* 2 v_main_~a~0_12) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_12, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {30#false} is VALID [2022-04-08 02:42:42,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} [81] __VERIFIER_assertENTRY-->L12: 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] {30#false} is VALID [2022-04-08 02:42:42,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} [84] L12-->L13: 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[] {30#false} is VALID [2022-04-08 02:42:42,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-08 02:42:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:42:42,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:42:42,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869787412] [2022-04-08 02:42:42,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869787412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:42:42,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:42:42,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 02:42:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709719037] [2022-04-08 02:42:42,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:42:42,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 02:42:42,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:42:42,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:42,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:42:42,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 02:42:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:42:42,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 02:42:42,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 02:42:42,398 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:42,549 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-08 02:42:42,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 02:42:42,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 02:42:42,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:42:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 02:42:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 02:42:42,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-08 02:42:42,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:42:42,645 INFO L225 Difference]: With dead ends: 47 [2022-04-08 02:42:42,645 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 02:42:42,648 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 02:42:42,651 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:42:42,652 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:42:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 02:42:42,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-08 02:42:42,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:42:42,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:42:42,676 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:42:42,677 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:42:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:42,680 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-08 02:42:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-08 02:42:42,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:42,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:42,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-08 02:42:42,681 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-08 02:42:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:42,683 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-08 02:42:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-08 02:42:42,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:42,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:42,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:42:42,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:42:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:42:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-08 02:42:42,686 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-08 02:42:42,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:42:42,686 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-08 02:42:42,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:42,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-08 02:42:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 02:42:42,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:42:42,687 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:42:42,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 02:42:42,687 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:42:42,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:42:42,688 INFO L85 PathProgramCache]: Analyzing trace with hash -221581531, now seen corresponding path program 1 times [2022-04-08 02:42:42,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:42:42,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674856496] [2022-04-08 02:42:42,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:42:42,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:42:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:42,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:42:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:42,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {187#(= ~counter~0 0)} is VALID [2022-04-08 02:42:42,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#(= ~counter~0 0)} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(= ~counter~0 0)} is VALID [2022-04-08 02:42:42,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {187#(= ~counter~0 0)} {182#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(= ~counter~0 0)} is VALID [2022-04-08 02:42:42,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {182#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:42:42,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {187#(= ~counter~0 0)} is VALID [2022-04-08 02:42:42,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {187#(= ~counter~0 0)} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(= ~counter~0 0)} is VALID [2022-04-08 02:42:42,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187#(= ~counter~0 0)} {182#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(= ~counter~0 0)} is VALID [2022-04-08 02:42:42,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {187#(= ~counter~0 0)} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(= ~counter~0 0)} is VALID [2022-04-08 02:42:42,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {187#(= ~counter~0 0)} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {187#(= ~counter~0 0)} is VALID [2022-04-08 02:42:42,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {187#(= ~counter~0 0)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {188#(= |main_#t~post5| 0)} is VALID [2022-04-08 02:42:42,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#(= |main_#t~post5| 0)} [78] L30-1-->L30-4: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {183#false} is VALID [2022-04-08 02:42:42,758 INFO L272 TraceCheckUtils]: 8: Hoare triple {183#false} [77] L30-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_12 (+ (* 2 v_main_~a~0_12) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_12, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {183#false} is VALID [2022-04-08 02:42:42,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {183#false} [81] __VERIFIER_assertENTRY-->L12: 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] {183#false} is VALID [2022-04-08 02:42:42,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {183#false} [84] L12-->L13: 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[] {183#false} is VALID [2022-04-08 02:42:42,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#false} is VALID [2022-04-08 02:42:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:42:42,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:42:42,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674856496] [2022-04-08 02:42:42,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674856496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:42:42,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:42:42,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:42:42,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7006435] [2022-04-08 02:42:42,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:42:42,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 02:42:42,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:42:42,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:42,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:42:42,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:42:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:42:42,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:42:42,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:42:42,771 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:42,886 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-08 02:42:42,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 02:42:42,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 02:42:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:42:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 02:42:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 02:42:42,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-08 02:42:42,921 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:42:42,922 INFO L225 Difference]: With dead ends: 32 [2022-04-08 02:42:42,923 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 02:42:42,923 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 02:42:42,924 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:42:42,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:42:42,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 02:42:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 02:42:42,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:42:42,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:42:42,928 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:42:42,928 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:42:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:42,929 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-08 02:42:42,929 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 02:42:42,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:42,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:42,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-08 02:42:42,930 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-08 02:42:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:42,932 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-08 02:42:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 02:42:42,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:42,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:42,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:42:42,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:42:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:42:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-08 02:42:42,934 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-08 02:42:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:42:42,934 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-08 02:42:42,934 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 02:42:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 02:42:42,935 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:42:42,935 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:42:42,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 02:42:42,935 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:42:42,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:42:42,936 INFO L85 PathProgramCache]: Analyzing trace with hash -220509055, now seen corresponding path program 1 times [2022-04-08 02:42:42,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:42:42,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11596826] [2022-04-08 02:42:42,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:42:42,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:42:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:43,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:42:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:43,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {333#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {325#true} is VALID [2022-04-08 02:42:43,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-08 02:42:43,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-08 02:42:43,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {325#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:42:43,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {333#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {325#true} is VALID [2022-04-08 02:42:43,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-08 02:42:43,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-08 02:42:43,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {325#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-08 02:42:43,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 02:42:43,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 02:42:43,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 02:42:43,036 INFO L272 TraceCheckUtils]: 8: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:42:43,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(not (= |__VERIFIER_assert_#in~cond| 0))} [81] __VERIFIER_assertENTRY-->L12: 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] {332#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 02:42:43,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {332#(not (= __VERIFIER_assert_~cond 0))} [84] L12-->L13: 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[] {326#false} is VALID [2022-04-08 02:42:43,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {326#false} is VALID [2022-04-08 02:42:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:42:43,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:42:43,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11596826] [2022-04-08 02:42:43,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11596826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:42:43,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:42:43,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 02:42:43,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164021481] [2022-04-08 02:42:43,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:42:43,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 02:42:43,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:42:43,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:43,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:42:43,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 02:42:43,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:42:43,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 02:42:43,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 02:42:43,057 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:43,400 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-08 02:42:43,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 02:42:43,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 02:42:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:42:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 02:42:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 02:42:43,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 02:42:43,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:42:43,462 INFO L225 Difference]: With dead ends: 36 [2022-04-08 02:42:43,462 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 02:42:43,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 02:42:43,464 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:42:43,465 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:42:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 02:42:43,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-08 02:42:43,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:42:43,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:42:43,469 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:42:43,470 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:42:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:43,471 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 02:42:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 02:42:43,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:43,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:43,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-08 02:42:43,472 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-08 02:42:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:43,474 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 02:42:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 02:42:43,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:43,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:43,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:42:43,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:42:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:42:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 02:42:43,480 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-08 02:42:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:42:43,480 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 02:42:43,480 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:42:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 02:42:43,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 02:42:43,482 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:42:43,482 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:42:43,482 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 02:42:43,482 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:42:43,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:42:43,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1748396925, now seen corresponding path program 1 times [2022-04-08 02:42:43,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:42:43,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520602299] [2022-04-08 02:42:43,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:42:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:42:43,511 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:42:43,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638816157] [2022-04-08 02:42:43,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:42:43,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:42:43,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:42:43,513 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:42:43,514 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:42:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:43,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 02:42:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:43,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:42:43,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {518#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {518#true} is VALID [2022-04-08 02:42:43,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {518#true} is VALID [2022-04-08 02:42:43,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {518#true} is VALID [2022-04-08 02:42:43,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {518#true} is VALID [2022-04-08 02:42:43,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {518#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {518#true} is VALID [2022-04-08 02:42:43,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {518#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 02:42:43,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 02:42:43,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 02:42:43,684 INFO L272 TraceCheckUtils]: 8: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {518#true} is VALID [2022-04-08 02:42:43,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {518#true} [81] __VERIFIER_assertENTRY-->L12: 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] {518#true} is VALID [2022-04-08 02:42:43,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {518#true} [85] L12-->L12-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[] {518#true} is VALID [2022-04-08 02:42:43,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {518#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {518#true} is VALID [2022-04-08 02:42:43,685 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {518#true} {538#(and (= main_~a~0 0) (= main_~s~0 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 02:42:43,686 INFO L272 TraceCheckUtils]: 13: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {563#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:42:43,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {563#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: 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] {567#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:42:43,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: 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[] {519#false} is VALID [2022-04-08 02:42:43,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {519#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {519#false} is VALID [2022-04-08 02:42:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:42:43,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 02:42:43,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:42:43,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520602299] [2022-04-08 02:42:43,688 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:42:43,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638816157] [2022-04-08 02:42:43,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638816157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:42:43,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:42:43,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 02:42:43,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420180891] [2022-04-08 02:42:43,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:42:43,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 02:42:43,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:42:43,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 02:42:43,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:42:43,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:42:43,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:42:43,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:42:43,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:42:43,710 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 02:42:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:43,841 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 02:42:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:42:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 02:42:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:42:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 02:42:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 02:42:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 02:42:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 02:42:43,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 02:42:43,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:42:43,883 INFO L225 Difference]: With dead ends: 40 [2022-04-08 02:42:43,883 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 02:42:43,884 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 02:42:43,891 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:42:43,893 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:42:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 02:42:43,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-08 02:42:43,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:42:43,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 02:42:43,904 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 02:42:43,904 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 02:42:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:43,910 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 02:42:43,910 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 02:42:43,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:43,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:43,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-08 02:42:43,916 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-08 02:42:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:43,917 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 02:42:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 02:42:43,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:43,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:43,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:42:43,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:42:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 02:42:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-08 02:42:43,919 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-08 02:42:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:42:43,919 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-08 02:42:43,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 02:42:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-08 02:42:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 02:42:43,920 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:42:43,920 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:42:43,941 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:42:44,120 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:42:44,121 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:42:44,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:42:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash -214718627, now seen corresponding path program 1 times [2022-04-08 02:42:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:42:44,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236272554] [2022-04-08 02:42:44,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:42:44,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:42:44,132 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:42:44,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [943277504] [2022-04-08 02:42:44,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:42:44,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:42:44,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:42:44,139 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:42:44,141 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:42:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:44,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 02:42:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:44,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:42:44,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-08 02:42:44,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {769#true} is VALID [2022-04-08 02:42:44,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-08 02:42:44,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-08 02:42:44,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-08 02:42:44,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:42:44,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:42:44,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:42:44,309 INFO L272 TraceCheckUtils]: 8: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {769#true} is VALID [2022-04-08 02:42:44,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {769#true} [81] __VERIFIER_assertENTRY-->L12: 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] {769#true} is VALID [2022-04-08 02:42:44,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {769#true} [85] L12-->L12-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[] {769#true} is VALID [2022-04-08 02:42:44,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {769#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-08 02:42:44,312 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {769#true} {789#(and (= main_~t~0 1) (= main_~s~0 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:42:44,312 INFO L272 TraceCheckUtils]: 13: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {769#true} is VALID [2022-04-08 02:42:44,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {769#true} [81] __VERIFIER_assertENTRY-->L12: 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] {769#true} is VALID [2022-04-08 02:42:44,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {769#true} [85] L12-->L12-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[] {769#true} is VALID [2022-04-08 02:42:44,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {769#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-08 02:42:44,313 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {769#true} {789#(and (= main_~t~0 1) (= main_~s~0 1))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:42:44,314 INFO L272 TraceCheckUtils]: 18: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:42:44,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {829#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: 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] {833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:42:44,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: 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[] {770#false} is VALID [2022-04-08 02:42:44,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {770#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {770#false} is VALID [2022-04-08 02:42:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 02:42:44,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 02:42:44,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:42:44,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236272554] [2022-04-08 02:42:44,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:42:44,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943277504] [2022-04-08 02:42:44,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943277504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:42:44,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:42:44,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 02:42:44,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865750337] [2022-04-08 02:42:44,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:42:44,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 02:42:44,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:42:44,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:42:44,331 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:42:44,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:42:44,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:42:44,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:42:44,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:42:44,332 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:42:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:44,456 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 02:42:44,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:42:44,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 02:42:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:42:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:42:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 02:42:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:42:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 02:42:44,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 02:42:44,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:42:44,501 INFO L225 Difference]: With dead ends: 44 [2022-04-08 02:42:44,501 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 02:42:44,502 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:42:44,504 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:42:44,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:42:44,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 02:42:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 02:42:44,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:42:44,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 02:42:44,517 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 02:42:44,517 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 02:42:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:44,519 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 02:42:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 02:42:44,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:44,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:44,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-08 02:42:44,521 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-08 02:42:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:44,523 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 02:42:44,523 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 02:42:44,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:44,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:44,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:42:44,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:42:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 02:42:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-08 02:42:44,526 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-08 02:42:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:42:44,526 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-08 02:42:44,526 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:42:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 02:42:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 02:42:44,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:42:44,527 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:42:44,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 02:42:44,742 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:42:44,742 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:42:44,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:42:44,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1697115236, now seen corresponding path program 1 times [2022-04-08 02:42:44,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:42:44,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628668743] [2022-04-08 02:42:44,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:42:44,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:42:44,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:42:44,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1852273984] [2022-04-08 02:42:44,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:42:44,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:42:44,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:42:44,762 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:42:44,763 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:42:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:44,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 02:42:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:44,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:42:45,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {1043#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1043#true} is VALID [2022-04-08 02:42:45,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {1043#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1051#(<= ~counter~0 0)} is VALID [2022-04-08 02:42:45,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {1051#(<= ~counter~0 0)} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#(<= ~counter~0 0)} is VALID [2022-04-08 02:42:45,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1051#(<= ~counter~0 0)} {1043#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#(<= ~counter~0 0)} is VALID [2022-04-08 02:42:45,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {1051#(<= ~counter~0 0)} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#(<= ~counter~0 0)} is VALID [2022-04-08 02:42:45,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {1051#(<= ~counter~0 0)} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1051#(<= ~counter~0 0)} is VALID [2022-04-08 02:42:45,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {1051#(<= ~counter~0 0)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#(<= ~counter~0 1)} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,013 INFO L272 TraceCheckUtils]: 8: Hoare triple {1067#(<= ~counter~0 1)} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {1067#(<= ~counter~0 1)} [81] __VERIFIER_assertENTRY-->L12: 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] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {1067#(<= ~counter~0 1)} [85] L12-->L12-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[] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {1067#(<= ~counter~0 1)} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,015 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,015 INFO L272 TraceCheckUtils]: 13: Hoare triple {1067#(<= ~counter~0 1)} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {1067#(<= ~counter~0 1)} [81] __VERIFIER_assertENTRY-->L12: 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] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {1067#(<= ~counter~0 1)} [85] L12-->L12-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[] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {1067#(<= ~counter~0 1)} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,017 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,017 INFO L272 TraceCheckUtils]: 18: Hoare triple {1067#(<= ~counter~0 1)} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {1067#(<= ~counter~0 1)} [81] __VERIFIER_assertENTRY-->L12: 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] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {1067#(<= ~counter~0 1)} [85] L12-->L12-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[] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {1067#(<= ~counter~0 1)} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,023 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {1067#(<= ~counter~0 1)} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-08 02:42:45,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {1067#(<= ~counter~0 1)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1122#(<= |main_#t~post5| 1)} is VALID [2022-04-08 02:42:45,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {1122#(<= |main_#t~post5| 1)} [78] L30-1-->L30-4: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1044#false} is VALID [2022-04-08 02:42:45,025 INFO L272 TraceCheckUtils]: 26: Hoare triple {1044#false} [77] L30-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_12 (+ (* 2 v_main_~a~0_12) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_12, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1044#false} is VALID [2022-04-08 02:42:45,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {1044#false} [81] __VERIFIER_assertENTRY-->L12: 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] {1044#false} is VALID [2022-04-08 02:42:45,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {1044#false} [84] L12-->L13: 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[] {1044#false} is VALID [2022-04-08 02:42:45,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {1044#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1044#false} is VALID [2022-04-08 02:42:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 02:42:45,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:42:45,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {1044#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1044#false} is VALID [2022-04-08 02:42:45,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {1044#false} [84] L12-->L13: 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[] {1044#false} is VALID [2022-04-08 02:42:45,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {1044#false} [81] __VERIFIER_assertENTRY-->L12: 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] {1044#false} is VALID [2022-04-08 02:42:45,178 INFO L272 TraceCheckUtils]: 26: Hoare triple {1044#false} [77] L30-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_12 (+ (* 2 v_main_~a~0_12) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_12, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1044#false} is VALID [2022-04-08 02:42:45,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#(< |main_#t~post5| 20)} [78] L30-1-->L30-4: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1044#false} is VALID [2022-04-08 02:42:45,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {1154#(< ~counter~0 20)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1150#(< |main_#t~post5| 20)} is VALID [2022-04-08 02:42:45,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {1154#(< ~counter~0 20)} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1154#(< ~counter~0 20)} is VALID [2022-04-08 02:42:45,196 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1043#true} {1154#(< ~counter~0 20)} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1154#(< ~counter~0 20)} is VALID [2022-04-08 02:42:45,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {1043#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1043#true} is VALID [2022-04-08 02:42:45,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {1043#true} [85] L12-->L12-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[] {1043#true} is VALID [2022-04-08 02:42:45,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {1043#true} [81] __VERIFIER_assertENTRY-->L12: 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] {1043#true} is VALID [2022-04-08 02:42:45,196 INFO L272 TraceCheckUtils]: 18: Hoare triple {1154#(< ~counter~0 20)} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1043#true} is VALID [2022-04-08 02:42:45,197 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1043#true} {1154#(< ~counter~0 20)} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1154#(< ~counter~0 20)} is VALID [2022-04-08 02:42:45,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {1043#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1043#true} is VALID [2022-04-08 02:42:45,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {1043#true} [85] L12-->L12-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[] {1043#true} is VALID [2022-04-08 02:42:45,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {1043#true} [81] __VERIFIER_assertENTRY-->L12: 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] {1043#true} is VALID [2022-04-08 02:42:45,198 INFO L272 TraceCheckUtils]: 13: Hoare triple {1154#(< ~counter~0 20)} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1043#true} is VALID [2022-04-08 02:42:45,199 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1043#true} {1154#(< ~counter~0 20)} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1154#(< ~counter~0 20)} is VALID [2022-04-08 02:42:45,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1043#true} is VALID [2022-04-08 02:42:45,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {1043#true} [85] L12-->L12-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[] {1043#true} is VALID [2022-04-08 02:42:45,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#true} [81] __VERIFIER_assertENTRY-->L12: 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] {1043#true} is VALID [2022-04-08 02:42:45,199 INFO L272 TraceCheckUtils]: 8: Hoare triple {1154#(< ~counter~0 20)} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1043#true} is VALID [2022-04-08 02:42:45,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {1154#(< ~counter~0 20)} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1154#(< ~counter~0 20)} is VALID [2022-04-08 02:42:45,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {1209#(< ~counter~0 19)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1154#(< ~counter~0 20)} is VALID [2022-04-08 02:42:45,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {1209#(< ~counter~0 19)} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1209#(< ~counter~0 19)} is VALID [2022-04-08 02:42:45,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {1209#(< ~counter~0 19)} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1209#(< ~counter~0 19)} is VALID [2022-04-08 02:42:45,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1209#(< ~counter~0 19)} {1043#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1209#(< ~counter~0 19)} is VALID [2022-04-08 02:42:45,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {1209#(< ~counter~0 19)} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1209#(< ~counter~0 19)} is VALID [2022-04-08 02:42:45,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {1043#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1209#(< ~counter~0 19)} is VALID [2022-04-08 02:42:45,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {1043#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1043#true} is VALID [2022-04-08 02:42:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 02:42:45,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:42:45,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628668743] [2022-04-08 02:42:45,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:42:45,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852273984] [2022-04-08 02:42:45,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852273984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 02:42:45,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 02:42:45,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 02:42:45,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604556133] [2022-04-08 02:42:45,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 02:42:45,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 30 [2022-04-08 02:42:45,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:42:45,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 02:42:45,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:42:45,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 02:42:45,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:42:45,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 02:42:45,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 02:42:45,238 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 02:42:45,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:45,567 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2022-04-08 02:42:45,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 02:42:45,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 30 [2022-04-08 02:42:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:42:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 02:42:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-04-08 02:42:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 02:42:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-04-08 02:42:45,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 94 transitions. [2022-04-08 02:42:45,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:42:45,668 INFO L225 Difference]: With dead ends: 80 [2022-04-08 02:42:45,668 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 02:42:45,668 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-08 02:42:45,669 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:42:45,669 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 167 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:42:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 02:42:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2022-04-08 02:42:45,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:42:45,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 02:42:45,701 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 02:42:45,701 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 02:42:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:45,705 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-08 02:42:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-04-08 02:42:45,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:45,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:45,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 71 states. [2022-04-08 02:42:45,705 INFO L87 Difference]: Start difference. First operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 71 states. [2022-04-08 02:42:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:45,708 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-08 02:42:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-04-08 02:42:45,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:45,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:45,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:42:45,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:42:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 02:42:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-04-08 02:42:45,711 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 30 [2022-04-08 02:42:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:42:45,711 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-04-08 02:42:45,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 02:42:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-04-08 02:42:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 02:42:45,711 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:42:45,711 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:42:45,728 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:42:45,928 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:42:45,928 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:42:45,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:42:45,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1698187712, now seen corresponding path program 1 times [2022-04-08 02:42:45,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:42:45,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656685016] [2022-04-08 02:42:45,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:42:45,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:42:45,946 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:42:45,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1088491157] [2022-04-08 02:42:45,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:42:45,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:42:45,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:42:45,947 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:42:45,964 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:42:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:45,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 02:42:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:45,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:42:46,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {1601#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {1601#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1601#true} is VALID [2022-04-08 02:42:46,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {1601#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1601#true} {1601#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {1601#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {1601#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 02:42:46,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 02:42:46,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 02:42:46,131 INFO L272 TraceCheckUtils]: 8: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1601#true} is VALID [2022-04-08 02:42:46,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {1601#true} [81] __VERIFIER_assertENTRY-->L12: 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] {1601#true} is VALID [2022-04-08 02:42:46,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {1601#true} [85] L12-->L12-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[] {1601#true} is VALID [2022-04-08 02:42:46,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {1601#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,132 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1601#true} {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 02:42:46,132 INFO L272 TraceCheckUtils]: 13: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1601#true} is VALID [2022-04-08 02:42:46,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {1601#true} [81] __VERIFIER_assertENTRY-->L12: 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] {1601#true} is VALID [2022-04-08 02:42:46,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#true} [85] L12-->L12-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[] {1601#true} is VALID [2022-04-08 02:42:46,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,133 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1601#true} {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 02:42:46,133 INFO L272 TraceCheckUtils]: 18: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1601#true} is VALID [2022-04-08 02:42:46,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {1601#true} [81] __VERIFIER_assertENTRY-->L12: 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] {1601#true} is VALID [2022-04-08 02:42:46,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {1601#true} [85] L12-->L12-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[] {1601#true} is VALID [2022-04-08 02:42:46,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,134 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1601#true} {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 02:42:46,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 02:42:46,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 02:42:46,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 02:42:46,137 INFO L272 TraceCheckUtils]: 26: Hoare triple {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:42:46,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: 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] {1690#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:42:46,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {1690#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: 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[] {1602#false} is VALID [2022-04-08 02:42:46,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {1602#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1602#false} is VALID [2022-04-08 02:42:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 02:42:46,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:42:46,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {1602#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1602#false} is VALID [2022-04-08 02:42:46,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {1690#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: 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[] {1602#false} is VALID [2022-04-08 02:42:46,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: 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] {1690#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:42:46,278 INFO L272 TraceCheckUtils]: 26: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:42:46,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:42:46,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:42:46,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:42:46,280 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1601#true} {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:42:46,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {1601#true} [85] L12-->L12-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[] {1601#true} is VALID [2022-04-08 02:42:46,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {1601#true} [81] __VERIFIER_assertENTRY-->L12: 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] {1601#true} is VALID [2022-04-08 02:42:46,281 INFO L272 TraceCheckUtils]: 18: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1601#true} is VALID [2022-04-08 02:42:46,281 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1601#true} {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:42:46,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#true} [85] L12-->L12-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[] {1601#true} is VALID [2022-04-08 02:42:46,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {1601#true} [81] __VERIFIER_assertENTRY-->L12: 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] {1601#true} is VALID [2022-04-08 02:42:46,282 INFO L272 TraceCheckUtils]: 13: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1601#true} is VALID [2022-04-08 02:42:46,293 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1601#true} {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:42:46,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {1601#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {1601#true} [85] L12-->L12-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[] {1601#true} is VALID [2022-04-08 02:42:46,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {1601#true} [81] __VERIFIER_assertENTRY-->L12: 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] {1601#true} is VALID [2022-04-08 02:42:46,294 INFO L272 TraceCheckUtils]: 8: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1601#true} is VALID [2022-04-08 02:42:46,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:42:46,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:42:46,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {1601#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:42:46,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {1601#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1601#true} {1601#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {1601#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {1601#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1601#true} is VALID [2022-04-08 02:42:46,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {1601#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-08 02:42:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 02:42:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:42:46,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656685016] [2022-04-08 02:42:46,296 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:42:46,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088491157] [2022-04-08 02:42:46,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088491157] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 02:42:46,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:42:46,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 02:42:46,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627779987] [2022-04-08 02:42:46,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:42:46,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 30 [2022-04-08 02:42:46,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:42:46,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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:42:46,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:42:46,316 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:42:46,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:42:46,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:42:46,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 02:42:46,316 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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:42:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:46,675 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2022-04-08 02:42:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:42:46,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 30 [2022-04-08 02:42:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:42:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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:42:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 02:42:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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:42:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 02:42:46,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 02:42:46,704 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:42:46,708 INFO L225 Difference]: With dead ends: 81 [2022-04-08 02:42:46,708 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 02:42:46,708 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 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:42:46,709 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 02:42:46,709 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 02:42:46,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 02:42:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-08 02:42:46,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:42:46,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 02:42:46,757 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 02:42:46,757 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 02:42:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:46,761 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-08 02:42:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-08 02:42:46,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:46,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:46,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-08 02:42:46,762 INFO L87 Difference]: Start difference. First operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-08 02:42:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:46,765 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-08 02:42:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-08 02:42:46,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:46,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:46,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:42:46,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:42:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 02:42:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2022-04-08 02:42:46,769 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 30 [2022-04-08 02:42:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:42:46,769 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2022-04-08 02:42:46,769 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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:42:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-08 02:42:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 02:42:46,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:42:46,770 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:42:46,794 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:42:46,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:42:46,976 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:42:46,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:42:46,976 INFO L85 PathProgramCache]: Analyzing trace with hash 888200606, now seen corresponding path program 2 times [2022-04-08 02:42:46,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:42:46,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316941521] [2022-04-08 02:42:46,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:42:46,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:42:46,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:42:46,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1709453292] [2022-04-08 02:42:46,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 02:42:46,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:42:46,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:42:46,997 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:42:47,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 02:42:47,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 02:42:47,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:42:47,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 02:42:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:42:47,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:42:47,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {2185#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {2185#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2185#true} is VALID [2022-04-08 02:42:47,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {2185#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2185#true} {2185#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {2185#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {2185#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:42:47,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:42:47,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:42:47,219 INFO L272 TraceCheckUtils]: 8: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2185#true} is VALID [2022-04-08 02:42:47,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: 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] {2185#true} is VALID [2022-04-08 02:42:47,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {2185#true} [85] L12-->L12-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[] {2185#true} is VALID [2022-04-08 02:42:47,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,220 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2185#true} {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:42:47,220 INFO L272 TraceCheckUtils]: 13: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {2185#true} is VALID [2022-04-08 02:42:47,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: 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] {2185#true} is VALID [2022-04-08 02:42:47,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {2185#true} [85] L12-->L12-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[] {2185#true} is VALID [2022-04-08 02:42:47,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,221 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2185#true} {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:42:47,221 INFO L272 TraceCheckUtils]: 18: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {2185#true} is VALID [2022-04-08 02:42:47,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: 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] {2185#true} is VALID [2022-04-08 02:42:47,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {2185#true} [85] L12-->L12-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[] {2185#true} is VALID [2022-04-08 02:42:47,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,222 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2185#true} {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:42:47,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-08 02:42:47,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-08 02:42:47,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-08 02:42:47,234 INFO L272 TraceCheckUtils]: 26: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2185#true} is VALID [2022-04-08 02:42:47,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: 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] {2185#true} is VALID [2022-04-08 02:42:47,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {2185#true} [85] L12-->L12-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[] {2185#true} is VALID [2022-04-08 02:42:47,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,236 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2185#true} {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-08 02:42:47,236 INFO L272 TraceCheckUtils]: 31: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:42:47,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: 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] {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:42:47,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: 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[] {2186#false} is VALID [2022-04-08 02:42:47,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {2186#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2186#false} is VALID [2022-04-08 02:42:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 02:42:47,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:42:47,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {2186#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2186#false} is VALID [2022-04-08 02:42:47,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: 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[] {2186#false} is VALID [2022-04-08 02:42:47,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: 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] {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:42:47,389 INFO L272 TraceCheckUtils]: 31: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:42:47,390 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2185#true} {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 02:42:47,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {2185#true} [85] L12-->L12-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[] {2185#true} is VALID [2022-04-08 02:42:47,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: 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] {2185#true} is VALID [2022-04-08 02:42:47,390 INFO L272 TraceCheckUtils]: 26: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2185#true} is VALID [2022-04-08 02:42:47,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 02:42:47,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 02:42:47,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 02:42:47,397 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2185#true} {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 02:42:47,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {2185#true} [85] L12-->L12-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[] {2185#true} is VALID [2022-04-08 02:42:47,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: 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] {2185#true} is VALID [2022-04-08 02:42:47,397 INFO L272 TraceCheckUtils]: 18: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {2185#true} is VALID [2022-04-08 02:42:47,400 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2185#true} {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 02:42:47,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {2185#true} [85] L12-->L12-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[] {2185#true} is VALID [2022-04-08 02:42:47,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: 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] {2185#true} is VALID [2022-04-08 02:42:47,401 INFO L272 TraceCheckUtils]: 13: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {2185#true} is VALID [2022-04-08 02:42:47,401 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2185#true} {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 02:42:47,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {2185#true} [85] L12-->L12-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[] {2185#true} is VALID [2022-04-08 02:42:47,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: 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] {2185#true} is VALID [2022-04-08 02:42:47,402 INFO L272 TraceCheckUtils]: 8: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2185#true} is VALID [2022-04-08 02:42:47,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 02:42:47,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 02:42:47,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {2185#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 02:42:47,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {2185#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2185#true} {2185#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {2185#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {2185#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2185#true} is VALID [2022-04-08 02:42:47,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {2185#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-08 02:42:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 02:42:47,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:42:47,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316941521] [2022-04-08 02:42:47,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:42:47,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709453292] [2022-04-08 02:42:47,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709453292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 02:42:47,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 02:42:47,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-08 02:42:47,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966065115] [2022-04-08 02:42:47,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 02:42:47,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 35 [2022-04-08 02:42:47,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:42:47,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-08 02:42:47,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:42:47,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 02:42:47,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:42:47,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 02:42:47,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 02:42:47,439 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-08 02:42:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:47,826 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-08 02:42:47,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 02:42:47,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 35 [2022-04-08 02:42:47,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:42:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-08 02:42:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-08 02:42:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-08 02:42:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-08 02:42:47,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-04-08 02:42:47,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:42:47,883 INFO L225 Difference]: With dead ends: 79 [2022-04-08 02:42:47,883 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 02:42:47,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-08 02:42:47,884 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 02:42:47,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 67 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 02:42:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 02:42:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 02:42:47,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:42:47,884 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:42:47,884 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:42:47,884 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:42:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:47,885 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:42:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:42:47,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:47,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:47,885 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:42:47,885 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:42:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:42:47,885 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:42:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:42:47,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:47,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:42:47,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:42:47,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:42:47,885 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:42:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 02:42:47,885 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-08 02:42:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:42:47,886 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 02:42:47,886 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-08 02:42:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:42:47,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:42:47,888 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 02:42:47,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 02:42:48,088 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:42:48,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 02:42:48,346 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 02:42:48,347 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:42:48,347 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:42:48,347 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 02:42:48,347 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-08 02:42:48,347 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:42:48,347 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:42:48,347 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 21 49) the Hoare annotation is: (or (= ~counter~0 0) (not (= |old(~counter~0)| 0))) [2022-04-08 02:42:48,347 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (or (let ((.cse0 (* main_~a~0 2))) (and (= (+ .cse0 (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~t~0 (+ .cse0 1)))) (not (= |old(~counter~0)| 0))) [2022-04-08 02:42:48,347 INFO L878 garLoopResultBuilder]: At program point L30-4(lines 30 42) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 02:42:48,347 INFO L882 garLoopResultBuilder]: For program point L30-1(lines 30 42) no Hoare annotation was computed. [2022-04-08 02:42:48,347 INFO L878 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 02:42:48,347 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 02:42:48,348 INFO L878 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (and (= main_~t~0 1) (= main_~s~0 1)) (not (= |old(~counter~0)| 0))) [2022-04-08 02:42:48,348 INFO L878 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 02:42:48,348 INFO L882 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-08 02:42:48,348 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 02:42:48,348 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 21 49) no Hoare annotation was computed. [2022-04-08 02:42:48,348 INFO L882 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2022-04-08 02:42:48,348 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 21 49) no Hoare annotation was computed. [2022-04-08 02:42:48,348 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-08 02:42:48,348 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-08 02:42:48,348 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-08 02:42:48,348 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-08 02:42:48,348 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-08 02:42:48,348 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-08 02:42:48,351 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-04-08 02:42:48,352 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 02:42:48,357 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:42:48,358 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 02:42:48,358 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:42:48,358 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-08 02:42:48,358 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 02:42:48,358 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 02:42:48,358 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 02:42:48,358 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-08 02:42:48,358 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-08 02:42:48,358 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 02:42:48,358 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 02:42:48,358 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-08 02:42:48,359 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:42:48,359 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:42:48,359 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:42:48,359 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:42:48,359 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:42:48,359 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:42:48,360 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-08 02:42:48,360 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-08 02:42:48,360 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-08 02:42:48,360 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:42:48,360 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 02:42:48,360 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 02:42:48,360 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 02:42:48,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:42:48 BasicIcfg [2022-04-08 02:42:48,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 02:42:48,371 INFO L158 Benchmark]: Toolchain (without parser) took 6773.95ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 125.9MB in the beginning and 185.5MB in the end (delta: -59.6MB). Peak memory consumption was 91.0MB. Max. memory is 8.0GB. [2022-04-08 02:42:48,371 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 02:42:48,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.92ms. Allocated memory is still 177.2MB. Free memory was 125.8MB in the beginning and 152.2MB in the end (delta: -26.4MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-04-08 02:42:48,371 INFO L158 Benchmark]: Boogie Preprocessor took 26.99ms. Allocated memory is still 177.2MB. Free memory was 152.2MB in the beginning and 151.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 02:42:48,371 INFO L158 Benchmark]: RCFGBuilder took 206.94ms. Allocated memory is still 177.2MB. Free memory was 151.1MB in the beginning and 139.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 02:42:48,372 INFO L158 Benchmark]: IcfgTransformer took 18.41ms. Allocated memory is still 177.2MB. Free memory was 139.6MB in the beginning and 138.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 02:42:48,372 INFO L158 Benchmark]: TraceAbstraction took 6309.72ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 137.5MB in the beginning and 185.5MB in the end (delta: -48.0MB). Peak memory consumption was 103.0MB. Max. memory is 8.0GB. [2022-04-08 02:42:48,374 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.09ms. Allocated memory is still 177.2MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.92ms. Allocated memory is still 177.2MB. Free memory was 125.8MB in the beginning and 152.2MB in the end (delta: -26.4MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.99ms. Allocated memory is still 177.2MB. Free memory was 152.2MB in the beginning and 151.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 206.94ms. Allocated memory is still 177.2MB. Free memory was 151.1MB in the beginning and 139.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 18.41ms. Allocated memory is still 177.2MB. Free memory was 139.6MB in the beginning and 138.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 6309.72ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 137.5MB in the beginning and 185.5MB in the end (delta: -48.0MB). Peak memory consumption was 103.0MB. 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: 14]: 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 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 616 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 392 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 426 IncrementalHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 224 mSDtfsCounter, 426 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=7, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 47 PreInvPairs, 76 NumberOfFragments, 203 HoareAnnotationTreeSize, 47 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 879 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 822 SizeOfPredicates, 7 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 149/164 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: 30]: Loop Invariant Derived loop invariant: (a * 2 + a * a + 1 == s && t == a * 2 + 1) || !(\old(counter) == 0) RESULT: Ultimate proved your program to be correct! [2022-04-08 02:42:48,405 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...