/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_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 01:48:00,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 01:48:00,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 01:48:00,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 01:48:00,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 01:48:00,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 01:48:00,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 01:48:00,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 01:48:00,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 01:48:00,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 01:48:00,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 01:48:00,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 01:48:00,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 01:48:00,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 01:48:00,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 01:48:00,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 01:48:00,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 01:48:00,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 01:48:00,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 01:48:00,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 01:48:00,138 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 01:48:00,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 01:48:00,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 01:48:00,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 01:48:00,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 01:48:00,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 01:48:00,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 01:48:00,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 01:48:00,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 01:48:00,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 01:48:00,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 01:48:00,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 01:48:00,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 01:48:00,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 01:48:00,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 01:48:00,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 01:48:00,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 01:48:00,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 01:48:00,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 01:48:00,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 01:48:00,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 01:48:00,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 01:48:00,153 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 01:48:00,172 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 01:48:00,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 01:48:00,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 01:48:00,173 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 01:48:00,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 01:48:00,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 01:48:00,174 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 01:48:00,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 01:48:00,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 01:48:00,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 01:48:00,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 01:48:00,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 01:48:00,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 01:48:00,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 01:48:00,176 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 01:48:00,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 01:48:00,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 01:48:00,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 01:48:00,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 01:48:00,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 01:48:00,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 01:48:00,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 01:48:00,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 01:48:00,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 01:48:00,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 01:48:00,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 01:48:00,177 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 01:48:00,177 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 01:48:00,177 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 01:48:00,178 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-28 01:48:00,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 01:48:00,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 01:48:00,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 01:48:00,377 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 01:48:00,377 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 01:48:00,378 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound2.c [2022-04-28 01:48:00,414 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1c18cf4/af1cbf9bbb964aa5ad70e4699ffc5dba/FLAG9d0229d07 [2022-04-28 01:48:00,730 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 01:48:00,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound2.c [2022-04-28 01:48:00,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1c18cf4/af1cbf9bbb964aa5ad70e4699ffc5dba/FLAG9d0229d07 [2022-04-28 01:48:01,173 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1c18cf4/af1cbf9bbb964aa5ad70e4699ffc5dba [2022-04-28 01:48:01,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 01:48:01,176 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 01:48:01,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 01:48:01,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 01:48:01,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 01:48:01,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:48:01" (1/1) ... [2022-04-28 01:48:01,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e14425e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:48:01, skipping insertion in model container [2022-04-28 01:48:01,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:48:01" (1/1) ... [2022-04-28 01:48:01,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 01:48:01,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 01:48:01,315 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_unwindbound2.c[520,533] [2022-04-28 01:48:01,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 01:48:01,331 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 01:48:01,339 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_unwindbound2.c[520,533] [2022-04-28 01:48:01,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 01:48:01,351 INFO L208 MainTranslator]: Completed translation [2022-04-28 01:48:01,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:48:01 WrapperNode [2022-04-28 01:48:01,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 01:48:01,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 01:48:01,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 01:48:01,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 01:48:01,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:48:01" (1/1) ... [2022-04-28 01:48:01,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:48:01" (1/1) ... [2022-04-28 01:48:01,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:48:01" (1/1) ... [2022-04-28 01:48:01,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:48:01" (1/1) ... [2022-04-28 01:48:01,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:48:01" (1/1) ... [2022-04-28 01:48:01,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:48:01" (1/1) ... [2022-04-28 01:48:01,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:48:01" (1/1) ... [2022-04-28 01:48:01,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 01:48:01,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 01:48:01,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 01:48:01,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 01:48:01,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:48:01" (1/1) ... [2022-04-28 01:48:01,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 01:48:01,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:48:01,390 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-28 01:48:01,394 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-28 01:48:01,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 01:48:01,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 01:48:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 01:48:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 01:48:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 01:48:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 01:48:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 01:48:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 01:48:01,423 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 01:48:01,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 01:48:01,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 01:48:01,423 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 01:48:01,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 01:48:01,423 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 01:48:01,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 01:48:01,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 01:48:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 01:48:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 01:48:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 01:48:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 01:48:01,473 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 01:48:01,475 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 01:48:01,611 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 01:48:01,616 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 01:48:01,616 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 01:48:01,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:48:01 BoogieIcfgContainer [2022-04-28 01:48:01,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 01:48:01,618 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 01:48:01,618 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 01:48:01,619 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 01:48:01,621 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:48:01" (1/1) ... [2022-04-28 01:48:01,622 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 01:48:01,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 01:48:01 BasicIcfg [2022-04-28 01:48:01,660 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 01:48:01,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 01:48:01,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 01:48:01,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 01:48:01,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 01:48:01" (1/4) ... [2022-04-28 01:48:01,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb3ffbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:48:01, skipping insertion in model container [2022-04-28 01:48:01,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:48:01" (2/4) ... [2022-04-28 01:48:01,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb3ffbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:48:01, skipping insertion in model container [2022-04-28 01:48:01,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:48:01" (3/4) ... [2022-04-28 01:48:01,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb3ffbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 01:48:01, skipping insertion in model container [2022-04-28 01:48:01,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 01:48:01" (4/4) ... [2022-04-28 01:48:01,664 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound2.cqvasr [2022-04-28 01:48:01,673 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 01:48:01,673 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 01:48:01,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 01:48:01,724 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3101bb74, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3360f7cb [2022-04-28 01:48:01,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 01:48:01,730 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-28 01:48:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 01:48:01,734 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:48:01,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:48:01,735 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:48:01,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:48:01,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1238828824, now seen corresponding path program 1 times [2022-04-28 01:48:01,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:48:01,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300954577] [2022-04-28 01:48:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:48:01,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:48:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:01,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 01:48:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:01,902 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-28 01:48:01,903 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-28 01:48:01,903 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-28 01:48:01,904 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-28 01:48:01,904 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-28 01:48:01,905 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-28 01:48:01,905 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-28 01:48:01,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-28 01:48:01,905 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-28 01:48:01,906 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-28 01:48:01,906 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-28 01:48:01,906 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-28 01:48:01,906 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-28 01:48:01,906 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-28 01:48:01,907 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-28 01:48:01,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:48:01,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300954577] [2022-04-28 01:48:01,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300954577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:48:01,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:48:01,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 01:48:01,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461896274] [2022-04-28 01:48:01,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:48:01,917 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-28 01:48:01,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:48:01,920 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-28 01:48:01,936 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-28 01:48:01,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 01:48:01,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:48:01,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 01:48:01,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 01:48:01,956 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-28 01:48:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:02,056 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-28 01:48:02,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 01:48:02,058 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-28 01:48:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:48:02,059 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-28 01:48:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 01:48:02,066 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-28 01:48:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 01:48:02,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-28 01:48:02,135 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-28 01:48:02,145 INFO L225 Difference]: With dead ends: 47 [2022-04-28 01:48:02,145 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 01:48:02,148 INFO L412 NwaCegarLoop]: 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-28 01:48:02,152 INFO L413 NwaCegarLoop]: 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-28 01:48:02,154 INFO L414 NwaCegarLoop]: 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-28 01:48:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 01:48:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 01:48:02,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:48:02,182 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-28 01:48:02,183 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-28 01:48:02,183 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-28 01:48:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:02,194 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 01:48:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 01:48:02,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:02,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:02,195 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-28 01:48:02,195 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-28 01:48:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:02,203 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 01:48:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 01:48:02,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:02,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:02,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:48:02,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:48:02,204 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-28 01:48:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-28 01:48:02,207 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-28 01:48:02,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:48:02,207 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-28 01:48:02,207 INFO L496 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-28 01:48:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-28 01:48:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 01:48:02,208 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:48:02,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:48:02,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 01:48:02,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:48:02,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:48:02,209 INFO L85 PathProgramCache]: Analyzing trace with hash -221581531, now seen corresponding path program 1 times [2022-04-28 01:48:02,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:48:02,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457138570] [2022-04-28 01:48:02,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:48:02,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:48:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 01:48:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:02,288 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-28 01:48:02,289 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-28 01:48:02,289 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-28 01:48:02,290 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-28 01:48:02,290 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-28 01:48:02,291 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-28 01:48:02,291 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-28 01:48:02,292 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-28 01:48:02,292 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-28 01:48:02,295 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-28 01:48:02,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#(= |main_#t~post5| 0)} [78] L30-1-->L30-4: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {183#false} is VALID [2022-04-28 01:48:02,297 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-28 01:48:02,297 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-28 01:48:02,297 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-28 01:48:02,298 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-28 01:48:02,298 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-28 01:48:02,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:48:02,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457138570] [2022-04-28 01:48:02,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457138570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:48:02,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:48:02,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 01:48:02,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079130130] [2022-04-28 01:48:02,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:48:02,299 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-28 01:48:02,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:48:02,300 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-28 01:48:02,308 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-28 01:48:02,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 01:48:02,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:48:02,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 01:48:02,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 01:48:02,309 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-28 01:48:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:02,444 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 01:48:02,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 01:48:02,445 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-28 01:48:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:48:02,445 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-28 01:48:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 01:48:02,447 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-28 01:48:02,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 01:48:02,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 01:48:02,478 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-28 01:48:02,479 INFO L225 Difference]: With dead ends: 32 [2022-04-28 01:48:02,479 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 01:48:02,479 INFO L412 NwaCegarLoop]: 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-28 01:48:02,480 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 01:48:02,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 01:48:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 01:48:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 01:48:02,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:48:02,483 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-28 01:48:02,483 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-28 01:48:02,484 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-28 01:48:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:02,485 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 01:48:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 01:48:02,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:02,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:02,486 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-28 01:48:02,486 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-28 01:48:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:02,487 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 01:48:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 01:48:02,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:02,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:02,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:48:02,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:48:02,488 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-28 01:48:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-28 01:48:02,489 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-28 01:48:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:48:02,489 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-28 01:48:02,490 INFO L496 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-28 01:48:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 01:48:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 01:48:02,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:48:02,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:48:02,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 01:48:02,490 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:48:02,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:48:02,491 INFO L85 PathProgramCache]: Analyzing trace with hash -220509055, now seen corresponding path program 1 times [2022-04-28 01:48:02,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:48:02,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155425976] [2022-04-28 01:48:02,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:48:02,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:48:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:02,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 01:48:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:02,562 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-28 01:48:02,562 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-28 01:48:02,562 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-28 01:48:02,563 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-28 01:48:02,563 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-28 01:48:02,563 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-28 01:48:02,563 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-28 01:48:02,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {325#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-28 01:48:02,564 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-28 01:48:02,565 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-28 01:48:02,565 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| 2) 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-28 01:48:02,566 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-28 01:48:02,567 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-28 01:48:02,567 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-28 01:48:02,568 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-28 01:48:02,568 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-28 01:48:02,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:48:02,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155425976] [2022-04-28 01:48:02,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155425976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:48:02,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:48:02,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 01:48:02,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782065408] [2022-04-28 01:48:02,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:48:02,577 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-28 01:48:02,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:48:02,578 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-28 01:48:02,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:48:02,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 01:48:02,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:48:02,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 01:48:02,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 01:48:02,587 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-28 01:48:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:02,866 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 01:48:02,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 01:48:02,866 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-28 01:48:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:48:02,866 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-28 01:48:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 01:48:02,868 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-28 01:48:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 01:48:02,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 01:48:02,908 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-28 01:48:02,910 INFO L225 Difference]: With dead ends: 36 [2022-04-28 01:48:02,910 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 01:48:02,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 01:48:02,911 INFO L413 NwaCegarLoop]: 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-28 01:48:02,911 INFO L414 NwaCegarLoop]: 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-28 01:48:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 01:48:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-28 01:48:02,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:48:02,915 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-28 01:48:02,916 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-28 01:48:02,916 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-28 01:48:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:02,918 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 01:48:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 01:48:02,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:02,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:02,918 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-28 01:48:02,919 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-28 01:48:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:02,920 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 01:48:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 01:48:02,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:02,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:02,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:48:02,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:48:02,921 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-28 01:48:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 01:48:02,923 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-28 01:48:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:48:02,923 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 01:48:02,923 INFO L496 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-28 01:48:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 01:48:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 01:48:02,924 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:48:02,924 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:48:02,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 01:48:02,924 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:48:02,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:48:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1748396925, now seen corresponding path program 1 times [2022-04-28 01:48:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:48:02,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044978545] [2022-04-28 01:48:02,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:48:02,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:48:02,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:48:02,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224481525] [2022-04-28 01:48:02,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:48:02,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:48:02,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:48:02,952 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-28 01:48:02,966 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-28 01:48:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:03,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 01:48:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:03,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:48:03,161 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-28 01:48:03,161 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-28 01:48:03,161 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-28 01:48:03,161 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-28 01:48:03,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {518#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {518#true} is VALID [2022-04-28 01:48:03,164 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-28 01:48:03,164 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-28 01:48:03,180 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| 2) 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-28 01:48:03,180 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-28 01:48:03,180 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-28 01:48:03,180 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-28 01:48:03,181 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-28 01:48:03,181 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-28 01:48:03,182 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-28 01:48:03,182 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-28 01:48:03,182 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-28 01:48:03,183 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-28 01:48:03,183 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-28 01:48:03,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 01:48:03,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:48:03,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044978545] [2022-04-28 01:48:03,183 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:48:03,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224481525] [2022-04-28 01:48:03,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224481525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:48:03,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:48:03,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 01:48:03,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456537512] [2022-04-28 01:48:03,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:48:03,184 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-28 01:48:03,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:48:03,185 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-28 01:48:03,193 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-28 01:48:03,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 01:48:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:48:03,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 01:48:03,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 01:48:03,194 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-28 01:48:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:03,292 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 01:48:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 01:48:03,292 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-28 01:48:03,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:48:03,292 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-28 01:48:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 01:48:03,294 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-28 01:48:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 01:48:03,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 01:48:03,324 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-28 01:48:03,325 INFO L225 Difference]: With dead ends: 40 [2022-04-28 01:48:03,325 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 01:48:03,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 01:48:03,326 INFO L413 NwaCegarLoop]: 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-28 01:48:03,326 INFO L414 NwaCegarLoop]: 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-28 01:48:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 01:48:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-28 01:48:03,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:48:03,331 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-28 01:48:03,331 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-28 01:48:03,331 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-28 01:48:03,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:03,333 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 01:48:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 01:48:03,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:03,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:03,334 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-28 01:48:03,334 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-28 01:48:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:03,335 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 01:48:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 01:48:03,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:03,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:03,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:48:03,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:48:03,336 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-28 01:48:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-28 01:48:03,338 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-28 01:48:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:48:03,338 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-28 01:48:03,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 01:48:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 01:48:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 01:48:03,338 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:48:03,338 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:48:03,371 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-28 01:48:03,555 WARN L477 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-28 01:48:03,556 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:48:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:48:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash -214718627, now seen corresponding path program 1 times [2022-04-28 01:48:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:48:03,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081400947] [2022-04-28 01:48:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:48:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:48:03,566 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:48:03,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581214966] [2022-04-28 01:48:03,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:48:03,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:48:03,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:48:03,576 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-28 01:48:03,577 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-28 01:48:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:03,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 01:48:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:03,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:48:03,739 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-28 01:48:03,739 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-28 01:48:03,740 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-28 01:48:03,740 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-28 01:48:03,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-28 01:48:03,741 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-28 01:48:03,741 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-28 01:48:03,741 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| 2) 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-28 01:48:03,742 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-28 01:48:03,742 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-28 01:48:03,742 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-28 01:48:03,742 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-28 01:48:03,746 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-28 01:48:03,746 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-28 01:48:03,746 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-28 01:48:03,746 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-28 01:48:03,746 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-28 01:48:03,747 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-28 01:48:03,748 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-28 01:48:03,748 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-28 01:48:03,748 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-28 01:48:03,749 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-28 01:48:03,749 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-28 01:48:03,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 01:48:03,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:48:03,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081400947] [2022-04-28 01:48:03,749 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:48:03,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581214966] [2022-04-28 01:48:03,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581214966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:48:03,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:48:03,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 01:48:03,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716748094] [2022-04-28 01:48:03,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:48:03,750 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-28 01:48:03,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:48:03,751 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-28 01:48:03,766 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-28 01:48:03,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 01:48:03,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:48:03,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 01:48:03,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 01:48:03,767 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-28 01:48:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:03,908 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 01:48:03,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 01:48:03,909 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-28 01:48:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:48:03,909 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-28 01:48:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 01:48:03,910 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-28 01:48:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 01:48:03,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 01:48:03,948 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-28 01:48:03,949 INFO L225 Difference]: With dead ends: 44 [2022-04-28 01:48:03,949 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 01:48:03,950 INFO L412 NwaCegarLoop]: 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-28 01:48:03,950 INFO L413 NwaCegarLoop]: 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-28 01:48:03,951 INFO L414 NwaCegarLoop]: 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-28 01:48:03,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 01:48:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 01:48:03,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:48:03,956 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-28 01:48:03,956 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-28 01:48:03,956 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-28 01:48:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:03,958 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 01:48:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 01:48:03,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:03,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:03,959 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-28 01:48:03,959 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-28 01:48:03,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:03,960 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 01:48:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 01:48:03,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:03,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:03,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:48:03,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:48:03,961 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-28 01:48:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-28 01:48:03,962 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-28 01:48:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:48:03,962 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-28 01:48:03,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-28 01:48:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 01:48:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 01:48:03,963 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:48:03,963 INFO L195 NwaCegarLoop]: 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-28 01:48:03,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 01:48:04,177 WARN L477 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-28 01:48:04,177 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:48:04,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:48:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1697115236, now seen corresponding path program 1 times [2022-04-28 01:48:04,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:48:04,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434698481] [2022-04-28 01:48:04,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:48:04,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:48:04,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:48:04,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654632596] [2022-04-28 01:48:04,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:48:04,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:48:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:48:04,189 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-28 01:48:04,190 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-28 01:48:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:04,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 01:48:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:04,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:48:04,360 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-28 01:48:04,361 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-28 01:48:04,361 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-28 01:48:04,361 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-28 01:48:04,362 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-28 01:48:04,363 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-28 01:48:04,364 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-28 01:48:04,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#(<= ~counter~0 1)} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1067#(<= ~counter~0 1)} is VALID [2022-04-28 01:48:04,364 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-28 01:48:04,365 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-28 01:48:04,365 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-28 01:48:04,365 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-28 01:48:04,366 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-28 01:48:04,366 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-28 01:48:04,367 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-28 01:48:04,367 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-28 01:48:04,368 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-28 01:48:04,368 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-28 01:48:04,369 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-28 01:48:04,371 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-28 01:48:04,371 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-28 01:48:04,371 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-28 01:48:04,372 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-28 01:48:04,372 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-28 01:48:04,373 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-28 01:48:04,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {1122#(<= |main_#t~post5| 1)} [78] L30-1-->L30-4: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1044#false} is VALID [2022-04-28 01:48:04,373 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-28 01:48:04,374 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-28 01:48:04,374 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-28 01:48:04,374 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-28 01:48:04,374 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-28 01:48:04,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:48:04,519 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-28 01:48:04,519 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-28 01:48:04,519 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-28 01:48:04,519 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-28 01:48:04,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {1122#(<= |main_#t~post5| 1)} [78] L30-1-->L30-4: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1044#false} is VALID [2022-04-28 01:48:04,521 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-28 01:48:04,521 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-28 01:48:04,527 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1043#true} {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-28 01:48:04,527 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-28 01:48:04,528 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-28 01:48:04,528 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-28 01:48:04,528 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] {1043#true} is VALID [2022-04-28 01:48:04,528 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1043#true} {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-28 01:48:04,528 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-28 01:48:04,528 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-28 01:48:04,529 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-28 01:48:04,529 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] {1043#true} is VALID [2022-04-28 01:48:04,529 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1043#true} {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-28 01:48:04,529 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-28 01:48:04,529 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-28 01:48:04,529 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-28 01:48:04,529 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] {1043#true} is VALID [2022-04-28 01:48:04,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#(<= ~counter~0 1)} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1067#(<= ~counter~0 1)} is VALID [2022-04-28 01:48:04,530 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-28 01:48:04,531 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-28 01:48:04,531 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-28 01:48:04,531 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-28 01:48:04,532 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-28 01:48:04,532 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-28 01:48:04,532 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-28 01:48:04,532 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-28 01:48:04,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:48:04,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434698481] [2022-04-28 01:48:04,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:48:04,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654632596] [2022-04-28 01:48:04,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654632596] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 01:48:04,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 01:48:04,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-28 01:48:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666381686] [2022-04-28 01:48:04,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-28 01:48:04,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 30 [2022-04-28 01:48:04,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:48:04,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 01:48:04,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:48:04,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 01:48:04,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:48:04,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 01:48:04,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 01:48:04,556 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 01:48:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:04,641 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-28 01:48:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 01:48:04,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 30 [2022-04-28 01:48:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:48:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 01:48:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-28 01:48:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 01:48:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-28 01:48:04,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2022-04-28 01:48:04,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:48:04,678 INFO L225 Difference]: With dead ends: 50 [2022-04-28 01:48:04,678 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 01:48:04,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 01:48:04,678 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:48:04,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:48:04,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 01:48:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 01:48:04,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:48:04,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-28 01:48:04,688 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-28 01:48:04,688 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-28 01:48:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:04,689 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-28 01:48:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-28 01:48:04,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:04,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:04,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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 41 states. [2022-04-28 01:48:04,690 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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 41 states. [2022-04-28 01:48:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:04,691 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-28 01:48:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-28 01:48:04,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:04,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:04,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:48:04,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:48:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-28 01:48:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-04-28 01:48:04,693 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2022-04-28 01:48:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:48:04,693 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-04-28 01:48:04,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 01:48:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-28 01:48:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 01:48:04,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:48:04,694 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:48:04,715 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-28 01:48:04,910 WARN L477 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-28 01:48:04,910 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:48:04,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:48:04,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1698187712, now seen corresponding path program 1 times [2022-04-28 01:48:04,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:48:04,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574931959] [2022-04-28 01:48:04,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:48:04,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:48:04,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:48:04,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1780185948] [2022-04-28 01:48:04,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:48:04,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:48:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:48:04,921 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-28 01:48:04,922 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-28 01:48:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:04,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 01:48:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:04,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:48:05,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {1446#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {1446#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] {1446#true} is VALID [2022-04-28 01:48:05,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {1446#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {1446#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {1446#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] {1466#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 01:48:05,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {1466#(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] {1466#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 01:48:05,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {1466#(and (= main_~a~0 0) (= main_~t~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1466#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 01:48:05,072 INFO L272 TraceCheckUtils]: 8: Hoare triple {1466#(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] {1446#true} is VALID [2022-04-28 01:48:05,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {1446#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] {1446#true} is VALID [2022-04-28 01:48:05,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {1446#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[] {1446#true} is VALID [2022-04-28 01:48:05,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {1446#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,073 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1446#true} {1466#(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] {1466#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 01:48:05,073 INFO L272 TraceCheckUtils]: 13: Hoare triple {1466#(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] {1446#true} is VALID [2022-04-28 01:48:05,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {1446#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] {1446#true} is VALID [2022-04-28 01:48:05,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {1446#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[] {1446#true} is VALID [2022-04-28 01:48:05,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {1446#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,074 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1446#true} {1466#(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] {1466#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 01:48:05,074 INFO L272 TraceCheckUtils]: 18: Hoare triple {1466#(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] {1446#true} is VALID [2022-04-28 01:48:05,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {1446#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] {1446#true} is VALID [2022-04-28 01:48:05,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {1446#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[] {1446#true} is VALID [2022-04-28 01:48:05,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {1446#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,075 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1446#true} {1466#(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] {1466#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 01:48:05,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {1466#(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] {1521#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 01:48:05,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {1521#(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] {1521#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 01:48:05,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {1521#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1521#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 01:48:05,077 INFO L272 TraceCheckUtils]: 26: Hoare triple {1521#(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] {1531#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:48:05,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {1531#(<= 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] {1535#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:48:05,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#(<= 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[] {1447#false} is VALID [2022-04-28 01:48:05,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {1447#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1447#false} is VALID [2022-04-28 01:48:05,078 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-28 01:48:05,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:48:05,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {1447#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1447#false} is VALID [2022-04-28 01:48:05,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#(<= 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[] {1447#false} is VALID [2022-04-28 01:48:05,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {1531#(<= 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] {1535#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:48:05,191 INFO L272 TraceCheckUtils]: 26: Hoare triple {1551#(= 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] {1531#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:48:05,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 01:48:05,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {1551#(= 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] {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 01:48:05,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {1551#(= 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] {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 01:48:05,193 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1446#true} {1551#(= 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] {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 01:48:05,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {1446#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {1446#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[] {1446#true} is VALID [2022-04-28 01:48:05,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {1446#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] {1446#true} is VALID [2022-04-28 01:48:05,194 INFO L272 TraceCheckUtils]: 18: Hoare triple {1551#(= 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] {1446#true} is VALID [2022-04-28 01:48:05,200 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1446#true} {1551#(= 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] {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 01:48:05,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {1446#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {1446#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[] {1446#true} is VALID [2022-04-28 01:48:05,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {1446#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] {1446#true} is VALID [2022-04-28 01:48:05,200 INFO L272 TraceCheckUtils]: 13: Hoare triple {1551#(= 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] {1446#true} is VALID [2022-04-28 01:48:05,200 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1446#true} {1551#(= 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] {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 01:48:05,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {1446#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {1446#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[] {1446#true} is VALID [2022-04-28 01:48:05,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {1446#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] {1446#true} is VALID [2022-04-28 01:48:05,201 INFO L272 TraceCheckUtils]: 8: Hoare triple {1551#(= 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] {1446#true} is VALID [2022-04-28 01:48:05,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 01:48:05,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {1551#(= 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] {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 01:48:05,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {1446#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] {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 01:48:05,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {1446#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {1446#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {1446#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] {1446#true} is VALID [2022-04-28 01:48:05,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {1446#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#true} is VALID [2022-04-28 01:48:05,206 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-28 01:48:05,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:48:05,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574931959] [2022-04-28 01:48:05,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:48:05,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780185948] [2022-04-28 01:48:05,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780185948] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 01:48:05,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:48:05,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 01:48:05,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640360045] [2022-04-28 01:48:05,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:48:05,207 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-28 01:48:05,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:48:05,209 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-28 01:48:05,221 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-28 01:48:05,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 01:48:05,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:48:05,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 01:48:05,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 01:48:05,221 INFO L87 Difference]: Start difference. First operand 41 states and 47 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-28 01:48:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:05,325 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-28 01:48:05,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 01:48:05,325 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-28 01:48:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:48:05,326 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-28 01:48:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 01:48:05,326 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-28 01:48:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 01:48:05,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 01:48:05,350 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-28 01:48:05,351 INFO L225 Difference]: With dead ends: 47 [2022-04-28 01:48:05,351 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 01:48:05,351 INFO L412 NwaCegarLoop]: 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-28 01:48:05,351 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:48:05,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:48:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 01:48:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 01:48:05,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:48:05,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 01:48:05,365 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 01:48:05,365 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 01:48:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:05,366 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 01:48:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-28 01:48:05,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:05,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:05,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 45 states. [2022-04-28 01:48:05,367 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 45 states. [2022-04-28 01:48:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:05,368 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 01:48:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-28 01:48:05,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:05,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:05,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:48:05,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:48:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 01:48:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-04-28 01:48:05,370 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 30 [2022-04-28 01:48:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:48:05,370 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-04-28 01:48:05,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-28 01:48:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-28 01:48:05,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 01:48:05,370 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:48:05,370 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:48:05,387 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-28 01:48:05,579 WARN L477 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-28 01:48:05,579 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:48:05,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:48:05,580 INFO L85 PathProgramCache]: Analyzing trace with hash 888200606, now seen corresponding path program 2 times [2022-04-28 01:48:05,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:48:05,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240185364] [2022-04-28 01:48:05,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:48:05,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:48:05,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:48:05,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933624614] [2022-04-28 01:48:05,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 01:48:05,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:48:05,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:48:05,608 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-28 01:48:05,608 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-28 01:48:05,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 01:48:05,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:48:05,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 01:48:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:48:05,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:48:05,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {1858#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {1858#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] {1858#true} is VALID [2022-04-28 01:48:05,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {1858#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1858#true} {1858#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {1858#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {1858#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] {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 01:48:05,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {1878#(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] {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 01:48:05,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 01:48:05,803 INFO L272 TraceCheckUtils]: 8: Hoare triple {1878#(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] {1858#true} is VALID [2022-04-28 01:48:05,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {1858#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] {1858#true} is VALID [2022-04-28 01:48:05,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {1858#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[] {1858#true} is VALID [2022-04-28 01:48:05,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {1858#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,803 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1858#true} {1878#(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] {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 01:48:05,804 INFO L272 TraceCheckUtils]: 13: Hoare triple {1878#(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] {1858#true} is VALID [2022-04-28 01:48:05,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {1858#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] {1858#true} is VALID [2022-04-28 01:48:05,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {1858#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[] {1858#true} is VALID [2022-04-28 01:48:05,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {1858#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,804 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1858#true} {1878#(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] {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 01:48:05,804 INFO L272 TraceCheckUtils]: 18: Hoare triple {1878#(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] {1858#true} is VALID [2022-04-28 01:48:05,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {1858#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] {1858#true} is VALID [2022-04-28 01:48:05,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {1858#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[] {1858#true} is VALID [2022-04-28 01:48:05,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {1858#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,805 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1858#true} {1878#(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] {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 01:48:05,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {1878#(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] {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-28 01:48:05,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {1933#(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] {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-28 01:48:05,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-28 01:48:05,808 INFO L272 TraceCheckUtils]: 26: Hoare triple {1933#(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] {1858#true} is VALID [2022-04-28 01:48:05,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {1858#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] {1858#true} is VALID [2022-04-28 01:48:05,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {1858#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[] {1858#true} is VALID [2022-04-28 01:48:05,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {1858#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,808 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1858#true} {1933#(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] {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-28 01:48:05,809 INFO L272 TraceCheckUtils]: 31: Hoare triple {1933#(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] {1958#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:48:05,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {1958#(<= 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] {1962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:48:05,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {1962#(<= 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[] {1859#false} is VALID [2022-04-28 01:48:05,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {1859#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1859#false} is VALID [2022-04-28 01:48:05,810 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-28 01:48:05,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:48:05,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {1859#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1859#false} is VALID [2022-04-28 01:48:05,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {1962#(<= 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[] {1859#false} is VALID [2022-04-28 01:48:05,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {1958#(<= 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] {1962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:48:05,945 INFO L272 TraceCheckUtils]: 31: Hoare triple {1978#(= (+ (* 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] {1958#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:48:05,945 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1858#true} {1978#(= (+ (* 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] {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 01:48:05,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {1858#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {1858#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[] {1858#true} is VALID [2022-04-28 01:48:05,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {1858#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] {1858#true} is VALID [2022-04-28 01:48:05,949 INFO L272 TraceCheckUtils]: 26: Hoare triple {1978#(= (+ (* 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] {1858#true} is VALID [2022-04-28 01:48:05,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 01:48:05,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#(= (+ (* 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] {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 01:48:05,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {2003#(= (+ (* (+ 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] {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 01:48:05,982 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1858#true} {2003#(= (+ (* (+ 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] {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 01:48:05,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {1858#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {1858#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[] {1858#true} is VALID [2022-04-28 01:48:05,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {1858#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] {1858#true} is VALID [2022-04-28 01:48:05,983 INFO L272 TraceCheckUtils]: 18: Hoare triple {2003#(= (+ (* (+ 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] {1858#true} is VALID [2022-04-28 01:48:05,983 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1858#true} {2003#(= (+ (* (+ 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] {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 01:48:05,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {1858#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {1858#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[] {1858#true} is VALID [2022-04-28 01:48:05,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {1858#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] {1858#true} is VALID [2022-04-28 01:48:05,984 INFO L272 TraceCheckUtils]: 13: Hoare triple {2003#(= (+ (* (+ 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] {1858#true} is VALID [2022-04-28 01:48:05,984 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1858#true} {2003#(= (+ (* (+ 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] {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 01:48:05,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {1858#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {1858#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[] {1858#true} is VALID [2022-04-28 01:48:05,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {1858#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] {1858#true} is VALID [2022-04-28 01:48:05,984 INFO L272 TraceCheckUtils]: 8: Hoare triple {2003#(= (+ (* (+ 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] {1858#true} is VALID [2022-04-28 01:48:05,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {2003#(= (+ (* (+ 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| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 01:48:05,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {2003#(= (+ (* (+ 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] {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 01:48:05,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {1858#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] {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 01:48:05,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {1858#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1858#true} {1858#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {1858#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {1858#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] {1858#true} is VALID [2022-04-28 01:48:05,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {1858#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#true} is VALID [2022-04-28 01:48:05,986 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-28 01:48:05,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:48:05,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240185364] [2022-04-28 01:48:05,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:48:05,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933624614] [2022-04-28 01:48:05,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933624614] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 01:48:05,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 01:48:05,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 01:48:05,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977002779] [2022-04-28 01:48:05,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-28 01:48:05,987 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-28 01:48:05,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:48:05,988 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-28 01:48:06,018 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-28 01:48:06,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 01:48:06,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:48:06,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 01:48:06,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 01:48:06,019 INFO L87 Difference]: Start difference. First operand 45 states and 50 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-28 01:48:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:06,395 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-28 01:48:06,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 01:48:06,395 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-28 01:48:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:48:06,396 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-28 01:48:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-28 01:48:06,397 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-28 01:48:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-28 01:48:06,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-04-28 01:48:06,448 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-28 01:48:06,448 INFO L225 Difference]: With dead ends: 52 [2022-04-28 01:48:06,448 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 01:48:06,449 INFO L412 NwaCegarLoop]: 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-28 01:48:06,449 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 01:48:06,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 62 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 01:48:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 01:48:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 01:48:06,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:48:06,450 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-28 01:48:06,450 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-28 01:48:06,450 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-28 01:48:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:06,450 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 01:48:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 01:48:06,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:06,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:06,450 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-28 01:48:06,450 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-28 01:48:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:48:06,450 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 01:48:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 01:48:06,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:06,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:48:06,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:48:06,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:48:06,451 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-28 01:48:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 01:48:06,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-28 01:48:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:48:06,451 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 01:48:06,451 INFO L496 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-28 01:48:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 01:48:06,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:48:06,453 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 01:48:06,473 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-28 01:48:06,662 WARN L477 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-28 01:48:06,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 01:48:06,860 INFO L895 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-28 01:48:06,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-28 01:48:06,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-28 01:48:06,861 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 01:48:06,861 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-28 01:48:06,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-28 01:48:06,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-28 01:48:06,861 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 21 49) the Hoare annotation is: (or (= ~counter~0 0) (not (= |old(~counter~0)| 0))) [2022-04-28 01:48:06,861 INFO L895 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-28 01:48:06,861 INFO L895 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-28 01:48:06,861 INFO L899 garLoopResultBuilder]: For program point L30-1(lines 30 42) no Hoare annotation was computed. [2022-04-28 01:48:06,861 INFO L895 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-28 01:48:06,861 INFO L895 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-28 01:48:06,861 INFO L895 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-28 01:48:06,861 INFO L895 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-28 01:48:06,861 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-28 01:48:06,861 INFO L895 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-28 01:48:06,861 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 21 49) no Hoare annotation was computed. [2022-04-28 01:48:06,862 INFO L899 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2022-04-28 01:48:06,862 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 21 49) no Hoare annotation was computed. [2022-04-28 01:48:06,862 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 01:48:06,862 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-28 01:48:06,862 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-28 01:48:06,862 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-28 01:48:06,862 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-28 01:48:06,862 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-28 01:48:06,864 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-04-28 01:48:06,865 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 01:48:06,869 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 01:48:06,870 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 01:48:06,870 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 01:48:06,870 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-28 01:48:06,870 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 01:48:06,870 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 01:48:06,870 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 01:48:06,870 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-28 01:48:06,870 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-28 01:48:06,870 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 01:48:06,870 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 01:48:06,870 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 01:48:06,871 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 01:48:06,871 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 01:48:06,871 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 01:48:06,871 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 01:48:06,871 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 01:48:06,871 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 01:48:06,871 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-28 01:48:06,871 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-28 01:48:06,871 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-28 01:48:06,872 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 01:48:06,872 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 01:48:06,872 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 01:48:06,872 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-28 01:48:06,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 01:48:06 BasicIcfg [2022-04-28 01:48:06,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 01:48:06,879 INFO L158 Benchmark]: Toolchain (without parser) took 5703.37ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 143.9MB in the beginning and 106.6MB in the end (delta: 37.2MB). Peak memory consumption was 77.0MB. Max. memory is 8.0GB. [2022-04-28 01:48:06,879 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 194.0MB. Free memory is still 160.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 01:48:06,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.94ms. Allocated memory is still 194.0MB. Free memory was 143.9MB in the beginning and 171.9MB in the end (delta: -28.0MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-04-28 01:48:06,880 INFO L158 Benchmark]: Boogie Preprocessor took 16.89ms. Allocated memory is still 194.0MB. Free memory was 171.9MB in the beginning and 170.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 01:48:06,880 INFO L158 Benchmark]: RCFGBuilder took 246.50ms. Allocated memory is still 194.0MB. Free memory was 170.3MB in the beginning and 159.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 01:48:06,880 INFO L158 Benchmark]: IcfgTransformer took 41.52ms. Allocated memory is still 194.0MB. Free memory was 159.7MB in the beginning and 158.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 01:48:06,880 INFO L158 Benchmark]: TraceAbstraction took 5217.91ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 157.6MB in the beginning and 106.6MB in the end (delta: 51.0MB). Peak memory consumption was 91.4MB. Max. memory is 8.0GB. [2022-04-28 01:48:06,881 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.08ms. Allocated memory is still 194.0MB. Free memory is still 160.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 173.94ms. Allocated memory is still 194.0MB. Free memory was 143.9MB in the beginning and 171.9MB in the end (delta: -28.0MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.89ms. Allocated memory is still 194.0MB. Free memory was 171.9MB in the beginning and 170.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 246.50ms. Allocated memory is still 194.0MB. Free memory was 170.3MB in the beginning and 159.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 41.52ms. Allocated memory is still 194.0MB. Free memory was 159.7MB in the beginning and 158.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5217.91ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 157.6MB in the beginning and 106.6MB in the end (delta: 51.0MB). Peak memory consumption was 91.4MB. 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: 5.2s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 536 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 321 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 215 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 41 PreInvPairs, 62 NumberOfFragments, 203 HoareAnnotationTreeSize, 41 FomulaSimplifications, 26 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 535 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s 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-28 01:48:06,894 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...