/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/array-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 21:59:20,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 21:59:20,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 21:59:20,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 21:59:20,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 21:59:20,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 21:59:20,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 21:59:20,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 21:59:20,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 21:59:20,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 21:59:20,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 21:59:20,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 21:59:20,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 21:59:20,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 21:59:20,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 21:59:20,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 21:59:20,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 21:59:20,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 21:59:20,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 21:59:20,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 21:59:20,224 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 21:59:20,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 21:59:20,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 21:59:20,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 21:59:20,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 21:59:20,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 21:59:20,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 21:59:20,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 21:59:20,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 21:59:20,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 21:59:20,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 21:59:20,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 21:59:20,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 21:59:20,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 21:59:20,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 21:59:20,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 21:59:20,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 21:59:20,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 21:59:20,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 21:59:20,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 21:59:20,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 21:59:20,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 21:59:20,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 21:59:20,268 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 21:59:20,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 21:59:20,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 21:59:20,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 21:59:20,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 21:59:20,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 21:59:20,270 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 21:59:20,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 21:59:20,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 21:59:20,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 21:59:20,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 21:59:20,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 21:59:20,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 21:59:20,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 21:59:20,272 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 21:59:20,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 21:59:20,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 21:59:20,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 21:59:20,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 21:59:20,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:59:20,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 21:59:20,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 21:59:20,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 21:59:20,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 21:59:20,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 21:59:20,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 21:59:20,273 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 21:59:20,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 21:59:20,275 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 21:59:20,275 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-07 21:59:20,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 21:59:20,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 21:59:20,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 21:59:20,535 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 21:59:20,539 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 21:59:20,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/array-2.c [2022-04-07 21:59:20,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd68cc671/2abff73c91194f61b7f6e58a7cf559a4/FLAG685fc2842 [2022-04-07 21:59:21,008 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 21:59:21,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array-2.c [2022-04-07 21:59:21,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd68cc671/2abff73c91194f61b7f6e58a7cf559a4/FLAG685fc2842 [2022-04-07 21:59:21,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd68cc671/2abff73c91194f61b7f6e58a7cf559a4 [2022-04-07 21:59:21,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 21:59:21,048 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 21:59:21,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 21:59:21,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 21:59:21,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 21:59:21,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:59:21" (1/1) ... [2022-04-07 21:59:21,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312919ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:21, skipping insertion in model container [2022-04-07 21:59:21,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:59:21" (1/1) ... [2022-04-07 21:59:21,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 21:59:21,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 21:59:21,222 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/array-2.c[319,332] [2022-04-07 21:59:21,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:59:21,243 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 21:59:21,270 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/array-2.c[319,332] [2022-04-07 21:59:21,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:59:21,316 INFO L208 MainTranslator]: Completed translation [2022-04-07 21:59:21,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:21 WrapperNode [2022-04-07 21:59:21,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 21:59:21,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 21:59:21,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 21:59:21,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 21:59:21,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:21" (1/1) ... [2022-04-07 21:59:21,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:21" (1/1) ... [2022-04-07 21:59:21,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:21" (1/1) ... [2022-04-07 21:59:21,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:21" (1/1) ... [2022-04-07 21:59:21,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:21" (1/1) ... [2022-04-07 21:59:21,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:21" (1/1) ... [2022-04-07 21:59:21,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:21" (1/1) ... [2022-04-07 21:59:21,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 21:59:21,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 21:59:21,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 21:59:21,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 21:59:21,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:21" (1/1) ... [2022-04-07 21:59:21,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:59:21,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:59:21,401 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-07 21:59:21,424 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-07 21:59:21,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 21:59:21,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 21:59:21,447 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 21:59:21,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 21:59:21,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 21:59:21,448 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 21:59:21,448 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 21:59:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 21:59:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 21:59:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 21:59:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 21:59:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 21:59:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-07 21:59:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 21:59:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 21:59:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 21:59:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 21:59:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 21:59:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 21:59:21,511 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 21:59:21,513 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 21:59:21,655 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 21:59:21,661 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 21:59:21,661 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 21:59:21,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:59:21 BoogieIcfgContainer [2022-04-07 21:59:21,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 21:59:21,664 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 21:59:21,664 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 21:59:21,678 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 21:59:21,685 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:59:21" (1/1) ... [2022-04-07 21:59:21,697 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 21:59:21,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:59:21 BasicIcfg [2022-04-07 21:59:21,735 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 21:59:21,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 21:59:21,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 21:59:21,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 21:59:21,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 09:59:21" (1/4) ... [2022-04-07 21:59:21,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7823579d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:59:21, skipping insertion in model container [2022-04-07 21:59:21,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:21" (2/4) ... [2022-04-07 21:59:21,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7823579d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:59:21, skipping insertion in model container [2022-04-07 21:59:21,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:59:21" (3/4) ... [2022-04-07 21:59:21,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7823579d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:59:21, skipping insertion in model container [2022-04-07 21:59:21,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:59:21" (4/4) ... [2022-04-07 21:59:21,742 INFO L111 eAbstractionObserver]: Analyzing ICFG array-2.cqvasr [2022-04-07 21:59:21,752 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 21:59:21,752 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 21:59:21,801 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 21:59:21,810 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 21:59:21,810 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 21:59:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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-07 21:59:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 21:59:21,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:21,842 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:21,842 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:21,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:21,849 INFO L85 PathProgramCache]: Analyzing trace with hash -822380801, now seen corresponding path program 1 times [2022-04-07 21:59:21,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:21,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246870242] [2022-04-07 21:59:21,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:21,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:22,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:22,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-07 21:59:22,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 21:59:22,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 21:59:22,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:59:22,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-07 21:59:22,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 21:59:22,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 21:59:22,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 21:59:22,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (= (store |v_#length_2| |v_main_~#array~0.base_1| (* (mod v_main_~SIZE~0_1 4294967296) 4)) |v_#length_1|) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {25#true} is VALID [2022-04-07 21:59:22,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [53] L21-3-->L21-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 21:59:22,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {26#false} is VALID [2022-04-07 21:59:22,114 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {26#false} is VALID [2022-04-07 21:59:22,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-07 21:59:22,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 21:59:22,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 21:59:22,117 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-07 21:59:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:22,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246870242] [2022-04-07 21:59:22,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246870242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:59:22,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:59:22,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 21:59:22,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763122902] [2022-04-07 21:59:22,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:59:22,125 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-07 21:59:22,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:22,130 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-07 21:59:22,160 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-07 21:59:22,160 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 21:59:22,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:22,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 21:59:22,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 21:59:22,187 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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-07 21:59:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:22,271 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-07 21:59:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 21:59:22,272 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-07 21:59:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:22,273 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-07 21:59:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-07 21:59:22,280 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-07 21:59:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-07 21:59:22,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-07 21:59:22,328 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-07 21:59:22,334 INFO L225 Difference]: With dead ends: 35 [2022-04-07 21:59:22,335 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 21:59:22,337 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 21:59:22,340 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 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-07 21:59:22,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:59:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 21:59:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 21:59:22,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:22,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-07 21:59:22,367 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-07 21:59:22,369 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-07 21:59:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:22,371 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 21:59:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 21:59:22,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:22,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:22,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-07 21:59:22,372 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-07 21:59:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:22,375 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 21:59:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 21:59:22,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:22,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:22,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:22,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-07 21:59:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-07 21:59:22,379 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-07 21:59:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:22,379 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-07 21:59:22,379 INFO L479 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-07 21:59:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 21:59:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 21:59:22,380 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:22,380 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:22,381 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 21:59:22,381 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash -793751650, now seen corresponding path program 1 times [2022-04-07 21:59:22,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:22,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72690705] [2022-04-07 21:59:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:22,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:22,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:22,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {129#true} is VALID [2022-04-07 21:59:22,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-07 21:59:22,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-07 21:59:22,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {129#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:59:22,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {129#true} is VALID [2022-04-07 21:59:22,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {129#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-07 21:59:22,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129#true} {129#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-07 21:59:22,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {129#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-07 21:59:22,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {129#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (= (store |v_#length_2| |v_main_~#array~0.base_1| (* (mod v_main_~SIZE~0_1 4294967296) 4)) |v_#length_1|) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {134#(and (= main_~j~0 0) (<= 1 main_~SIZE~0) (<= (div main_~SIZE~0 4294967296) 0))} is VALID [2022-04-07 21:59:22,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#(and (= main_~j~0 0) (<= 1 main_~SIZE~0) (<= (div main_~SIZE~0 4294967296) 0))} [54] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~SIZE~0_2 4294967296))) InVars {main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} OutVars{main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {130#false} is VALID [2022-04-07 21:59:22,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {130#false} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {130#false} is VALID [2022-04-07 21:59:22,514 INFO L272 TraceCheckUtils]: 8: Hoare triple {130#false} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {130#false} is VALID [2022-04-07 21:59:22,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#false} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {130#false} is VALID [2022-04-07 21:59:22,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {130#false} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {130#false} is VALID [2022-04-07 21:59:22,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {130#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {130#false} is VALID [2022-04-07 21:59:22,515 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-07 21:59:22,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:22,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72690705] [2022-04-07 21:59:22,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72690705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:59:22,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:59:22,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:59:22,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046378981] [2022-04-07 21:59:22,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:59:22,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 21:59:22,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:22,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 21:59:22,530 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-07 21:59:22,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:59:22,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:22,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:59:22,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:59:22,532 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 21:59:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:22,608 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-07 21:59:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:59:22,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 21:59:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 21:59:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-07 21:59:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 21:59:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-07 21:59:22,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-07 21:59:22,641 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-07 21:59:22,642 INFO L225 Difference]: With dead ends: 24 [2022-04-07 21:59:22,642 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 21:59:22,643 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:59:22,644 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:59:22,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 20 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:59:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 21:59:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-04-07 21:59:22,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:22,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-07 21:59:22,651 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-07 21:59:22,651 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-07 21:59:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:22,653 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 21:59:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 21:59:22,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:22,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:22,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 18 states. [2022-04-07 21:59:22,654 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 18 states. [2022-04-07 21:59:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:22,656 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 21:59:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 21:59:22,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:22,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:22,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:22,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-07 21:59:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-07 21:59:22,658 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-04-07 21:59:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:22,659 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-07 21:59:22,659 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 21:59:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-07 21:59:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 21:59:22,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:22,660 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:22,660 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 21:59:22,660 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:22,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:22,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2020817898, now seen corresponding path program 1 times [2022-04-07 21:59:22,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:22,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253811200] [2022-04-07 21:59:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 21:59:22,691 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 21:59:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 21:59:22,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 21:59:22,768 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 21:59:22,769 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 21:59:22,771 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 21:59:22,774 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-07 21:59:22,792 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 21:59:22,829 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 21:59:22,829 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 21:59:22,829 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 21:59:22,829 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-07 21:59:22,829 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 21:59:22,829 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-04-07 21:59:22,829 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-04-07 21:59:22,829 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-04-07 21:59:22,829 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-07 21:59:22,830 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-07 21:59:22,830 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 21:59:22,830 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-07 21:59:22,830 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-07 21:59:22,830 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-07 21:59:22,830 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 21:59:22,830 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 21:59:22,830 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-07 21:59:22,830 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 21:59:22,830 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 21:59:22,830 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-07 21:59:22,830 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 21:59:22,830 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-07 21:59:22,831 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 21:59:22,842 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 21:59:22,842 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 21:59:22,842 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 21:59:22,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:59:22 BasicIcfg [2022-04-07 21:59:22,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 21:59:22,844 INFO L158 Benchmark]: Toolchain (without parser) took 1796.14ms. Allocated memory was 186.6MB in the beginning and 254.8MB in the end (delta: 68.2MB). Free memory was 126.2MB in the beginning and 154.4MB in the end (delta: -28.2MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-04-07 21:59:22,845 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 21:59:22,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.63ms. Allocated memory was 186.6MB in the beginning and 254.8MB in the end (delta: 68.2MB). Free memory was 125.9MB in the beginning and 228.3MB in the end (delta: -102.4MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. [2022-04-07 21:59:22,848 INFO L158 Benchmark]: Boogie Preprocessor took 47.94ms. Allocated memory is still 254.8MB. Free memory was 228.3MB in the beginning and 226.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 21:59:22,848 INFO L158 Benchmark]: RCFGBuilder took 290.58ms. Allocated memory is still 254.8MB. Free memory was 226.8MB in the beginning and 214.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 21:59:22,849 INFO L158 Benchmark]: IcfgTransformer took 71.05ms. Allocated memory is still 254.8MB. Free memory was 214.7MB in the beginning and 213.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 21:59:22,849 INFO L158 Benchmark]: TraceAbstraction took 1106.44ms. Allocated memory is still 254.8MB. Free memory was 212.6MB in the beginning and 154.4MB in the end (delta: 58.2MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2022-04-07 21:59:22,852 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.63ms. Allocated memory was 186.6MB in the beginning and 254.8MB in the end (delta: 68.2MB). Free memory was 125.9MB in the beginning and 228.3MB in the end (delta: -102.4MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.94ms. Allocated memory is still 254.8MB. Free memory was 228.3MB in the beginning and 226.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 290.58ms. Allocated memory is still 254.8MB. Free memory was 226.8MB in the beginning and 214.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 71.05ms. Allocated memory is still 254.8MB. Free memory was 214.7MB in the beginning and 213.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1106.44ms. Allocated memory is still 254.8MB. Free memory was 212.6MB in the beginning and 154.4MB in the end (delta: 58.2MB). Peak memory consumption was 58.7MB. 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 - CounterExampleResult [Line: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L15] unsigned int SIZE=1; [L16] unsigned int j,k; [L17] int array[SIZE], menor; [L19] menor = __VERIFIER_nondet_int() [L21] j=0 VAL [array={5:0}, j=0, menor=0, SIZE=1] [L21] COND TRUE jmenor) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 35 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 45 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-07 21:59:22,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...