/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/loops/sum01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:07:04,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:07:04,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:07:04,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:07:04,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:07:04,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:07:04,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:07:04,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:07:04,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:07:04,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:07:04,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:07:04,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:07:04,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:07:04,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:07:04,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:07:04,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:07:04,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:07:04,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:07:04,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:07:04,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:07:04,420 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:07:04,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:07:04,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:07:04,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:07:04,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:07:04,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:07:04,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:07:04,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:07:04,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:07:04,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:07:04,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:07:04,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:07:04,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:07:04,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:07:04,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:07:04,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:07:04,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:07:04,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:07:04,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:07:04,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:07:04,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:07:04,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:07:04,435 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:07:04,456 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:07:04,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:07:04,457 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:07:04,457 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:07:04,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:07:04,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:07:04,458 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:07:04,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:07:04,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:07:04,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:07:04,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:07:04,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:07:04,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:07:04,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:07:04,459 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:07:04,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:07:04,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:07:04,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:07:04,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:07:04,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:07:04,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:07:04,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:07:04,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:07:04,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:07:04,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:07:04,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:07:04,461 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:07:04,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:07:04,461 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:07:04,461 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-27 21:07:04,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:07:04,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:07:04,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:07:04,649 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:07:04,650 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:07:04,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-2.i [2022-04-27 21:07:04,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327380c7f/217177a48ef243b7bf1c26e1d79e484f/FLAG8bd1d12c1 [2022-04-27 21:07:05,133 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:07:05,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i [2022-04-27 21:07:05,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327380c7f/217177a48ef243b7bf1c26e1d79e484f/FLAG8bd1d12c1 [2022-04-27 21:07:05,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327380c7f/217177a48ef243b7bf1c26e1d79e484f [2022-04-27 21:07:05,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:07:05,164 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:07:05,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:07:05,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:07:05,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:07:05,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:07:05" (1/1) ... [2022-04-27 21:07:05,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e97ba5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:07:05, skipping insertion in model container [2022-04-27 21:07:05,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:07:05" (1/1) ... [2022-04-27 21:07:05,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:07:05,190 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:07:05,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i[849,862] [2022-04-27 21:07:05,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:07:05,348 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:07:05,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i[849,862] [2022-04-27 21:07:05,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:07:05,368 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:07:05,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:07:05 WrapperNode [2022-04-27 21:07:05,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:07:05,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:07:05,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:07:05,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:07:05,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:07:05" (1/1) ... [2022-04-27 21:07:05,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:07:05" (1/1) ... [2022-04-27 21:07:05,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:07:05" (1/1) ... [2022-04-27 21:07:05,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:07:05" (1/1) ... [2022-04-27 21:07:05,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:07:05" (1/1) ... [2022-04-27 21:07:05,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:07:05" (1/1) ... [2022-04-27 21:07:05,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:07:05" (1/1) ... [2022-04-27 21:07:05,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:07:05,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:07:05,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:07:05,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:07:05,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:07:05" (1/1) ... [2022-04-27 21:07:05,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:07:05,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:07:05,421 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-27 21:07:05,425 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-27 21:07:05,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:07:05,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:07:05,447 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:07:05,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:07:05,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:07:05,448 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:07:05,448 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:07:05,448 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:07:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:07:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:07:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:07:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:07:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:07:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:07:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:07:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:07:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:07:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:07:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:07:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:07:05,492 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:07:05,494 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:07:05,590 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:07:05,595 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:07:05,595 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:07:05,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:07:05 BoogieIcfgContainer [2022-04-27 21:07:05,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:07:05,597 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:07:05,597 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:07:05,599 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:07:05,601 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:07:05" (1/1) ... [2022-04-27 21:07:05,603 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:07:05,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:07:05 BasicIcfg [2022-04-27 21:07:05,620 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:07:05,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:07:05,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:07:05,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:07:05,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:07:05" (1/4) ... [2022-04-27 21:07:05,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4bd58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:07:05, skipping insertion in model container [2022-04-27 21:07:05,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:07:05" (2/4) ... [2022-04-27 21:07:05,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4bd58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:07:05, skipping insertion in model container [2022-04-27 21:07:05,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:07:05" (3/4) ... [2022-04-27 21:07:05,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4bd58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:07:05, skipping insertion in model container [2022-04-27 21:07:05,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:07:05" (4/4) ... [2022-04-27 21:07:05,626 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-2.iqvasr [2022-04-27 21:07:05,649 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:07:05,650 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:07:05,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:07:05,717 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73a98ab4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4e3d9b2a [2022-04-27 21:07:05,717 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:07:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:07:05,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:07:05,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:07:05,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:07:05,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:07:05,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:07:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash 797277979, now seen corresponding path program 1 times [2022-04-27 21:07:05,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:07:05,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355306323] [2022-04-27 21:07:05,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:07:05,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:07:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:07:05,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:07:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:07:05,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (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] {23#true} is VALID [2022-04-27 21:07:05,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:07:05,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:07:05,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:07:05,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (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] {23#true} is VALID [2022-04-27 21:07:05,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:07:05,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:07:05,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:07:05,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {23#true} is VALID [2022-04-27 21:07:05,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {23#true} is VALID [2022-04-27 21:07:05,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [58] L25-3-->L25-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 21:07:05,926 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {24#false} is VALID [2022-04-27 21:07:05,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-27 21:07:05,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 21:07:05,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 21:07:05,926 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-27 21:07:05,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:07:05,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355306323] [2022-04-27 21:07:05,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355306323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:07:05,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:07:05,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:07:05,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492476384] [2022-04-27 21:07:05,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:07:05,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:07:05,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:07:05,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:05,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:07:05,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:07:05,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:07:05,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:07:05,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:07:05,984 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:07:06,049 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-27 21:07:06,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:07:06,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:07:06,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:07:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 21:07:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 21:07:06,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-27 21:07:06,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:07:06,112 INFO L225 Difference]: With dead ends: 31 [2022-04-27 21:07:06,112 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 21:07:06,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:07:06,119 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:07:06,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:07:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 21:07:06,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 21:07:06,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:07:06,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,145 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,145 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:07:06,149 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:07:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:07:06,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:07:06,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:07:06,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 21:07:06,150 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 21:07:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:07:06,152 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:07:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:07:06,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:07:06,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:07:06,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:07:06,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:07:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 21:07:06,156 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 21:07:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:07:06,159 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 21:07:06,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:07:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:07:06,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:07:06,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:07:06,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:07:06,160 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:07:06,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:07:06,161 INFO L85 PathProgramCache]: Analyzing trace with hash 798201500, now seen corresponding path program 1 times [2022-04-27 21:07:06,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:07:06,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694502062] [2022-04-27 21:07:06,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:07:06,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:07:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:07:06,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:07:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:07:06,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (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] {120#true} is VALID [2022-04-27 21:07:06,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-27 21:07:06,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120#true} {120#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-27 21:07:06,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {120#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:07:06,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (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] {120#true} is VALID [2022-04-27 21:07:06,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-27 21:07:06,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-27 21:07:06,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {120#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-27 21:07:06,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 21:07:06,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 21:07:06,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 21:07:06,259 INFO L272 TraceCheckUtils]: 8: Hoare triple {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {126#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:07:06,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {126#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {127#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:07:06,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {127#(not (= __VERIFIER_assert_~cond 0))} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {121#false} is VALID [2022-04-27 21:07:06,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {121#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#false} is VALID [2022-04-27 21:07:06,260 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-27 21:07:06,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:07:06,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694502062] [2022-04-27 21:07:06,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694502062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:07:06,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:07:06,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:07:06,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308193198] [2022-04-27 21:07:06,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:07:06,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:07:06,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:07:06,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:07:06,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:07:06,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:07:06,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:07:06,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:07:06,272 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:07:06,356 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 21:07:06,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:07:06,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:07:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:07:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-27 21:07:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-27 21:07:06,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-27 21:07:06,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:07:06,375 INFO L225 Difference]: With dead ends: 20 [2022-04-27 21:07:06,375 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 21:07:06,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 21:07:06,376 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:07:06,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 27 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:07:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 21:07:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 21:07:06,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:07:06,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,379 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,379 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:07:06,380 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 21:07:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:07:06,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:07:06,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:07:06,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 21:07:06,381 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 21:07:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:07:06,382 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 21:07:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:07:06,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:07:06,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:07:06,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:07:06,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:07:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 21:07:06,383 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-27 21:07:06,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:07:06,383 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 21:07:06,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:07:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:07:06,384 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:07:06,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:07:06,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:07:06,384 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:07:06,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:07:06,384 INFO L85 PathProgramCache]: Analyzing trace with hash -815155942, now seen corresponding path program 1 times [2022-04-27 21:07:06,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:07:06,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121957258] [2022-04-27 21:07:06,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:07:06,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:07:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:07:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:07:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:07:06,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (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] {220#true} is VALID [2022-04-27 21:07:06,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-27 21:07:06,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-27 21:07:06,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {220#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:07:06,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (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] {220#true} is VALID [2022-04-27 21:07:06,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-27 21:07:06,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-27 21:07:06,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {220#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-27 21:07:06,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {225#(= main_~sn~0 0)} is VALID [2022-04-27 21:07:06,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {225#(= main_~sn~0 0)} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {226#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 21:07:06,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {227#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-27 21:07:06,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {227#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {228#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 21:07:06,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {229#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 21:07:06,519 INFO L272 TraceCheckUtils]: 10: Hoare triple {229#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:07:06,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {231#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:07:06,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {231#(not (= __VERIFIER_assert_~cond 0))} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {221#false} is VALID [2022-04-27 21:07:06,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {221#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {221#false} is VALID [2022-04-27 21:07:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:07:06,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:07:06,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121957258] [2022-04-27 21:07:06,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121957258] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:07:06,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380469263] [2022-04-27 21:07:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:07:06,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:07:06,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:07:06,522 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-27 21:07:06,523 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-27 21:07:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:07:06,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 21:07:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:07:06,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:07:06,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {220#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-27 21:07:06,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#true} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (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] {220#true} is VALID [2022-04-27 21:07:06,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-27 21:07:06,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-27 21:07:06,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {220#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-27 21:07:06,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {225#(= main_~sn~0 0)} is VALID [2022-04-27 21:07:06,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {225#(= main_~sn~0 0)} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {226#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 21:07:06,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {257#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-27 21:07:06,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {261#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-27 21:07:06,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {265#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-27 21:07:06,793 INFO L272 TraceCheckUtils]: 10: Hoare triple {265#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {269#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:07:06,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {269#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {273#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:07:06,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {273#(<= 1 __VERIFIER_assert_~cond)} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {221#false} is VALID [2022-04-27 21:07:06,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {221#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {221#false} is VALID [2022-04-27 21:07:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:07:06,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:07:07,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {221#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {221#false} is VALID [2022-04-27 21:07:07,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {273#(<= 1 __VERIFIER_assert_~cond)} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {221#false} is VALID [2022-04-27 21:07:07,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {269#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {273#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:07:07,047 INFO L272 TraceCheckUtils]: 10: Hoare triple {289#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {269#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:07:07,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {289#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 21:07:07,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {293#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 21:07:07,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {297#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 21:07:07,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#(or (and (<= 2 (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 1)) (= (+ 2 main_~sn~0) 0))} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {301#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 21:07:07,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {305#(or (and (<= 2 (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 1)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 21:07:07,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {220#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-27 21:07:07,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-27 21:07:07,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-27 21:07:07,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#true} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (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] {220#true} is VALID [2022-04-27 21:07:07,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {220#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-27 21:07:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:07:07,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380469263] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:07:07,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:07:07,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-27 21:07:07,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182517652] [2022-04-27 21:07:07,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:07:07,052 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:07:07,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:07:07,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:07,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:07:07,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 21:07:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:07:07,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 21:07:07,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-27 21:07:07,072 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:07:07,505 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-27 21:07:07,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 21:07:07,506 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:07:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:07:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2022-04-27 21:07:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2022-04-27 21:07:07,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 26 transitions. [2022-04-27 21:07:07,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:07:07,532 INFO L225 Difference]: With dead ends: 25 [2022-04-27 21:07:07,533 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 21:07:07,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2022-04-27 21:07:07,535 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:07:07,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 67 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:07:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 21:07:07,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-27 21:07:07,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:07:07,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:07,543 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:07,543 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:07:07,545 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 21:07:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 21:07:07,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:07:07,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:07:07,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-27 21:07:07,546 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-27 21:07:07,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:07:07,548 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 21:07:07,548 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 21:07:07,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:07:07,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:07:07,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:07:07,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:07:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-27 21:07:07,553 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2022-04-27 21:07:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:07:07,553 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-27 21:07:07,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 21:07:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:07:07,555 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:07:07,555 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:07:07,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 21:07:07,765 WARN L477 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-27 21:07:07,766 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:07:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:07:07,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1152965526, now seen corresponding path program 2 times [2022-04-27 21:07:07,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:07:07,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750664216] [2022-04-27 21:07:07,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:07:07,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:07:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:07:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:07:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:07:07,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {466#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (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] {451#true} is VALID [2022-04-27 21:07:07,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-27 21:07:07,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {451#true} {451#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-27 21:07:07,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {451#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:07:07,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (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] {451#true} is VALID [2022-04-27 21:07:07,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {451#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-27 21:07:07,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {451#true} {451#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-27 21:07:07,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {451#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-27 21:07:07,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {451#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {456#(= main_~sn~0 0)} is VALID [2022-04-27 21:07:07,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {456#(= main_~sn~0 0)} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {457#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 21:07:07,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {458#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-27 21:07:07,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {459#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-27 21:07:07,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {460#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-27 21:07:07,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {459#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-27 21:07:07,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {461#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 21:07:07,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {461#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {462#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 21:07:07,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {462#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {463#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 21:07:07,962 INFO L272 TraceCheckUtils]: 14: Hoare triple {463#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {464#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:07:07,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {464#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {465#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:07:07,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {465#(not (= __VERIFIER_assert_~cond 0))} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {452#false} is VALID [2022-04-27 21:07:07,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {452#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#false} is VALID [2022-04-27 21:07:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 21:07:07,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:07:07,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750664216] [2022-04-27 21:07:07,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750664216] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:07:07,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012450022] [2022-04-27 21:07:07,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:07:07,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:07:07,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:07:07,980 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-27 21:07:08,007 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-27 21:07:08,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:07:08,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:07:08,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 21:07:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:07:08,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:07:08,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {451#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-27 21:07:08,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#true} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (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] {451#true} is VALID [2022-04-27 21:07:08,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {451#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-27 21:07:08,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {451#true} {451#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-27 21:07:08,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {451#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-27 21:07:08,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {451#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {456#(= main_~sn~0 0)} is VALID [2022-04-27 21:07:08,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {456#(= main_~sn~0 0)} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {457#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 21:07:08,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {458#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-27 21:07:08,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {494#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 21:07:08,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {494#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {498#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-27 21:07:08,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {498#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {502#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ main_~i~0 (- 3)) 0))} is VALID [2022-04-27 21:07:08,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ main_~i~0 (- 3)) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {506#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 (- 3)) 0) (<= main_~sn~0 6))} is VALID [2022-04-27 21:07:08,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {506#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 (- 3)) 0) (<= main_~sn~0 6))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {510#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2022-04-27 21:07:08,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {510#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {514#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} is VALID [2022-04-27 21:07:08,413 INFO L272 TraceCheckUtils]: 14: Hoare triple {514#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {518#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:07:08,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {518#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {522#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:07:08,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {522#(<= 1 __VERIFIER_assert_~cond)} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {452#false} is VALID [2022-04-27 21:07:08,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {452#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#false} is VALID [2022-04-27 21:07:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:07:08,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:07:08,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {452#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#false} is VALID [2022-04-27 21:07:08,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {522#(<= 1 __VERIFIER_assert_~cond)} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {452#false} is VALID [2022-04-27 21:07:08,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {518#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {522#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:07:08,814 INFO L272 TraceCheckUtils]: 14: Hoare triple {538#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {518#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:07:08,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {542#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {538#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 21:07:08,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {546#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {542#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 21:07:08,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {550#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {546#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 21:07:08,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {554#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {550#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 21:07:08,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {558#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {554#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 21:07:08,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {562#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {558#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 21:07:08,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {566#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {562#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 21:07:08,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {570#(or (= (+ 6 main_~sn~0) 0) (and (<= 4 (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2))) (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) 3)))} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {566#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-27 21:07:08,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {451#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {570#(or (= (+ 6 main_~sn~0) 0) (and (<= 4 (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2))) (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) 3)))} is VALID [2022-04-27 21:07:08,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {451#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-27 21:07:08,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {451#true} {451#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-27 21:07:08,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {451#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-27 21:07:08,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#true} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (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] {451#true} is VALID [2022-04-27 21:07:08,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {451#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-27 21:07:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:07:08,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012450022] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:07:08,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:07:08,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-04-27 21:07:08,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960548463] [2022-04-27 21:07:08,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:07:08,853 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 21:07:08,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:07:08,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:08,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:07:08,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 21:07:08,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:07:08,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 21:07:08,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2022-04-27 21:07:08,884 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:07:09,578 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 21:07:09,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 21:07:09,578 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 21:07:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:07:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-04-27 21:07:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:09,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-04-27 21:07:09,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 23 transitions. [2022-04-27 21:07:09,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:07:09,604 INFO L225 Difference]: With dead ends: 22 [2022-04-27 21:07:09,604 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:07:09,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=1617, Unknown=0, NotChecked=0, Total=1892 [2022-04-27 21:07:09,605 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:07:09,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 100 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:07:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:07:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:07:09,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:07:09,607 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-27 21:07:09,607 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-27 21:07:09,607 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-27 21:07:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:07:09,607 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:07:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:07:09,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:07:09,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:07:09,607 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-27 21:07:09,607 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-27 21:07:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:07:09,607 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:07:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:07:09,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:07:09,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:07:09,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:07:09,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:07:09,608 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-27 21:07:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:07:09,608 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-27 21:07:09,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:07:09,608 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:07:09,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:07:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:07:09,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:07:09,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:07:09,641 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-27 21:07:09,823 WARN L477 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-27 21:07:09,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:07:09,883 INFO L895 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-27 21:07:09,883 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:07:09,883 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:07:09,883 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:07:09,883 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:07:09,884 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:07:09,884 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:07:09,884 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 29) the Hoare annotation is: true [2022-04-27 21:07:09,884 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2022-04-27 21:07:09,884 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 22 29) no Hoare annotation was computed. [2022-04-27 21:07:09,884 INFO L895 garLoopResultBuilder]: At program point L25-3(lines 25 27) the Hoare annotation is: (or (and (= main_~sn~0 0) (= main_~i~0 1)) (let ((.cse1 (+ 2 main_~sn~0)) (.cse0 (* main_~i~0 2))) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= .cse0 .cse1) (<= .cse1 .cse0)))) [2022-04-27 21:07:09,885 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 22 29) no Hoare annotation was computed. [2022-04-27 21:07:09,885 INFO L895 garLoopResultBuilder]: At program point L25-4(lines 25 27) the Hoare annotation is: (or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0)) [2022-04-27 21:07:09,885 INFO L899 garLoopResultBuilder]: For program point L25-2(lines 25 27) no Hoare annotation was computed. [2022-04-27 21:07:09,885 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 20) the Hoare annotation is: true [2022-04-27 21:07:09,885 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2022-04-27 21:07:09,885 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2022-04-27 21:07:09,885 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 20) no Hoare annotation was computed. [2022-04-27 21:07:09,885 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-27 21:07:09,885 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 20) no Hoare annotation was computed. [2022-04-27 21:07:09,887 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-27 21:07:09,888 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:07:09,896 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:07:09,896 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 21:07:09,896 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 21:07:09,896 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:07:09,896 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 21:07:09,896 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 21:07:09,896 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 21:07:09,896 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 21:07:09,896 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:07:09,896 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:07:09,898 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-27 21:07:09,898 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 21:07:09,898 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 21:07:09,898 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 21:07:09,898 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:07:09,899 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-27 21:07:09,899 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:07:09,899 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:07:09,899 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:07:09,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:07:09 BasicIcfg [2022-04-27 21:07:09,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:07:09,913 INFO L158 Benchmark]: Toolchain (without parser) took 4749.42ms. Allocated memory was 183.5MB in the beginning and 261.1MB in the end (delta: 77.6MB). Free memory was 126.7MB in the beginning and 141.4MB in the end (delta: -14.6MB). Peak memory consumption was 62.8MB. Max. memory is 8.0GB. [2022-04-27 21:07:09,914 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 183.5MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:07:09,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.32ms. Allocated memory was 183.5MB in the beginning and 261.1MB in the end (delta: 77.6MB). Free memory was 126.5MB in the beginning and 232.4MB in the end (delta: -105.9MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. [2022-04-27 21:07:09,914 INFO L158 Benchmark]: Boogie Preprocessor took 20.26ms. Allocated memory is still 261.1MB. Free memory was 232.4MB in the beginning and 230.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:07:09,914 INFO L158 Benchmark]: RCFGBuilder took 198.76ms. Allocated memory is still 261.1MB. Free memory was 230.8MB in the beginning and 218.8MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 21:07:09,915 INFO L158 Benchmark]: IcfgTransformer took 23.74ms. Allocated memory is still 261.1MB. Free memory was 218.8MB in the beginning and 217.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:07:09,915 INFO L158 Benchmark]: TraceAbstraction took 4291.21ms. Allocated memory is still 261.1MB. Free memory was 216.7MB in the beginning and 141.4MB in the end (delta: 75.3MB). Peak memory consumption was 75.8MB. Max. memory is 8.0GB. [2022-04-27 21:07:09,916 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 183.5MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.32ms. Allocated memory was 183.5MB in the beginning and 261.1MB in the end (delta: 77.6MB). Free memory was 126.5MB in the beginning and 232.4MB in the end (delta: -105.9MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.26ms. Allocated memory is still 261.1MB. Free memory was 232.4MB in the beginning and 230.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 198.76ms. Allocated memory is still 261.1MB. Free memory was 230.8MB in the beginning and 218.8MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 23.74ms. Allocated memory is still 261.1MB. Free memory was 218.8MB in the beginning and 217.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4291.21ms. Allocated memory is still 261.1MB. Free memory was 216.7MB in the beginning and 141.4MB in the end (delta: 75.3MB). Peak memory consumption was 75.8MB. 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: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 321 IncrementalHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 48 mSDtfsCounter, 321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 20 NumberOfFragments, 50 HoareAnnotationTreeSize, 12 FomulaSimplifications, 23 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 138 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 780 SizeOfPredicates, 6 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1/30 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: 25]: Loop Invariant Derived loop invariant: (sn == 0 && i == 1) || ((sn < n * 2 + 1 && i * 2 <= 2 + sn) && 2 + sn <= i * 2) RESULT: Ultimate proved your program to be correct! [2022-04-27 21:07:09,945 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...