/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_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 02:43:01,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 02:43:01,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 02:43:01,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 02:43:01,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 02:43:01,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 02:43:01,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 02:43:01,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 02:43:01,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 02:43:01,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 02:43:01,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 02:43:01,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 02:43:01,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 02:43:01,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 02:43:01,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 02:43:01,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 02:43:01,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 02:43:01,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 02:43:01,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 02:43:01,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 02:43:01,170 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 02:43:01,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 02:43:01,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 02:43:01,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 02:43:01,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 02:43:01,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 02:43:01,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 02:43:01,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 02:43:01,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 02:43:01,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 02:43:01,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 02:43:01,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 02:43:01,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 02:43:01,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 02:43:01,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 02:43:01,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 02:43:01,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 02:43:01,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 02:43:01,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 02:43:01,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 02:43:01,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 02:43:01,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 02:43:01,189 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 02:43:01,216 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 02:43:01,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 02:43:01,217 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 02:43:01,217 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 02:43:01,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 02:43:01,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 02:43:01,218 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 02:43:01,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 02:43:01,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 02:43:01,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 02:43:01,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 02:43:01,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 02:43:01,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 02:43:01,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 02:43:01,220 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 02:43:01,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 02:43:01,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 02:43:01,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 02:43:01,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 02:43:01,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:43:01,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 02:43:01,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 02:43:01,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 02:43:01,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 02:43:01,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 02:43:01,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 02:43:01,222 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 02:43:01,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 02:43:01,223 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 02:43:01,223 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 02:43:01,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 02:43:01,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 02:43:01,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 02:43:01,453 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 02:43:01,453 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 02:43:01,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c [2022-04-08 02:43:01,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b83f2d21/1e685ded28554ca3b0a16c34de2c804c/FLAG7c8619258 [2022-04-08 02:43:01,842 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 02:43:01,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c [2022-04-08 02:43:01,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b83f2d21/1e685ded28554ca3b0a16c34de2c804c/FLAG7c8619258 [2022-04-08 02:43:02,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b83f2d21/1e685ded28554ca3b0a16c34de2c804c [2022-04-08 02:43:02,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 02:43:02,287 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 02:43:02,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 02:43:02,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 02:43:02,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 02:43:02,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:43:02" (1/1) ... [2022-04-08 02:43:02,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2337d490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:43:02, skipping insertion in model container [2022-04-08 02:43:02,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:43:02" (1/1) ... [2022-04-08 02:43:02,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 02:43:02,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 02:43:02,444 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_valuebound100.c[520,533] [2022-04-08 02:43:02,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:43:02,460 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 02:43:02,468 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_valuebound100.c[520,533] [2022-04-08 02:43:02,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:43:02,484 INFO L208 MainTranslator]: Completed translation [2022-04-08 02:43:02,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:43:02 WrapperNode [2022-04-08 02:43:02,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 02:43:02,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 02:43:02,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 02:43:02,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 02:43:02,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:43:02" (1/1) ... [2022-04-08 02:43:02,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:43:02" (1/1) ... [2022-04-08 02:43:02,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:43:02" (1/1) ... [2022-04-08 02:43:02,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:43:02" (1/1) ... [2022-04-08 02:43:02,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:43:02" (1/1) ... [2022-04-08 02:43:02,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:43:02" (1/1) ... [2022-04-08 02:43:02,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:43:02" (1/1) ... [2022-04-08 02:43:02,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 02:43:02,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 02:43:02,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 02:43:02,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 02:43:02,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:43:02" (1/1) ... [2022-04-08 02:43:02,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:43:02,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:43:02,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 02:43:02,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 02:43:02,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 02:43:02,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 02:43:02,576 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 02:43:02,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 02:43:02,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 02:43:02,576 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 02:43:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 02:43:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 02:43:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 02:43:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 02:43:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 02:43:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 02:43:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 02:43:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 02:43:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 02:43:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 02:43:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 02:43:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 02:43:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 02:43:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 02:43:02,638 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 02:43:02,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 02:43:02,781 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 02:43:02,786 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 02:43:02,786 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 02:43:02,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:43:02 BoogieIcfgContainer [2022-04-08 02:43:02,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 02:43:02,788 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 02:43:02,788 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 02:43:02,804 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 02:43:02,806 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:43:02" (1/1) ... [2022-04-08 02:43:02,807 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 02:43:02,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:43:02 BasicIcfg [2022-04-08 02:43:02,843 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 02:43:02,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 02:43:02,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 02:43:02,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 02:43:02,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:43:02" (1/4) ... [2022-04-08 02:43:02,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e710c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:43:02, skipping insertion in model container [2022-04-08 02:43:02,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:43:02" (2/4) ... [2022-04-08 02:43:02,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e710c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:43:02, skipping insertion in model container [2022-04-08 02:43:02,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:43:02" (3/4) ... [2022-04-08 02:43:02,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e710c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:43:02, skipping insertion in model container [2022-04-08 02:43:02,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:43:02" (4/4) ... [2022-04-08 02:43:02,851 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound100.cqvasr [2022-04-08 02:43:02,860 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 02:43:02,860 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 02:43:02,899 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 02:43:02,909 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 02:43:02,909 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 02:43:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 02:43:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 02:43:02,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:43:02,930 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:43:02,930 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:43:02,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:43:02,938 INFO L85 PathProgramCache]: Analyzing trace with hash -179702132, now seen corresponding path program 1 times [2022-04-08 02:43:02,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:43:02,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008284301] [2022-04-08 02:43:02,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:43:02,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:43:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:43:03,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:43:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:43:03,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID [2022-04-08 02:43:03,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-08 02:43:03,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-08 02:43:03,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 02:43:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:43:03,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-08 02:43:03,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [84] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-08 02:43:03,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-08 02:43:03,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-08 02:43:03,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:43:03,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID [2022-04-08 02:43:03,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-08 02:43:03,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-08 02:43:03,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-08 02:43:03,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) 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] {34#true} is VALID [2022-04-08 02:43:03,079 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {34#true} is VALID [2022-04-08 02:43:03,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-08 02:43:03,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} [84] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-08 02:43:03,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-08 02:43:03,080 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-08 02:43:03,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {35#false} is VALID [2022-04-08 02:43:03,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} [81] L30-2-->L30-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-08 02:43:03,080 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} [86] L30-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_11 (+ (* 2 v_main_~a~0_11) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {35#false} is VALID [2022-04-08 02:43:03,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} [90] __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] {35#false} is VALID [2022-04-08 02:43:03,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} [93] 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[] {35#false} is VALID [2022-04-08 02:43:03,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-08 02:43:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:43:03,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:43:03,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008284301] [2022-04-08 02:43:03,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008284301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:43:03,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:43:03,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 02:43:03,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749420631] [2022-04-08 02:43:03,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:43:03,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 02:43:03,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:43:03,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 02:43:03,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:43:03,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 02:43:03,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:43:03,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 02:43:03,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 02:43:03,125 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 02:43:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:03,245 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-08 02:43:03,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 02:43:03,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 02:43:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:43:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 02:43:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-08 02:43:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 02:43:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-08 02:43:03,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-08 02:43:03,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:43:03,386 INFO L225 Difference]: With dead ends: 53 [2022-04-08 02:43:03,386 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 02:43:03,389 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 02:43:03,391 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:43:03,392 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:43:03,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 02:43:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 02:43:03,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:43:03,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:43:03,422 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:43:03,422 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:43:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:03,426 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-08 02:43:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 02:43:03,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:43:03,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:43:03,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-08 02:43:03,428 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-08 02:43:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:03,446 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-08 02:43:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 02:43:03,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:43:03,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:43:03,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:43:03,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:43:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:43:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-08 02:43:03,453 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-08 02:43:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:43:03,453 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-08 02:43:03,453 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 02:43:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 02:43:03,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 02:43:03,454 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:43:03,454 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:43:03,454 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 02:43:03,454 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:43:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:43:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1985279762, now seen corresponding path program 1 times [2022-04-08 02:43:03,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:43:03,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994250485] [2022-04-08 02:43:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:43:03,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:43:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:43:03,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:43:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:43:03,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {213#true} is VALID [2022-04-08 02:43:03,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-08 02:43:03,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {213#true} {213#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-08 02:43:03,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 02:43:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:43:03,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {213#true} is VALID [2022-04-08 02:43:03,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-08 02:43:03,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-08 02:43:03,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {213#true} is VALID [2022-04-08 02:43:03,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {213#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:43:03,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {213#true} is VALID [2022-04-08 02:43:03,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-08 02:43:03,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-08 02:43:03,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {213#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-08 02:43:03,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {213#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) 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] {213#true} is VALID [2022-04-08 02:43:03,616 INFO L272 TraceCheckUtils]: 6: Hoare triple {213#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {213#true} is VALID [2022-04-08 02:43:03,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {213#true} is VALID [2022-04-08 02:43:03,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {213#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-08 02:43:03,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-08 02:43:03,616 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {213#true} {213#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {213#true} is VALID [2022-04-08 02:43:03,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 02:43:03,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 02:43:03,627 INFO L272 TraceCheckUtils]: 13: Hoare triple {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {223#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:43:03,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {223#(not (= |__VERIFIER_assert_#in~cond| 0))} [90] __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] {224#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 02:43:03,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#(not (= __VERIFIER_assert_~cond 0))} [93] 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[] {214#false} is VALID [2022-04-08 02:43:03,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {214#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#false} is VALID [2022-04-08 02:43:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:43:03,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:43:03,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994250485] [2022-04-08 02:43:03,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994250485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:43:03,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:43:03,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 02:43:03,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504822379] [2022-04-08 02:43:03,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:43:03,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 02:43:03,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:43:03,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 02:43:03,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:43:03,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 02:43:03,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:43:03,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 02:43:03,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 02:43:03,654 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 02:43:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:04,037 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 02:43:04,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 02:43:04,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 02:43:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:43:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 02:43:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-08 02:43:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 02:43:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-08 02:43:04,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-08 02:43:04,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:43:04,097 INFO L225 Difference]: With dead ends: 40 [2022-04-08 02:43:04,097 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 02:43:04,099 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-08 02:43:04,102 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:43:04,102 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:43:04,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 02:43:04,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-08 02:43:04,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:43:04,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 02:43:04,114 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 02:43:04,114 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 02:43:04,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:04,117 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 02:43:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 02:43:04,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:43:04,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:43:04,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-08 02:43:04,118 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-08 02:43:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:04,121 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 02:43:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 02:43:04,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:43:04,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:43:04,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:43:04,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:43:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 02:43:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-08 02:43:04,124 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-08 02:43:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:43:04,124 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-08 02:43:04,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 02:43:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-08 02:43:04,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 02:43:04,125 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:43:04,125 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:43:04,125 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 02:43:04,126 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:43:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:43:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1146988413, now seen corresponding path program 1 times [2022-04-08 02:43:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:43:04,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445653603] [2022-04-08 02:43:04,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:43:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:43:04,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:43:04,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [249235596] [2022-04-08 02:43:04,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:43:04,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:43:04,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:43:04,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:43:04,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 02:43:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:43:04,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 02:43:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:43:04,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:43:04,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {430#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-08 02:43:04,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#true} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {430#true} is VALID [2022-04-08 02:43:04,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-08 02:43:04,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {430#true} {430#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-08 02:43:04,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {430#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-08 02:43:04,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {430#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) 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] {430#true} is VALID [2022-04-08 02:43:04,403 INFO L272 TraceCheckUtils]: 6: Hoare triple {430#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {430#true} is VALID [2022-04-08 02:43:04,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {430#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {430#true} is VALID [2022-04-08 02:43:04,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-08 02:43:04,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {430#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-08 02:43:04,403 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {430#true} {430#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {430#true} is VALID [2022-04-08 02:43:04,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {430#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 02:43:04,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 02:43:04,406 INFO L272 TraceCheckUtils]: 13: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {430#true} is VALID [2022-04-08 02:43:04,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {430#true} [90] __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] {430#true} is VALID [2022-04-08 02:43:04,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {430#true} [94] 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[] {430#true} is VALID [2022-04-08 02:43:04,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {430#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-08 02:43:04,407 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {430#true} {468#(and (= main_~a~0 0) (= main_~s~0 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 02:43:04,407 INFO L272 TraceCheckUtils]: 18: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {490#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:43:04,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __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] {494#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:43:04,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {494#(<= 1 __VERIFIER_assert_~cond)} [93] 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[] {431#false} is VALID [2022-04-08 02:43:04,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {431#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {431#false} is VALID [2022-04-08 02:43:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:43:04,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 02:43:04,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:43:04,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445653603] [2022-04-08 02:43:04,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:43:04,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249235596] [2022-04-08 02:43:04,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249235596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:43:04,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:43:04,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 02:43:04,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019021743] [2022-04-08 02:43:04,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:43:04,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 02:43:04,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:43:04,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:43:04,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:43:04,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:43:04,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:43:04,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:43:04,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:43:04,424 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:43:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:04,558 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 02:43:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:43:04,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 02:43:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:43:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:43:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 02:43:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:43:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 02:43:04,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-08 02:43:04,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:43:04,625 INFO L225 Difference]: With dead ends: 44 [2022-04-08 02:43:04,625 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 02:43:04,625 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 02:43:04,626 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:43:04,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:43:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 02:43:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-08 02:43:04,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:43:04,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 02:43:04,639 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 02:43:04,639 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 02:43:04,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:04,641 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 02:43:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-08 02:43:04,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:43:04,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:43:04,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-08 02:43:04,643 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-08 02:43:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:04,645 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 02:43:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-08 02:43:04,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:43:04,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:43:04,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:43:04,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:43:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 02:43:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-08 02:43:04,648 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-08 02:43:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:43:04,648 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-08 02:43:04,648 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:43:04,648 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-08 02:43:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 02:43:04,649 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:43:04,649 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:43:04,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 02:43:04,849 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:43:04,850 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:43:04,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:43:04,850 INFO L85 PathProgramCache]: Analyzing trace with hash -88951989, now seen corresponding path program 1 times [2022-04-08 02:43:04,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:43:04,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107701413] [2022-04-08 02:43:04,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:43:04,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:43:04,860 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:43:04,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784410003] [2022-04-08 02:43:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:43:04,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:43:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:43:04,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:43:04,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 02:43:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:43:04,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 02:43:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:43:04,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:43:05,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {716#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-08 02:43:05,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {716#true} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {716#true} is VALID [2022-04-08 02:43:05,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {716#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-08 02:43:05,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {716#true} {716#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-08 02:43:05,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {716#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-08 02:43:05,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {716#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) 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] {716#true} is VALID [2022-04-08 02:43:05,040 INFO L272 TraceCheckUtils]: 6: Hoare triple {716#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {716#true} is VALID [2022-04-08 02:43:05,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {716#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {716#true} is VALID [2022-04-08 02:43:05,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {716#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-08 02:43:05,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {716#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-08 02:43:05,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {716#true} {716#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {716#true} is VALID [2022-04-08 02:43:05,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {716#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:43:05,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:43:05,050 INFO L272 TraceCheckUtils]: 13: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {716#true} is VALID [2022-04-08 02:43:05,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {716#true} [90] __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] {716#true} is VALID [2022-04-08 02:43:05,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#true} [94] 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[] {716#true} is VALID [2022-04-08 02:43:05,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-08 02:43:05,051 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {716#true} {754#(and (= main_~t~0 1) (= main_~s~0 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:43:05,052 INFO L272 TraceCheckUtils]: 18: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {716#true} is VALID [2022-04-08 02:43:05,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {716#true} [90] __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] {716#true} is VALID [2022-04-08 02:43:05,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {716#true} [94] 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[] {716#true} is VALID [2022-04-08 02:43:05,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {716#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-08 02:43:05,054 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {716#true} {754#(and (= main_~t~0 1) (= main_~s~0 1))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:43:05,055 INFO L272 TraceCheckUtils]: 23: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:43:05,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __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] {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:43:05,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} [93] 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[] {717#false} is VALID [2022-04-08 02:43:05,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {717#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-08 02:43:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 02:43:05,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 02:43:05,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:43:05,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107701413] [2022-04-08 02:43:05,058 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:43:05,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784410003] [2022-04-08 02:43:05,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784410003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:43:05,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:43:05,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 02:43:05,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468247713] [2022-04-08 02:43:05,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:43:05,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-08 02:43:05,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:43:05,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:43:05,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:43:05,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:43:05,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:43:05,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:43:05,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:43:05,080 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:43:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:05,208 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-08 02:43:05,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:43:05,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-08 02:43:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:43:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:43:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 02:43:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:43:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 02:43:05,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-08 02:43:05,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:43:05,250 INFO L225 Difference]: With dead ends: 48 [2022-04-08 02:43:05,250 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 02:43:05,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 02:43:05,251 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:43:05,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:43:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 02:43:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 02:43:05,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:43:05,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:43:05,257 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:43:05,258 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:43:05,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:05,259 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-08 02:43:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 02:43:05,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:43:05,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:43:05,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-08 02:43:05,260 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-08 02:43:05,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:05,262 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-08 02:43:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 02:43:05,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:43:05,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:43:05,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:43:05,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:43:05,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:43:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-08 02:43:05,264 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-08 02:43:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:43:05,264 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-08 02:43:05,265 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:43:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 02:43:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 02:43:05,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:43:05,265 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:43:05,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 02:43:05,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 02:43:05,486 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:43:05,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:43:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash 196845204, now seen corresponding path program 1 times [2022-04-08 02:43:05,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:43:05,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264611265] [2022-04-08 02:43:05,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:43:05,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:43:05,496 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:43:05,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1770313756] [2022-04-08 02:43:05,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:43:05,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:43:05,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:43:05,497 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:43:05,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 02:43:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:43:05,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 02:43:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:43:05,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:43:05,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#true} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1025#true} is VALID [2022-04-08 02:43:05,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) 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] {1025#true} is VALID [2022-04-08 02:43:05,695 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1025#true} is VALID [2022-04-08 02:43:05,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1025#true} is VALID [2022-04-08 02:43:05,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {1025#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {1025#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,696 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1025#true} {1025#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1025#true} is VALID [2022-04-08 02:43:05,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {1025#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 02:43:05,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 02:43:05,699 INFO L272 TraceCheckUtils]: 13: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1025#true} is VALID [2022-04-08 02:43:05,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} [90] __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] {1025#true} is VALID [2022-04-08 02:43:05,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} [94] 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[] {1025#true} is VALID [2022-04-08 02:43:05,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,700 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 02:43:05,701 INFO L272 TraceCheckUtils]: 18: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1025#true} is VALID [2022-04-08 02:43:05,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} [90] __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] {1025#true} is VALID [2022-04-08 02:43:05,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} [94] 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[] {1025#true} is VALID [2022-04-08 02:43:05,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {1025#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,703 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 02:43:05,703 INFO L272 TraceCheckUtils]: 23: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1025#true} is VALID [2022-04-08 02:43:05,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {1025#true} [90] __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] {1025#true} is VALID [2022-04-08 02:43:05,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} [94] 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[] {1025#true} is VALID [2022-04-08 02:43:05,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,704 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} [107] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 02:43:05,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} [101] L33-->L30-2: Formula: (and (= v_main_~t~0_7 (+ v_main_~t~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) (<= v_main_~s~0_9 v_main_~n~0_6) (= (+ v_main_~s~0_9 v_main_~t~0_7) v_main_~s~0_8)) InVars {main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~t~0=v_main_~t~0_7, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 02:43:05,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 02:43:05,706 INFO L272 TraceCheckUtils]: 30: Hoare triple {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:43:05,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __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] {1126#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:43:05,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {1126#(<= 1 __VERIFIER_assert_~cond)} [93] 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[] {1026#false} is VALID [2022-04-08 02:43:05,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {1026#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1026#false} is VALID [2022-04-08 02:43:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 02:43:05,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:43:05,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {1026#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1026#false} is VALID [2022-04-08 02:43:05,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {1126#(<= 1 __VERIFIER_assert_~cond)} [93] 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[] {1026#false} is VALID [2022-04-08 02:43:05,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __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] {1126#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:43:05,853 INFO L272 TraceCheckUtils]: 30: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:43:05,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:43:05,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} [101] L33-->L30-2: Formula: (and (= v_main_~t~0_7 (+ v_main_~t~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) (<= v_main_~s~0_9 v_main_~n~0_6) (= (+ v_main_~s~0_9 v_main_~t~0_7) v_main_~s~0_8)) InVars {main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~t~0=v_main_~t~0_7, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:43:05,854 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} [107] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:43:05,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} [94] 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[] {1025#true} is VALID [2022-04-08 02:43:05,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {1025#true} [90] __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] {1025#true} is VALID [2022-04-08 02:43:05,854 INFO L272 TraceCheckUtils]: 23: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1025#true} is VALID [2022-04-08 02:43:05,855 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:43:05,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {1025#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} [94] 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[] {1025#true} is VALID [2022-04-08 02:43:05,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} [90] __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] {1025#true} is VALID [2022-04-08 02:43:05,855 INFO L272 TraceCheckUtils]: 18: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1025#true} is VALID [2022-04-08 02:43:05,856 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:43:05,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} [94] 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[] {1025#true} is VALID [2022-04-08 02:43:05,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} [90] __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] {1025#true} is VALID [2022-04-08 02:43:05,856 INFO L272 TraceCheckUtils]: 13: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1025#true} is VALID [2022-04-08 02:43:05,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:43:05,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {1025#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 02:43:05,857 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1025#true} {1025#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1025#true} is VALID [2022-04-08 02:43:05,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {1025#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {1025#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1025#true} is VALID [2022-04-08 02:43:05,858 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1025#true} is VALID [2022-04-08 02:43:05,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) 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] {1025#true} is VALID [2022-04-08 02:43:05,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#true} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1025#true} is VALID [2022-04-08 02:43:05,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#true} is VALID [2022-04-08 02:43:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 02:43:05,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:43:05,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264611265] [2022-04-08 02:43:05,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:43:05,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770313756] [2022-04-08 02:43:05,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770313756] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 02:43:05,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:43:05,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 02:43:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052236142] [2022-04-08 02:43:05,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:43:05,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 02:43:05,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:43:05,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 02:43:05,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:43:05,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:43:05,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:43:05,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:43:05,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 02:43:05,880 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 02:43:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:05,994 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-08 02:43:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:43:05,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 02:43:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:43:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 02:43:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 02:43:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 02:43:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 02:43:05,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-08 02:43:06,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:43:06,022 INFO L225 Difference]: With dead ends: 49 [2022-04-08 02:43:06,022 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 02:43:06,022 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 02:43:06,023 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:43:06,023 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:43:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 02:43:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 02:43:06,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:43:06,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:43:06,030 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:43:06,031 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:43:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:06,032 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-08 02:43:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 02:43:06,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:43:06,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:43:06,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-08 02:43:06,042 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-08 02:43:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:06,046 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-08 02:43:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 02:43:06,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:43:06,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:43:06,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:43:06,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:43:06,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:43:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-08 02:43:06,049 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2022-04-08 02:43:06,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:43:06,049 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-08 02:43:06,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 02:43:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 02:43:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 02:43:06,051 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:43:06,051 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:43:06,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 02:43:06,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:43:06,268 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:43:06,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:43:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash -374953577, now seen corresponding path program 2 times [2022-04-08 02:43:06,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:43:06,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176952616] [2022-04-08 02:43:06,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:43:06,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:43:06,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:43:06,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [123962880] [2022-04-08 02:43:06,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 02:43:06,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:43:06,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:43:06,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:43:06,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 02:43:06,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 02:43:06,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:43:06,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 02:43:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:43:06,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:43:06,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1471#true} is VALID [2022-04-08 02:43:06,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) 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] {1471#true} is VALID [2022-04-08 02:43:06,556 INFO L272 TraceCheckUtils]: 6: Hoare triple {1471#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1471#true} is VALID [2022-04-08 02:43:06,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1471#true} is VALID [2022-04-08 02:43:06,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,557 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1471#true} {1471#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1471#true} is VALID [2022-04-08 02:43:06,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {1471#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:43:06,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:43:06,558 INFO L272 TraceCheckUtils]: 13: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1471#true} is VALID [2022-04-08 02:43:06,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {1471#true} [90] __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] {1471#true} is VALID [2022-04-08 02:43:06,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {1471#true} [94] 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[] {1471#true} is VALID [2022-04-08 02:43:06,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {1471#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,560 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:43:06,560 INFO L272 TraceCheckUtils]: 18: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1471#true} is VALID [2022-04-08 02:43:06,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {1471#true} [90] __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] {1471#true} is VALID [2022-04-08 02:43:06,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {1471#true} [94] 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[] {1471#true} is VALID [2022-04-08 02:43:06,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {1471#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,563 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:43:06,564 INFO L272 TraceCheckUtils]: 23: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1471#true} is VALID [2022-04-08 02:43:06,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {1471#true} [90] __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] {1471#true} is VALID [2022-04-08 02:43:06,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {1471#true} [94] 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[] {1471#true} is VALID [2022-04-08 02:43:06,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {1471#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,564 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [107] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 02:43:06,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [101] L33-->L30-2: Formula: (and (= v_main_~t~0_7 (+ v_main_~t~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) (<= v_main_~s~0_9 v_main_~n~0_6) (= (+ v_main_~s~0_9 v_main_~t~0_7) v_main_~s~0_8)) InVars {main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~t~0=v_main_~t~0_7, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 02:43:06,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 02:43:06,565 INFO L272 TraceCheckUtils]: 30: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1471#true} is VALID [2022-04-08 02:43:06,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {1471#true} [90] __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] {1471#true} is VALID [2022-04-08 02:43:06,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {1471#true} [94] 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[] {1471#true} is VALID [2022-04-08 02:43:06,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {1471#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,566 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1471#true} {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 02:43:06,567 INFO L272 TraceCheckUtils]: 35: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:43:06,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __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] {1587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:43:06,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {1587#(<= 1 __VERIFIER_assert_~cond)} [93] 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[] {1472#false} is VALID [2022-04-08 02:43:06,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {1472#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1472#false} is VALID [2022-04-08 02:43:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 02:43:06,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:43:06,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {1472#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1472#false} is VALID [2022-04-08 02:43:06,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {1587#(<= 1 __VERIFIER_assert_~cond)} [93] 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[] {1472#false} is VALID [2022-04-08 02:43:06,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __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] {1587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:43:06,714 INFO L272 TraceCheckUtils]: 35: Hoare triple {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:43:06,715 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1471#true} {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 02:43:06,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {1471#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {1471#true} [94] 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[] {1471#true} is VALID [2022-04-08 02:43:06,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {1471#true} [90] __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] {1471#true} is VALID [2022-04-08 02:43:06,715 INFO L272 TraceCheckUtils]: 30: Hoare triple {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1471#true} is VALID [2022-04-08 02:43:06,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 02:43:06,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [101] L33-->L30-2: Formula: (and (= v_main_~t~0_7 (+ v_main_~t~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) (<= v_main_~s~0_9 v_main_~n~0_6) (= (+ v_main_~s~0_9 v_main_~t~0_7) v_main_~s~0_8)) InVars {main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~t~0=v_main_~t~0_7, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 02:43:06,894 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [107] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 02:43:06,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {1471#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {1471#true} [94] 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[] {1471#true} is VALID [2022-04-08 02:43:06,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {1471#true} [90] __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] {1471#true} is VALID [2022-04-08 02:43:06,894 INFO L272 TraceCheckUtils]: 23: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1471#true} is VALID [2022-04-08 02:43:06,895 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 02:43:06,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {1471#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {1471#true} [94] 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[] {1471#true} is VALID [2022-04-08 02:43:06,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {1471#true} [90] __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] {1471#true} is VALID [2022-04-08 02:43:06,895 INFO L272 TraceCheckUtils]: 18: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1471#true} is VALID [2022-04-08 02:43:06,897 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 02:43:06,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {1471#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {1471#true} [94] 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[] {1471#true} is VALID [2022-04-08 02:43:06,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {1471#true} [90] __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] {1471#true} is VALID [2022-04-08 02:43:06,897 INFO L272 TraceCheckUtils]: 13: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1471#true} is VALID [2022-04-08 02:43:06,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 02:43:06,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {1471#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 02:43:06,898 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1471#true} {1471#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1471#true} is VALID [2022-04-08 02:43:06,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1471#true} is VALID [2022-04-08 02:43:06,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {1471#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1471#true} is VALID [2022-04-08 02:43:06,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) 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] {1471#true} is VALID [2022-04-08 02:43:06,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1471#true} is VALID [2022-04-08 02:43:06,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-08 02:43:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 02:43:06,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:43:06,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176952616] [2022-04-08 02:43:06,899 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:43:06,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123962880] [2022-04-08 02:43:06,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123962880] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 02:43:06,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 02:43:06,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-08 02:43:06,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544404685] [2022-04-08 02:43:06,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 02:43:06,900 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-08 02:43:06,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:43:06,900 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-08 02:43:06,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:43:06,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 02:43:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:43:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 02:43:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 02:43:06,932 INFO L87 Difference]: Start difference. First operand 47 states and 51 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-08 02:43:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:07,367 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-08 02:43:07,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 02:43:07,367 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-08 02:43:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:43:07,367 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-08 02:43:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-08 02:43:07,369 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-08 02:43:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-08 02:43:07,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-04-08 02:43:07,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:43:07,432 INFO L225 Difference]: With dead ends: 55 [2022-04-08 02:43:07,432 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 02:43:07,432 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-08 02:43:07,433 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 02:43:07,433 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 98 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 02:43:07,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 02:43:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 02:43:07,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:43:07,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 02:43:07,433 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 02:43:07,433 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 02:43:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:07,434 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:43:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:43:07,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:43:07,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:43:07,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 02:43:07,434 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 02:43:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:43:07,434 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:43:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:43:07,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:43:07,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:43:07,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:43:07,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:43:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 02:43:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 02:43:07,434 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-04-08 02:43:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:43:07,435 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 02:43:07,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-08 02:43:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:43:07,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:43:07,437 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 02:43:07,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 02:43:07,653 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:43:07,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 02:43:07,795 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 02:43:07,796 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:43:07,796 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:43:07,796 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 02:43:07,796 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 02:43:07,796 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:43:07,796 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:43:07,796 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-08 02:43:07,796 INFO L882 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-08 02:43:07,796 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-08 02:43:07,796 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-08 02:43:07,796 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-08 02:43:07,796 INFO L885 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-08 02:43:07,796 INFO L882 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-04-08 02:43:07,796 INFO L878 garLoopResultBuilder]: At program point L30-2(lines 30 42) the Hoare annotation is: (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))) [2022-04-08 02:43:07,796 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (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))) [2022-04-08 02:43:07,797 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (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))) [2022-04-08 02:43:07,797 INFO L878 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (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))) [2022-04-08 02:43:07,797 INFO L878 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (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))) [2022-04-08 02:43:07,797 INFO L878 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (and (= main_~t~0 1) (= main_~s~0 1))) [2022-04-08 02:43:07,797 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (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))) [2022-04-08 02:43:07,797 INFO L882 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-08 02:43:07,797 INFO L882 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2022-04-08 02:43:07,797 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2022-04-08 02:43:07,797 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2022-04-08 02:43:07,797 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-08 02:43:07,797 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-08 02:43:07,797 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-08 02:43:07,797 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-08 02:43:07,797 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-08 02:43:07,798 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-08 02:43:07,800 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-08 02:43:07,801 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 02:43:07,809 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:43:07,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:43:07,811 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-08 02:43:07,811 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-08 02:43:07,811 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-08 02:43:07,811 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-08 02:43:07,812 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:43:07,812 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 02:43:07,812 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 02:43:07,812 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 02:43:07,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:43:07 BasicIcfg [2022-04-08 02:43:07,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 02:43:07,837 INFO L158 Benchmark]: Toolchain (without parser) took 5550.10ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 128.4MB in the beginning and 156.9MB in the end (delta: -28.6MB). Peak memory consumption was 31.6MB. Max. memory is 8.0GB. [2022-04-08 02:43:07,838 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 02:43:07,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.66ms. Allocated memory is still 178.3MB. Free memory was 128.2MB in the beginning and 156.6MB in the end (delta: -28.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 02:43:07,838 INFO L158 Benchmark]: Boogie Preprocessor took 27.24ms. Allocated memory is still 178.3MB. Free memory was 156.6MB in the beginning and 155.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 02:43:07,838 INFO L158 Benchmark]: RCFGBuilder took 271.78ms. Allocated memory is still 178.3MB. Free memory was 154.8MB in the beginning and 144.0MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 02:43:07,838 INFO L158 Benchmark]: IcfgTransformer took 55.76ms. Allocated memory is still 178.3MB. Free memory was 144.0MB in the beginning and 142.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 02:43:07,839 INFO L158 Benchmark]: TraceAbstraction took 4991.15ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 141.9MB in the beginning and 156.9MB in the end (delta: -15.0MB). Peak memory consumption was 44.5MB. Max. memory is 8.0GB. [2022-04-08 02:43:07,840 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.66ms. Allocated memory is still 178.3MB. Free memory was 128.2MB in the beginning and 156.6MB in the end (delta: -28.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.24ms. Allocated memory is still 178.3MB. Free memory was 156.6MB in the beginning and 155.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 271.78ms. Allocated memory is still 178.3MB. Free memory was 154.8MB in the beginning and 144.0MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 55.76ms. Allocated memory is still 178.3MB. Free memory was 144.0MB in the beginning and 142.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4991.15ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 141.9MB in the beginning and 156.9MB in the end (delta: -15.0MB). Peak memory consumption was 44.5MB. 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 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 457 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 353 IncrementalHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 168 mSDtfsCounter, 353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=5, InterpolantAutomatonStates: 32, 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, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 37 PreInvPairs, 58 NumberOfFragments, 161 HoareAnnotationTreeSize, 37 FomulaSimplifications, 4 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 476 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 603 SizeOfPredicates, 5 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 112/120 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: t + s == a * 4 + 2 + a * a && t == a * 2 + 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 02:43:07,858 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...