/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 22:07:14,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 22:07:14,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 22:07:14,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 22:07:14,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 22:07:14,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 22:07:14,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 22:07:14,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 22:07:14,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 22:07:14,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 22:07:14,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 22:07:14,522 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 22:07:14,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 22:07:14,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 22:07:14,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 22:07:14,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 22:07:14,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 22:07:14,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 22:07:14,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 22:07:14,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 22:07:14,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 22:07:14,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 22:07:14,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 22:07:14,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 22:07:14,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 22:07:14,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 22:07:14,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 22:07:14,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 22:07:14,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 22:07:14,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 22:07:14,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 22:07:14,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 22:07:14,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 22:07:14,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 22:07:14,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 22:07:14,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 22:07:14,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 22:07:14,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 22:07:14,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 22:07:14,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 22:07:14,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 22:07:14,559 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-02 22:07:14,594 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 22:07:14,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 22:07:14,595 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 22:07:14,596 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 22:07:14,596 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 22:07:14,596 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 22:07:14,597 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-02 22:07:14,597 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-02 22:07:14,597 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-02 22:07:14,597 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-02 22:07:14,598 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-02 22:07:14,598 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-02 22:07:14,598 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-02 22:07:14,598 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-02 22:07:14,598 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-02 22:07:14,598 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-02 22:07:14,598 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-02 22:07:14,599 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-02 22:07:14,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 22:07:14,599 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 22:07:14,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 22:07:14,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 22:07:14,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 22:07:14,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 22:07:14,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 22:07:14,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 22:07:14,600 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 22:07:14,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 22:07:14,600 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 22:07:14,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 22:07:14,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 22:07:14,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 22:07:14,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 22:07:14,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 22:07:14,601 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-02 22:07:14,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 22:07:14,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 22:07:14,602 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-02 22:07:14,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 22:07:14,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 22:07:14,602 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-02 22:07:14,602 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-02 22:07:14,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 22:07:14,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 22:07:14,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 22:07:14,820 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 22:07:14,821 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 22:07:14,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2023-04-02 22:07:15,997 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 22:07:16,177 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 22:07:16,178 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2023-04-02 22:07:16,182 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ec7672e/e8d584a40f9c4591b3253f2587312038/FLAGc09b64073 [2023-04-02 22:07:16,193 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ec7672e/e8d584a40f9c4591b3253f2587312038 [2023-04-02 22:07:16,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 22:07:16,196 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 22:07:16,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 22:07:16,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 22:07:16,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 22:07:16,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 10:07:16" (1/1) ... [2023-04-02 22:07:16,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2750235a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:16, skipping insertion in model container [2023-04-02 22:07:16,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 10:07:16" (1/1) ... [2023-04-02 22:07:16,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 22:07:16,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 22:07:16,335 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1215,1228] [2023-04-02 22:07:16,342 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1969,1982] [2023-04-02 22:07:16,346 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2504,2517] [2023-04-02 22:07:16,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 22:07:16,357 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 22:07:16,370 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1215,1228] [2023-04-02 22:07:16,373 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1969,1982] [2023-04-02 22:07:16,379 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2504,2517] [2023-04-02 22:07:16,381 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 22:07:16,394 INFO L208 MainTranslator]: Completed translation [2023-04-02 22:07:16,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:16 WrapperNode [2023-04-02 22:07:16,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 22:07:16,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 22:07:16,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 22:07:16,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 22:07:16,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:16" (1/1) ... [2023-04-02 22:07:16,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:16" (1/1) ... [2023-04-02 22:07:16,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:16" (1/1) ... [2023-04-02 22:07:16,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:16" (1/1) ... [2023-04-02 22:07:16,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:16" (1/1) ... [2023-04-02 22:07:16,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:16" (1/1) ... [2023-04-02 22:07:16,419 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:16" (1/1) ... [2023-04-02 22:07:16,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:16" (1/1) ... [2023-04-02 22:07:16,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 22:07:16,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 22:07:16,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 22:07:16,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 22:07:16,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:16" (1/1) ... [2023-04-02 22:07:16,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 22:07:16,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:07:16,453 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) [2023-04-02 22:07:16,454 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 [2023-04-02 22:07:16,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 22:07:16,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 22:07:16,479 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 22:07:16,479 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 22:07:16,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 22:07:16,480 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 22:07:16,480 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 22:07:16,480 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 22:07:16,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 22:07:16,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 22:07:16,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 22:07:16,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2023-04-02 22:07:16,480 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 22:07:16,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-02 22:07:16,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 22:07:16,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 22:07:16,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 22:07:16,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 22:07:16,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 22:07:16,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 22:07:16,594 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 22:07:16,596 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 22:07:16,860 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 22:07:16,889 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 22:07:16,889 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-02 22:07:16,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 10:07:16 BoogieIcfgContainer [2023-04-02 22:07:16,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 22:07:16,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 22:07:16,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 22:07:16,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 22:07:16,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 10:07:16" (1/3) ... [2023-04-02 22:07:16,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e6c86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 10:07:16, skipping insertion in model container [2023-04-02 22:07:16,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:16" (2/3) ... [2023-04-02 22:07:16,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e6c86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 10:07:16, skipping insertion in model container [2023-04-02 22:07:16,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 10:07:16" (3/3) ... [2023-04-02 22:07:16,898 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2023-04-02 22:07:16,913 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 22:07:16,913 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-04-02 22:07:16,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 22:07:16,959 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@522281e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-02 22:07:16,959 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-04-02 22:07:16,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 31 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 22:07:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-02 22:07:16,969 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:16,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:16,970 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:16,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:16,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2143969391, now seen corresponding path program 1 times [2023-04-02 22:07:16,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:16,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022589406] [2023-04-02 22:07:16,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:16,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:07:17,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:17,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022589406] [2023-04-02 22:07:17,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022589406] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:17,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:07:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-02 22:07:17,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83234535] [2023-04-02 22:07:17,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:17,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 22:07:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:17,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 22:07:17,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 22:07:17,307 INFO L87 Difference]: Start difference. First operand has 36 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 31 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:17,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:17,340 INFO L93 Difference]: Finished difference Result 67 states and 95 transitions. [2023-04-02 22:07:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 22:07:17,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-04-02 22:07:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:17,354 INFO L225 Difference]: With dead ends: 67 [2023-04-02 22:07:17,355 INFO L226 Difference]: Without dead ends: 32 [2023-04-02 22:07:17,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 22:07:17,360 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:17,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:07:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-02 22:07:17,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-04-02 22:07:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-04-02 22:07:17,388 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 13 [2023-04-02 22:07:17,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:17,388 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-04-02 22:07:17,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-04-02 22:07:17,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-02 22:07:17,389 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:17,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:17,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 22:07:17,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:17,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash 245210339, now seen corresponding path program 1 times [2023-04-02 22:07:17,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:17,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820247136] [2023-04-02 22:07:17,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:17,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:07:17,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:17,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820247136] [2023-04-02 22:07:17,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820247136] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 22:07:17,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516428926] [2023-04-02 22:07:17,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:17,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:17,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:07:17,558 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) [2023-04-02 22:07:17,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-02 22:07:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:17,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 22:07:17,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:07:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:07:17,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:07:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:07:17,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516428926] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:07:17,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1735170197] [2023-04-02 22:07:17,712 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-04-02 22:07:17,713 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:07:17,716 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:07:17,721 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:07:17,721 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:07:17,846 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 26 for LOIs [2023-04-02 22:07:18,076 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2023-04-02 22:07:18,096 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:07:18,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1735170197] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:18,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-02 22:07:18,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 4, 4] total 16 [2023-04-02 22:07:18,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682801681] [2023-04-02 22:07:18,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:18,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 22:07:18,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:18,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 22:07:18,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-04-02 22:07:18,579 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:19,455 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2023-04-02 22:07:19,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 22:07:19,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-04-02 22:07:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:19,456 INFO L225 Difference]: With dead ends: 52 [2023-04-02 22:07:19,456 INFO L226 Difference]: Without dead ends: 31 [2023-04-02 22:07:19,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2023-04-02 22:07:19,458 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:19,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 73 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 22:07:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-04-02 22:07:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-04-02 22:07:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-04-02 22:07:19,469 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 14 [2023-04-02 22:07:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:19,469 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-04-02 22:07:19,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-04-02 22:07:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-02 22:07:19,471 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:19,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:19,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 22:07:19,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:19,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:19,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:19,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1202278993, now seen corresponding path program 1 times [2023-04-02 22:07:19,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:19,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391545937] [2023-04-02 22:07:19,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:19,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 22:07:19,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:19,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391545937] [2023-04-02 22:07:19,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391545937] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:19,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:07:19,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 22:07:19,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380610345] [2023-04-02 22:07:19,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:19,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 22:07:19,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:19,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 22:07:19,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 22:07:19,785 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:19,811 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-04-02 22:07:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 22:07:19,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-04-02 22:07:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:19,813 INFO L225 Difference]: With dead ends: 32 [2023-04-02 22:07:19,813 INFO L226 Difference]: Without dead ends: 30 [2023-04-02 22:07:19,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:07:19,816 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:19,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 60 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:07:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-02 22:07:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-04-02 22:07:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-04-02 22:07:19,831 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2023-04-02 22:07:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:19,831 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-04-02 22:07:19,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-04-02 22:07:19,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-02 22:07:19,833 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:19,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:19,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 22:07:19,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:19,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash 152580976, now seen corresponding path program 1 times [2023-04-02 22:07:19,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:19,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094451039] [2023-04-02 22:07:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:07:20,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:20,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094451039] [2023-04-02 22:07:20,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094451039] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 22:07:20,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062933056] [2023-04-02 22:07:20,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:20,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:20,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:07:20,006 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) [2023-04-02 22:07:20,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-02 22:07:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:20,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 22:07:20,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:07:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:07:20,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:07:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:07:20,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062933056] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:07:20,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [358666459] [2023-04-02 22:07:20,111 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 22:07:20,111 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:07:20,112 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:07:20,112 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:07:20,112 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:07:20,170 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 26 for LOIs [2023-04-02 22:07:21,719 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2023-04-02 22:07:21,729 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:07:23,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [358666459] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:23,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-02 22:07:23,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [4, 4, 4] total 23 [2023-04-02 22:07:23,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067995997] [2023-04-02 22:07:23,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:23,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-02 22:07:23,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:23,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-02 22:07:23,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2023-04-02 22:07:23,392 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:24,483 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2023-04-02 22:07:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-02 22:07:24,486 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-04-02 22:07:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:24,486 INFO L225 Difference]: With dead ends: 56 [2023-04-02 22:07:24,486 INFO L226 Difference]: Without dead ends: 41 [2023-04-02 22:07:24,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2023-04-02 22:07:24,490 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:24,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 73 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 22:07:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-04-02 22:07:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2023-04-02 22:07:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-04-02 22:07:24,502 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 21 [2023-04-02 22:07:24,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:24,502 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-04-02 22:07:24,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-04-02 22:07:24,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-02 22:07:24,502 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:24,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:24,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-02 22:07:24,703 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 [2023-04-02 22:07:24,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:24,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash -216779000, now seen corresponding path program 1 times [2023-04-02 22:07:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:24,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169202512] [2023-04-02 22:07:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 22:07:24,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:24,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169202512] [2023-04-02 22:07:24,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169202512] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:24,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:07:24,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 22:07:24,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981986948] [2023-04-02 22:07:24,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:24,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 22:07:24,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:24,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 22:07:24,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:07:24,775 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:24,823 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2023-04-02 22:07:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 22:07:24,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-04-02 22:07:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:24,824 INFO L225 Difference]: With dead ends: 54 [2023-04-02 22:07:24,824 INFO L226 Difference]: Without dead ends: 52 [2023-04-02 22:07:24,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-04-02 22:07:24,825 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 59 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:24,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 129 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:07:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-04-02 22:07:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2023-04-02 22:07:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-04-02 22:07:24,833 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 22 [2023-04-02 22:07:24,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:24,833 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-04-02 22:07:24,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-04-02 22:07:24,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-02 22:07:24,834 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:24,834 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:24,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 22:07:24,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:24,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:24,835 INFO L85 PathProgramCache]: Analyzing trace with hash 601518218, now seen corresponding path program 1 times [2023-04-02 22:07:24,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:24,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137594816] [2023-04-02 22:07:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:24,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:07:24,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137594816] [2023-04-02 22:07:24,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137594816] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 22:07:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485286473] [2023-04-02 22:07:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:24,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:24,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:07:24,911 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:07:24,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 22:07:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:24,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-02 22:07:24,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:07:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 22:07:24,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:07:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 22:07:25,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485286473] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:07:25,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1404959170] [2023-04-02 22:07:25,063 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 22:07:25,063 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:07:25,064 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:07:25,064 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:07:25,064 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:07:25,099 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 26 for LOIs [2023-04-02 22:07:28,400 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2023-04-02 22:07:28,408 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:07:30,062 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1073#(and (<= 1 |#StackHeapBarrier|) (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main____CPAchecker_TMP_2~0 (+ main_~main__index2~0 1)) (= main_~main____CPAchecker_TMP_0~0 1) (= ~__tmp_155_0~0 1) (= main_~__tmp_3~0 0) (or (and (<= (mod main_~main__index2~0 4294967296) 2147483647) (not (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (- 17179869184) (* (mod main_~main__index1~0 4294967296) 4))) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (* (mod main_~main__index2~0 4294967296) 4)) 4294967296))) (< 2147483647 (mod main_~main__index1~0 4294967296))) (and (<= (mod main_~main__index1~0 4294967296) 2147483647) (not (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (* (mod main_~main__index1~0 4294967296) 4)) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (* (mod main_~main__index2~0 4294967296) 4)) 4294967296)))) (and (< 2147483647 (mod main_~main__index2~0 4294967296)) (not (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (- 17179869184) (* (mod main_~main__index1~0 4294967296) 4))) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (- 17179869184) (* (mod main_~main__index2~0 4294967296) 4))) 4294967296))))) (< (mod main_~main__index2~0 4294967296) (mod main_~main__index1~0 4294967296)) (= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0) (<= 0 main_~i~0) (= |#NULL.offset| 0) (<= main_~main__index1~0 (+ main_~main____CPAchecker_TMP_1~0 1)) (= main_~main__loop_entered~0 1) (= main_~__VERIFIER_assert__cond~0 1) (= ~__return_main~0 0) (= |main_~#main__array~0.offset| 0) (= main_~__tmp_1~0 1) (= |#NULL.base| 0) (<= (+ |#StackHeapBarrier| 1) |main_~#main__array~0.base|))' at error location [2023-04-02 22:07:30,063 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:07:30,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 22:07:30,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-04-02 22:07:30,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923762224] [2023-04-02 22:07:30,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 22:07:30,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 22:07:30,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:30,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 22:07:30,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2023-04-02 22:07:30,065 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:30,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:30,160 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2023-04-02 22:07:30,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 22:07:30,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-04-02 22:07:30,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:30,161 INFO L225 Difference]: With dead ends: 73 [2023-04-02 22:07:30,161 INFO L226 Difference]: Without dead ends: 37 [2023-04-02 22:07:30,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2023-04-02 22:07:30,162 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:30,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 60 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 22:07:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-04-02 22:07:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-04-02 22:07:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2023-04-02 22:07:30,170 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 23 [2023-04-02 22:07:30,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:30,170 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2023-04-02 22:07:30,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2023-04-02 22:07:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-02 22:07:30,171 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:30,171 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:30,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-02 22:07:30,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:30,379 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:30,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1165568093, now seen corresponding path program 1 times [2023-04-02 22:07:30,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:30,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380095174] [2023-04-02 22:07:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:30,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 22:07:30,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380095174] [2023-04-02 22:07:30,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380095174] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 22:07:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648865763] [2023-04-02 22:07:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:30,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:30,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:07:30,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:07:30,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-02 22:07:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:30,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-02 22:07:30,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:07:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 22:07:30,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:07:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 22:07:30,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648865763] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:07:30,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2051219747] [2023-04-02 22:07:30,643 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-02 22:07:30,643 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:07:30,644 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:07:30,644 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:07:30,644 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:07:30,671 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 26 for LOIs [2023-04-02 22:07:31,804 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2023-04-02 22:07:31,811 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:07:33,756 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1426#(and (<= 1 |#StackHeapBarrier|) (= (+ main_~main__index2~0 1) main_~main____CPAchecker_TMP_2~0) (= main_~__VERIFIER_assert__cond~2 0) (= main_~main____CPAchecker_TMP_0~0 1) (= ~__tmp_155_0~0 1) (= main_~__tmp_3~0 0) (or (and (<= (mod main_~main__index2~0 4294967296) 2147483647) (not (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (- 17179869184) (* (mod main_~main__index1~0 4294967296) 4))) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (* (mod main_~main__index2~0 4294967296) 4)) 4294967296))) (< 2147483647 (mod main_~main__index1~0 4294967296))) (and (<= (mod main_~main__index1~0 4294967296) 2147483647) (not (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (* (mod main_~main__index1~0 4294967296) 4)) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (* (mod main_~main__index2~0 4294967296) 4)) 4294967296)))) (and (< 2147483647 (mod main_~main__index2~0 4294967296)) (not (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (- 17179869184) (* (mod main_~main__index1~0 4294967296) 4))) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (- 17179869184) (* (mod main_~main__index2~0 4294967296) 4))) 4294967296))))) (< (mod main_~main__index2~0 4294967296) (mod main_~main__index1~0 4294967296)) (= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0) (<= 0 main_~i~0) (= |#NULL.offset| 0) (= main_~main__loop_entered~0 1) (= main_~__VERIFIER_assert__cond~0 1) (= main_~main__index1~0 (+ main_~main____CPAchecker_TMP_1~0 1)) (= ~__return_main~0 0) (= |main_~#main__array~0.offset| 0) (= main_~__tmp_1~0 1) (= |#NULL.base| 0) (<= (+ |#StackHeapBarrier| 1) |main_~#main__array~0.base|))' at error location [2023-04-02 22:07:33,757 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:07:33,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 22:07:33,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-04-02 22:07:33,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209534922] [2023-04-02 22:07:33,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 22:07:33,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 22:07:33,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:33,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 22:07:33,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2023-04-02 22:07:33,758 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:33,831 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2023-04-02 22:07:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 22:07:33,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-04-02 22:07:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:33,837 INFO L225 Difference]: With dead ends: 70 [2023-04-02 22:07:33,837 INFO L226 Difference]: Without dead ends: 41 [2023-04-02 22:07:33,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2023-04-02 22:07:33,838 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:33,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:07:33,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-04-02 22:07:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-04-02 22:07:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-04-02 22:07:33,846 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 29 [2023-04-02 22:07:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:33,846 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-04-02 22:07:33,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-04-02 22:07:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-04-02 22:07:33,847 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:33,847 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:33,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-02 22:07:34,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:34,051 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:34,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash 100967773, now seen corresponding path program 2 times [2023-04-02 22:07:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:34,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131496422] [2023-04-02 22:07:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:34,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 22:07:34,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:34,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131496422] [2023-04-02 22:07:34,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131496422] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 22:07:34,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832878803] [2023-04-02 22:07:34,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 22:07:34,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:34,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:07:34,244 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:07:34,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 22:07:34,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-02 22:07:34,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 22:07:34,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 36 conjunts are in the unsatisfiable core [2023-04-02 22:07:34,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:07:35,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 22:07:35,882 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 22:07:35,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 22:07:35,892 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 22:07:35,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 22:07:35,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 22:07:35,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 986 treesize of output 568 [2023-04-02 22:07:36,581 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-02 22:07:36,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 22:07:36,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832878803] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:36,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 22:07:36,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 21 [2023-04-02 22:07:36,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698550091] [2023-04-02 22:07:36,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:36,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 22:07:36,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:36,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 22:07:36,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2023-04-02 22:07:36,584 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:37,490 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2023-04-02 22:07:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-02 22:07:37,491 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2023-04-02 22:07:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:37,492 INFO L225 Difference]: With dead ends: 55 [2023-04-02 22:07:37,492 INFO L226 Difference]: Without dead ends: 0 [2023-04-02 22:07:37,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2023-04-02 22:07:37,494 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:37,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 36 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 22:07:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-02 22:07:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-02 22:07:37,495 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) [2023-04-02 22:07:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-02 22:07:37,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2023-04-02 22:07:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:37,495 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-02 22:07:37,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:07:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-02 22:07:37,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-02 22:07:37,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-04-02 22:07:37,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-04-02 22:07:37,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-04-02 22:07:37,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 22:07:37,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:37,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-02 22:07:39,424 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2023-04-02 22:07:39,424 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 4) no Hoare annotation was computed. [2023-04-02 22:07:39,424 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 6 8) no Hoare annotation was computed. [2023-04-02 22:07:39,424 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-04-02 22:07:39,425 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 97) no Hoare annotation was computed. [2023-04-02 22:07:39,425 INFO L895 garLoopResultBuilder]: At program point L89(lines 64 97) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (not (= (select |old(#length)| 2) 45)))) [2023-04-02 22:07:39,425 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 14 172) no Hoare annotation was computed. [2023-04-02 22:07:39,425 INFO L895 garLoopResultBuilder]: At program point L52(lines 50 143) the Hoare annotation is: (let ((.cse6 (mod main_~main__index2~0 4294967296))) (let ((.cse0 (< .cse6 100000)) (.cse1 (= (select |#valid| 3) 1)) (.cse2 (< (mod main_~main__index1~0 4294967296) .cse6)) (.cse3 (= main_~__VERIFIER_assert__cond~0 1)) (.cse4 (= |main_~#main__array~0.offset| 0)) (.cse5 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (and .cse0 (= main_~main____CPAchecker_TMP_0~0 1) (= ~__tmp_155_0~0 1) .cse1 .cse2 (<= 100000 (mod main_~i~0 4294967296)) (= main_~main__loop_entered~0 0) (<= 0 main_~i~0) .cse3 .cse4 (= main_~__tmp_1~0 1) (<= (+ |#StackHeapBarrier| 1) |main_~#main__array~0.base|)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (and .cse0 .cse1 .cse2 (= main_~main____CPAchecker_TMP_0~1 1) (= main_~__VERIFIER_assert__cond~1 1) (< (mod (+ 4294967295 main_~main__index1~0) 4294967296) (mod (+ main_~main__index2~0 1) 4294967296)) .cse3 .cse4) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse5 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse5 1) 0)) (not (= (select |old(#length)| 2) 45))))) [2023-04-02 22:07:39,425 INFO L899 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2023-04-02 22:07:39,425 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-04-02 22:07:39,425 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 143) no Hoare annotation was computed. [2023-04-02 22:07:39,426 INFO L895 garLoopResultBuilder]: At program point $Ultimate##32(lines 105 131) the Hoare annotation is: (let ((.cse6 (+ main_~main__index2~0 1))) (let ((.cse2 (mod (+ 4294967295 main_~main__index1~0) 4294967296)) (.cse0 (mod .cse6 4294967296))) (let ((.cse1 (select |#memory_int| |main_~#main__array~0.base|)) (.cse3 (< .cse2 .cse0)) (.cse4 (= main_~__VERIFIER_assert__cond~0 1)) (.cse5 (= |main_~#main__array~0.offset| 0)) (.cse8 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_155_0~0)| 0)) (and (= (select |#valid| 3) 1) (< (mod (+ 4294967294 main_~main__index1~0) 4294967296) 100000) (< .cse0 100000) (= (mod (select .cse1 (* .cse0 4)) 4294967296) (mod (select .cse1 (* .cse2 4)) 4294967296)) .cse3 .cse4 .cse5) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (and (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) .cse4) (let ((.cse7 (mod main_~main____CPAchecker_TMP_2~0 4294967296))) (and (= .cse6 main_~main____CPAchecker_TMP_2~0) (= main_~main____CPAchecker_TMP_0~0 1) (= ~__tmp_155_0~0 1) (<= 100000 (mod main_~i~0 4294967296)) (< .cse7 100000) (<= 0 main_~i~0) (= (mod (select .cse1 (* 4 (mod main_~main____CPAchecker_TMP_1~0 4294967296))) 4294967296) (mod (select .cse1 (* .cse7 4)) 4294967296)) (= main_~main__loop_entered~0 1) .cse3 .cse4 (= main_~main__index1~0 (+ main_~main____CPAchecker_TMP_1~0 1)) .cse5 (= main_~__tmp_1~0 1) (<= (+ |#StackHeapBarrier| 1) |main_~#main__array~0.base|))) (not (= (select .cse8 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse8 1) 0)) (not (= (select |old(#length)| 2) 45)))))) [2023-04-02 22:07:39,426 INFO L895 garLoopResultBuilder]: At program point $Ultimate##30(lines 102 136) the Hoare annotation is: (let ((.cse0 (+ main_~main__index2~0 1))) (let ((.cse15 (mod (+ 4294967295 main_~main__index1~0) 4294967296)) (.cse14 (mod .cse0 4294967296)) (.cse10 (mod main_~main__index1~0 4294967296))) (let ((.cse1 (<= 100000 (mod main_~i~0 4294967296))) (.cse3 (<= 0 main_~i~0)) (.cse6 (<= (mod main_~main__index2~0 4294967296) .cse10)) (.cse9 (<= (+ |#StackHeapBarrier| 1) |main_~#main__array~0.base|)) (.cse13 (select |old(#memory_int)| 1)) (.cse11 (= (select |#valid| 3) 1)) (.cse4 (select |#memory_int| |main_~#main__array~0.base|)) (.cse5 (< .cse15 .cse14)) (.cse7 (= main_~__VERIFIER_assert__cond~0 1)) (.cse8 (= |main_~#main__array~0.offset| 0))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (let ((.cse2 (mod main_~main____CPAchecker_TMP_2~0 4294967296))) (and (= .cse0 main_~main____CPAchecker_TMP_2~0) (= main_~main____CPAchecker_TMP_0~0 1) (= ~__tmp_155_0~0 1) .cse1 (< .cse2 100000) .cse3 (= (mod (select .cse4 (* 4 (mod main_~main____CPAchecker_TMP_1~0 4294967296))) 4294967296) (mod (select .cse4 (* .cse2 4)) 4294967296)) (= main_~main__loop_entered~0 1) .cse5 .cse6 .cse7 (= main_~main__index1~0 (+ main_~main____CPAchecker_TMP_1~0 1)) .cse8 (= main_~__tmp_1~0 1) .cse9)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (let ((.cse12 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 45 (select |#length| 2)) (< .cse10 100000) (= ~__tmp_155_0~0 0) (= 2 (select |#length| 1)) .cse11 (= (select |#valid| 1) 1) .cse1 (= main_~main__loop_entered~0 0) .cse3 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse12 0) 48) .cse6 (= (select .cse12 1) 0) .cse8 .cse9)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse13 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse13 1) 0)) (and (not (= main_~__VERIFIER_assert__cond~1 0)) .cse11 (< (mod (+ 4294967294 main_~main__index1~0) 4294967296) 100000) (< .cse14 100000) (= (mod (select .cse4 (* .cse14 4)) 4294967296) (mod (select .cse4 (* .cse15 4)) 4294967296)) .cse5 .cse7 .cse8) (not (= (select |old(#length)| 2) 45)))))) [2023-04-02 22:07:39,426 INFO L895 garLoopResultBuilder]: At program point L69(lines 66 92) the Hoare annotation is: (let ((.cse1 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (let ((.cse0 (mod main_~main__index2~0 4294967296))) (and (< .cse0 100000) (= (select |#valid| 3) 1) (< (mod main_~main__index1~0 4294967296) .cse0) (= main_~main____CPAchecker_TMP_0~1 1) (< (mod (+ 4294967295 main_~main__index1~0) 4294967296) (mod (+ main_~main__index2~0 1) 4294967296)) (= main_~__VERIFIER_assert__cond~0 1) (= |main_~#main__array~0.offset| 0))) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse1 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse1 1) 0)) (not (= (select |old(#length)| 2) 45)))) [2023-04-02 22:07:39,427 INFO L899 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2023-04-02 22:07:39,427 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 137) no Hoare annotation was computed. [2023-04-02 22:07:39,427 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 166) no Hoare annotation was computed. [2023-04-02 22:07:39,427 INFO L895 garLoopResultBuilder]: At program point L148(lines 33 156) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (not (= (select |old(#length)| 2) 45)))) [2023-04-02 22:07:39,427 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 23) the Hoare annotation is: (let ((.cse1 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_155_0~0)| 0)) (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 45 (select |#length| 2)) (= ~__tmp_155_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= (select |#valid| 1) 1) (= main_~main__loop_entered~0 0) (<= 0 main_~i~0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= |main_~#main__array~0.offset| 0) (<= (+ |#StackHeapBarrier| 1) |main_~#main__array~0.base|))) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse1 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse1 1) 0)) (not (= (select |old(#length)| 2) 45)))) [2023-04-02 22:07:39,427 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 92) no Hoare annotation was computed. [2023-04-02 22:07:39,427 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 156) no Hoare annotation was computed. [2023-04-02 22:07:39,427 INFO L899 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 77) no Hoare annotation was computed. [2023-04-02 22:07:39,428 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 171) no Hoare annotation was computed. [2023-04-02 22:07:39,428 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 142) no Hoare annotation was computed. [2023-04-02 22:07:39,428 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 124) no Hoare annotation was computed. [2023-04-02 22:07:39,428 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-04-02 22:07:39,428 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 14 172) no Hoare annotation was computed. [2023-04-02 22:07:39,428 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 84) no Hoare annotation was computed. [2023-04-02 22:07:39,428 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 172) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= ~__tmp_155_0~0 0) (= |old(#valid)| |#valid|)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (not (= (select |old(#length)| 2) 45)))) [2023-04-02 22:07:39,428 INFO L895 garLoopResultBuilder]: At program point L38(lines 35 151) the Hoare annotation is: (let ((.cse2 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (let ((.cse0 (mod main_~main__index2~0 4294967296)) (.cse1 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (< .cse0 100000) (= 45 (select |#length| 2)) (= main_~main____CPAchecker_TMP_0~0 1) (= ~__tmp_155_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (< (mod main_~main__index1~0 4294967296) .cse0) (= (select |#valid| 1) 1) (<= 100000 (mod main_~i~0 4294967296)) (= main_~main__loop_entered~0 0) (<= 0 main_~i~0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse1 0) 48) (= (select .cse1 1) 0) (= |main_~#main__array~0.offset| 0) (<= (+ |#StackHeapBarrier| 1) |main_~#main__array~0.base|))) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse2 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse2 1) 0)) (not (= (select |old(#length)| 2) 45)))) [2023-04-02 22:07:39,429 INFO L902 garLoopResultBuilder]: At program point L129(lines 102 136) the Hoare annotation is: true [2023-04-02 22:07:39,429 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 46) no Hoare annotation was computed. [2023-04-02 22:07:39,429 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 161) no Hoare annotation was computed. [2023-04-02 22:07:39,429 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 151) no Hoare annotation was computed. [2023-04-02 22:07:39,429 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_136~0)| ~__return_136~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2023-04-02 22:07:39,429 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-02 22:07:39,429 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-02 22:07:39,429 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 45 (select |#length| 2)) (= ~__tmp_155_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~__return_136~0 0) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= ~__return_main~0 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2023-04-02 22:07:39,429 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-02 22:07:39,429 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-02 22:07:39,432 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:39,434 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 22:07:39,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 10:07:39 BoogieIcfgContainer [2023-04-02 22:07:39,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 22:07:39,472 INFO L158 Benchmark]: Toolchain (without parser) took 23275.76ms. Allocated memory was 307.2MB in the beginning and 639.6MB in the end (delta: 332.4MB). Free memory was 255.9MB in the beginning and 457.3MB in the end (delta: -201.5MB). Peak memory consumption was 365.8MB. Max. memory is 8.0GB. [2023-04-02 22:07:39,472 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory was 127.0MB in the beginning and 126.9MB in the end (delta: 136.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 22:07:39,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.14ms. Allocated memory is still 307.2MB. Free memory was 255.3MB in the beginning and 243.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-02 22:07:39,473 INFO L158 Benchmark]: Boogie Preprocessor took 27.06ms. Allocated memory is still 307.2MB. Free memory was 243.8MB in the beginning and 242.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-02 22:07:39,473 INFO L158 Benchmark]: RCFGBuilder took 469.13ms. Allocated memory is still 307.2MB. Free memory was 242.2MB in the beginning and 226.0MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-04-02 22:07:39,473 INFO L158 Benchmark]: TraceAbstraction took 22578.13ms. Allocated memory was 307.2MB in the beginning and 639.6MB in the end (delta: 332.4MB). Free memory was 224.9MB in the beginning and 457.3MB in the end (delta: -232.4MB). Peak memory consumption was 335.4MB. Max. memory is 8.0GB. [2023-04-02 22:07:39,474 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory was 127.0MB in the beginning and 126.9MB in the end (delta: 136.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.14ms. Allocated memory is still 307.2MB. Free memory was 255.3MB in the beginning and 243.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.06ms. Allocated memory is still 307.2MB. Free memory was 243.8MB in the beginning and 242.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 469.13ms. Allocated memory is still 307.2MB. Free memory was 242.2MB in the beginning and 226.0MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 22578.13ms. Allocated memory was 307.2MB in the beginning and 639.6MB in the end (delta: 332.4MB). Free memory was 224.9MB in the beginning and 457.3MB in the end (delta: -232.4MB). Peak memory consumption was 335.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 77]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 22.5s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 214 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 627 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 433 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 602 IncrementalHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 194 mSDtfsCounter, 602 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=7, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 32 NumberOfFragments, 1515 HoareAnnotationTreeSize, 13 FomulaSimplifications, 574 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 937 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 290 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 1110 SizeOfPredicates, 13 NumberOfNonLiveVariables, 708 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 44/83 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: OVERALL_TIME: 2.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 31, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 29, TOOLS_POST_TIME: 1.6s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 0.1s, TOOLS_POST_RETURN_APPLICATIONS: 4, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 41, TOOLS_QUANTIFIERELIM_TIME: 1.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 1.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 86, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 4, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 4, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 31, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 0.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 4, CALL_SUMMARIZER_APPLICATIONS: 4, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 295, DAG_COMPRESSION_RETAINED_NODES: 102, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || ((((((((((((((main__index2 + 1 == main____CPAchecker_TMP_2 && main____CPAchecker_TMP_0 == 1) && __tmp_155_0 == 1) && 100000 <= i % 4294967296) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && 0 <= i) && unknown-#memory_int-unknown[main__array][4 * (main____CPAchecker_TMP_1 % 4294967296)] % 4294967296 == unknown-#memory_int-unknown[main__array][main____CPAchecker_TMP_2 % 4294967296 * 4] % 4294967296) && main__loop_entered == 1) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && main__index2 % 4294967296 <= main__index1 % 4294967296) && __VERIFIER_assert__cond == 1) && main__index1 == main____CPAchecker_TMP_1 + 1) && main__array == 0) && __tmp_1 == 1) && unknown-#StackHeapBarrier-unknown + 1 <= main__array)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || ((((((((((((((((unknown-#length-unknown[3] == 12 && 45 == unknown-#length-unknown[2]) && main__index1 % 4294967296 < 100000) && __tmp_155_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && \valid[1] == 1) && 100000 <= i % 4294967296) && main__loop_entered == 0) && 0 <= i) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && main__index2 % 4294967296 <= main__index1 % 4294967296) && unknown-#memory_int-unknown[1][1] == 0) && main__array == 0) && unknown-#StackHeapBarrier-unknown + 1 <= main__array)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || (((((((!(__VERIFIER_assert__cond == 0) && \valid[3] == 1) && (4294967294 + main__index1) % 4294967296 < 100000) && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][(4294967295 + main__index1) % 4294967296 * 4] % 4294967296) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && __VERIFIER_assert__cond == 1) && main__array == 0)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || (((((((((((((((((unknown-#length-unknown[3] == 12 && main__index2 % 4294967296 < 100000) && 45 == unknown-#length-unknown[2]) && main____CPAchecker_TMP_0 == 1) && __tmp_155_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && main__index1 % 4294967296 < main__index2 % 4294967296) && \valid[1] == 1) && 100000 <= i % 4294967296) && main__loop_entered == 0) && 0 <= i) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && main__array == 0) && unknown-#StackHeapBarrier-unknown + 1 <= main__array)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_155_0) == 0)) || (((((((((((((unknown-#length-unknown[3] == 12 && 45 == unknown-#length-unknown[2]) && __tmp_155_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && \valid[1] == 1) && main__loop_entered == 0) && 0 <= i) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && main__array == 0) && unknown-#StackHeapBarrier-unknown + 1 <= main__array)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || ((((((main__index2 % 4294967296 < 100000 && \valid[3] == 1) && main__index1 % 4294967296 < main__index2 % 4294967296) && main____CPAchecker_TMP_0 == 1) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && __VERIFIER_assert__cond == 1) && main__array == 0)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_155_0) == 0)) || ((((((\valid[3] == 1 && (4294967294 + main__index1) % 4294967296 < 100000) && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][(4294967295 + main__index1) % 4294967296 * 4] % 4294967296) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && __VERIFIER_assert__cond == 1) && main__array == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || (main__index1 % 4294967296 < main__index2 % 4294967296 && __VERIFIER_assert__cond == 1)) || (((((((((((((main__index2 + 1 == main____CPAchecker_TMP_2 && main____CPAchecker_TMP_0 == 1) && __tmp_155_0 == 1) && 100000 <= i % 4294967296) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && 0 <= i) && unknown-#memory_int-unknown[main__array][4 * (main____CPAchecker_TMP_1 % 4294967296)] % 4294967296 == unknown-#memory_int-unknown[main__array][main____CPAchecker_TMP_2 % 4294967296 * 4] % 4294967296) && main__loop_entered == 1) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && __VERIFIER_assert__cond == 1) && main__index1 == main____CPAchecker_TMP_1 + 1) && main__array == 0) && __tmp_1 == 1) && unknown-#StackHeapBarrier-unknown + 1 <= main__array)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(\valid)[2] == 1) || (((((((((((main__index2 % 4294967296 < 100000 && main____CPAchecker_TMP_0 == 1) && __tmp_155_0 == 1) && \valid[3] == 1) && main__index1 % 4294967296 < main__index2 % 4294967296) && 100000 <= i % 4294967296) && main__loop_entered == 0) && 0 <= i) && __VERIFIER_assert__cond == 1) && main__array == 0) && __tmp_1 == 1) && unknown-#StackHeapBarrier-unknown + 1 <= main__array)) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || (((((((main__index2 % 4294967296 < 100000 && \valid[3] == 1) && main__index1 % 4294967296 < main__index2 % 4294967296) && main____CPAchecker_TMP_0 == 1) && __VERIFIER_assert__cond == 1) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && __VERIFIER_assert__cond == 1) && main__array == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) RESULT: Ultimate proved your program to be correct! [2023-04-02 22:07:39,499 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...