./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:22:08,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:22:08,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:22:09,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:22:09,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:22:09,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:22:09,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:22:09,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:22:09,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:22:09,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:22:09,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:22:09,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:22:09,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:22:09,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:22:09,026 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:22:09,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:22:09,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:22:09,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:22:09,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:22:09,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:22:09,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:22:09,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:22:09,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:22:09,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:22:09,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:22:09,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:22:09,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:22:09,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:22:09,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:22:09,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:22:09,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:22:09,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:22:09,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:22:09,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:22:09,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:22:09,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:22:09,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:22:09,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:22:09,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:22:09,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:22:09,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:22:09,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:22:09,036 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f [2024-10-12 18:22:09,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:22:09,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:22:09,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:22:09,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:22:09,396 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:22:09,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2024-10-12 18:22:10,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:22:10,950 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:22:10,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2024-10-12 18:22:10,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edb2bb480/c9392364b1b34f4d9424cc9784713e7f/FLAG44e6928d2 [2024-10-12 18:22:10,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edb2bb480/c9392364b1b34f4d9424cc9784713e7f [2024-10-12 18:22:10,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:22:10,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:22:10,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:22:10,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:22:10,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:22:10,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:22:10" (1/1) ... [2024-10-12 18:22:10,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f838b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:10, skipping insertion in model container [2024-10-12 18:22:10,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:22:10" (1/1) ... [2024-10-12 18:22:11,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:22:11,289 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22317,22330] [2024-10-12 18:22:11,298 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22452,22465] [2024-10-12 18:22:11,300 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22612,22625] [2024-10-12 18:22:11,305 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22941,22954] [2024-10-12 18:22:11,306 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23005,23018] [2024-10-12 18:22:11,309 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23136,23149] [2024-10-12 18:22:11,310 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23200,23213] [2024-10-12 18:22:11,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:22:11,328 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:22:11,361 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22317,22330] [2024-10-12 18:22:11,363 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22452,22465] [2024-10-12 18:22:11,364 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22612,22625] [2024-10-12 18:22:11,366 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22941,22954] [2024-10-12 18:22:11,367 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23005,23018] [2024-10-12 18:22:11,387 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23136,23149] [2024-10-12 18:22:11,387 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23200,23213] [2024-10-12 18:22:11,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:22:11,422 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:22:11,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11 WrapperNode [2024-10-12 18:22:11,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:22:11,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:22:11,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:22:11,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:22:11,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11" (1/1) ... [2024-10-12 18:22:11,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11" (1/1) ... [2024-10-12 18:22:11,470 INFO L138 Inliner]: procedures = 119, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 198 [2024-10-12 18:22:11,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:22:11,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:22:11,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:22:11,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:22:11,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11" (1/1) ... [2024-10-12 18:22:11,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11" (1/1) ... [2024-10-12 18:22:11,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11" (1/1) ... [2024-10-12 18:22:11,514 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-10-12 18:22:11,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11" (1/1) ... [2024-10-12 18:22:11,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11" (1/1) ... [2024-10-12 18:22:11,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11" (1/1) ... [2024-10-12 18:22:11,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11" (1/1) ... [2024-10-12 18:22:11,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11" (1/1) ... [2024-10-12 18:22:11,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11" (1/1) ... [2024-10-12 18:22:11,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:22:11,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:22:11,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:22:11,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:22:11,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11" (1/1) ... [2024-10-12 18:22:11,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:22:11,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:11,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:22:11,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:22:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:22:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:22:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:22:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:22:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:22:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:22:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:22:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:22:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:22:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:22:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:22:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:22:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:22:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:22:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:22:11,724 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:22:11,726 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:22:12,003 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-12 18:22:12,004 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:22:12,044 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:22:12,045 INFO L314 CfgBuilder]: Removed 20 assume(true) statements. [2024-10-12 18:22:12,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:22:12 BoogieIcfgContainer [2024-10-12 18:22:12,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:22:12,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:22:12,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:22:12,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:22:12,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:22:10" (1/3) ... [2024-10-12 18:22:12,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48160ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:22:12, skipping insertion in model container [2024-10-12 18:22:12,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:11" (2/3) ... [2024-10-12 18:22:12,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48160ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:22:12, skipping insertion in model container [2024-10-12 18:22:12,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:22:12" (3/3) ... [2024-10-12 18:22:12,056 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2024-10-12 18:22:12,074 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:22:12,075 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-12 18:22:12,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:22:12,139 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@53e028fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:22:12,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-12 18:22:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 58 states have internal predecessors, (97), 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) [2024-10-12 18:22:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-12 18:22:12,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:12,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-12 18:22:12,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 18:22:12,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:12,159 INFO L85 PathProgramCache]: Analyzing trace with hash 264929569, now seen corresponding path program 1 times [2024-10-12 18:22:12,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:12,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39650489] [2024-10-12 18:22:12,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39650489] [2024-10-12 18:22:12,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39650489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:22:12,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:22:12,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:22:12,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134508714] [2024-10-12 18:22:12,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:22:12,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:22:12,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:12,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:22:12,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:22:12,367 INFO L87 Difference]: Start difference. First operand has 59 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 58 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2024-10-12 18:22:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:12,387 INFO L93 Difference]: Finished difference Result 113 states and 185 transitions. [2024-10-12 18:22:12,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:22:12,389 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2024-10-12 18:22:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:12,395 INFO L225 Difference]: With dead ends: 113 [2024-10-12 18:22:12,396 INFO L226 Difference]: Without dead ends: 55 [2024-10-12 18:22:12,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:22:12,401 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:12,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:22:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-12 18:22:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-12 18:22:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 54 states have internal predecessors, (65), 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) [2024-10-12 18:22:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2024-10-12 18:22:12,488 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 5 [2024-10-12 18:22:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:12,488 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-10-12 18:22:12,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2024-10-12 18:22:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2024-10-12 18:22:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-12 18:22:12,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:12,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-12 18:22:12,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:22:12,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 18:22:12,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:12,491 INFO L85 PathProgramCache]: Analyzing trace with hash -395206852, now seen corresponding path program 1 times [2024-10-12 18:22:12,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:12,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925675177] [2024-10-12 18:22:12,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:12,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:12,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:12,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925675177] [2024-10-12 18:22:12,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925675177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:22:12,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:22:12,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:22:12,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205361777] [2024-10-12 18:22:12,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:22:12,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:22:12,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:12,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:22:12,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:22:12,596 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-10-12 18:22:12,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:12,634 INFO L93 Difference]: Finished difference Result 117 states and 142 transitions. [2024-10-12 18:22:12,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:22:12,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2024-10-12 18:22:12,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:12,636 INFO L225 Difference]: With dead ends: 117 [2024-10-12 18:22:12,636 INFO L226 Difference]: Without dead ends: 63 [2024-10-12 18:22:12,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:22:12,637 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:12,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 119 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:22:12,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-12 18:22:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-10-12 18:22:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 58 states have internal predecessors, (70), 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) [2024-10-12 18:22:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2024-10-12 18:22:12,647 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 6 [2024-10-12 18:22:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:12,647 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2024-10-12 18:22:12,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-10-12 18:22:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-10-12 18:22:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 18:22:12,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:12,648 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:12,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:22:12,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 18:22:12,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:12,649 INFO L85 PathProgramCache]: Analyzing trace with hash 338976657, now seen corresponding path program 1 times [2024-10-12 18:22:12,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:12,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362575789] [2024-10-12 18:22:12,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:12,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 18:22:12,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:12,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362575789] [2024-10-12 18:22:12,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362575789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:22:12,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:22:12,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:22:12,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187190954] [2024-10-12 18:22:12,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:22:12,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:22:12,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:12,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:22:12,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:22:12,777 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-12 18:22:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:12,857 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2024-10-12 18:22:12,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:22:12,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 10 [2024-10-12 18:22:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:12,860 INFO L225 Difference]: With dead ends: 97 [2024-10-12 18:22:12,860 INFO L226 Difference]: Without dead ends: 95 [2024-10-12 18:22:12,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:22:12,861 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 150 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:12,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 71 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:22:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-12 18:22:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 57. [2024-10-12 18:22:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 56 states have internal predecessors, (68), 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) [2024-10-12 18:22:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-10-12 18:22:12,871 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 10 [2024-10-12 18:22:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:12,871 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-10-12 18:22:12,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-12 18:22:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-10-12 18:22:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:22:12,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:12,872 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:12,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:22:12,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 18:22:12,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:12,873 INFO L85 PathProgramCache]: Analyzing trace with hash 702330627, now seen corresponding path program 1 times [2024-10-12 18:22:12,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:12,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584740414] [2024-10-12 18:22:12,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:12,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:13,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:13,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584740414] [2024-10-12 18:22:13,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584740414] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:22:13,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596971097] [2024-10-12 18:22:13,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:13,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:13,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:13,724 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) [2024-10-12 18:22:13,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:22:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:13,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-12 18:22:13,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:22:13,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:22:13,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:22:13,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-12 18:22:13,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-10-12 18:22:13,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:22:13,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-10-12 18:22:13,974 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:22:13,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 18:22:14,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:14,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:22:14,251 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_47| Int) (v_ArrVal_126 (Array Int Int)) (v_ArrVal_125 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_47|) 0)) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_125 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_125)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_125) |v_ULTIMATE.start_main_~x~0#1.base_47| v_ArrVal_126) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0))) is different from false [2024-10-12 18:22:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-12 18:22:14,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596971097] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:22:14,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:22:14,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2024-10-12 18:22:14,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549897747] [2024-10-12 18:22:14,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:22:14,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 18:22:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:14,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 18:22:14,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=4, NotChecked=28, Total=272 [2024-10-12 18:22:14,269 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 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) [2024-10-12 18:22:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:14,905 INFO L93 Difference]: Finished difference Result 158 states and 195 transitions. [2024-10-12 18:22:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 18:22:14,906 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 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) Word has length 17 [2024-10-12 18:22:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:14,908 INFO L225 Difference]: With dead ends: 158 [2024-10-12 18:22:14,908 INFO L226 Difference]: Without dead ends: 102 [2024-10-12 18:22:14,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=4, NotChecked=50, Total=756 [2024-10-12 18:22:14,911 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 152 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:14,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 538 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 312 Invalid, 0 Unknown, 79 Unchecked, 0.3s Time] [2024-10-12 18:22:14,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-12 18:22:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2024-10-12 18:22:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.3125) internal successors, (84), 69 states have internal predecessors, (84), 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) [2024-10-12 18:22:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2024-10-12 18:22:14,924 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 17 [2024-10-12 18:22:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:14,925 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2024-10-12 18:22:14,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 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) [2024-10-12 18:22:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2024-10-12 18:22:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 18:22:14,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:14,927 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:14,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:22:15,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:15,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 18:22:15,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1251712327, now seen corresponding path program 1 times [2024-10-12 18:22:15,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:15,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861264548] [2024-10-12 18:22:15,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:15,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:15,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861264548] [2024-10-12 18:22:15,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861264548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:22:15,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023992223] [2024-10-12 18:22:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:15,569 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) [2024-10-12 18:22:15,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 18:22:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:15,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-12 18:22:15,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:22:15,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:22:15,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-10-12 18:22:15,711 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:22:15,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-12 18:22:15,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-12 18:22:15,731 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:22:15,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 18:22:15,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-10-12 18:22:15,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:15,794 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-12 18:22:15,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2024-10-12 18:22:15,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-12 18:22:15,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 18:22:15,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-12 18:22:15,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-12 18:22:15,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:15,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:22:16,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 49 [2024-10-12 18:22:16,016 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_200 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_198 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2024-10-12 18:22:16,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:16,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-10-12 18:22:16,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:16,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2024-10-12 18:22:16,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:16,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 47 [2024-10-12 18:22:16,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-10-12 18:22:16,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:16,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2024-10-12 18:22:16,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-10-12 18:22:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:16,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023992223] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:22:16,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:22:16,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-10-12 18:22:16,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071796067] [2024-10-12 18:22:16,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:22:16,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 18:22:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:16,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 18:22:16,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=175, Unknown=1, NotChecked=26, Total=240 [2024-10-12 18:22:16,132 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 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) [2024-10-12 18:22:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:16,411 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2024-10-12 18:22:16,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 18:22:16,412 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 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) Word has length 20 [2024-10-12 18:22:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:16,413 INFO L225 Difference]: With dead ends: 97 [2024-10-12 18:22:16,413 INFO L226 Difference]: Without dead ends: 95 [2024-10-12 18:22:16,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=306, Unknown=1, NotChecked=36, Total=420 [2024-10-12 18:22:16,414 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 117 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:16,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 444 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 266 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2024-10-12 18:22:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-12 18:22:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 76. [2024-10-12 18:22:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 75 states have internal predecessors, (92), 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) [2024-10-12 18:22:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2024-10-12 18:22:16,421 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 20 [2024-10-12 18:22:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:16,422 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2024-10-12 18:22:16,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 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) [2024-10-12 18:22:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2024-10-12 18:22:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 18:22:16,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:16,423 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:16,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 18:22:16,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:16,624 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 18:22:16,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:16,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1700093902, now seen corresponding path program 1 times [2024-10-12 18:22:16,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:16,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143355998] [2024-10-12 18:22:16,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:17,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:17,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143355998] [2024-10-12 18:22:17,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143355998] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:22:17,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453271158] [2024-10-12 18:22:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:17,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:17,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:17,049 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) [2024-10-12 18:22:17,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 18:22:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:17,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 18:22:17,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:22:17,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:22:17,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:22:17,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:22:17,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-10-12 18:22:17,230 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:22:17,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-12 18:22:17,251 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:22:17,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:22:17,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:17,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:22:17,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-10-12 18:22:17,333 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:22:17,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2024-10-12 18:22:17,353 INFO L349 Elim1Store]: treesize reduction 19, result has 13.6 percent of original size [2024-10-12 18:22:17,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 9 [2024-10-12 18:22:17,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:17,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:22:17,452 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0)) is different from false [2024-10-12 18:22:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-12 18:22:17,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453271158] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:22:17,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:22:17,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-10-12 18:22:17,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911936693] [2024-10-12 18:22:17,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:22:17,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 18:22:17,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:17,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 18:22:17,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=158, Unknown=2, NotChecked=26, Total=240 [2024-10-12 18:22:17,578 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 15 states have internal predecessors, (50), 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) [2024-10-12 18:22:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:17,952 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2024-10-12 18:22:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 18:22:17,952 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 15 states have internal predecessors, (50), 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) Word has length 21 [2024-10-12 18:22:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:17,954 INFO L225 Difference]: With dead ends: 140 [2024-10-12 18:22:17,954 INFO L226 Difference]: Without dead ends: 138 [2024-10-12 18:22:17,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=372, Unknown=2, NotChecked=42, Total=552 [2024-10-12 18:22:17,955 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 294 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:17,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 366 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 227 Invalid, 0 Unknown, 118 Unchecked, 0.2s Time] [2024-10-12 18:22:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-12 18:22:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 81. [2024-10-12 18:22:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.32) internal successors, (99), 80 states have internal predecessors, (99), 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) [2024-10-12 18:22:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2024-10-12 18:22:17,967 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 21 [2024-10-12 18:22:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:17,968 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2024-10-12 18:22:17,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 15 states have internal predecessors, (50), 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) [2024-10-12 18:22:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2024-10-12 18:22:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 18:22:17,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:17,969 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:17,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 18:22:18,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:18,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 18:22:18,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:18,176 INFO L85 PathProgramCache]: Analyzing trace with hash 148782236, now seen corresponding path program 1 times [2024-10-12 18:22:18,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:18,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118800551] [2024-10-12 18:22:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:18,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:18,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118800551] [2024-10-12 18:22:18,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118800551] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:22:18,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054197108] [2024-10-12 18:22:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:18,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:18,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:18,919 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) [2024-10-12 18:22:18,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 18:22:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:19,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-12 18:22:19,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:22:19,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:22:19,081 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:22:19,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:22:19,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-10-12 18:22:19,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:19,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-10-12 18:22:19,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:19,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:19,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:22:19,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:19,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:22:19,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 53 [2024-10-12 18:22:19,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2024-10-12 18:22:19,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:22:19,275 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-10-12 18:22:19,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 76 [2024-10-12 18:22:19,294 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:22:19,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 15 [2024-10-12 18:22:19,311 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:22:19,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2024-10-12 18:22:19,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-10-12 18:22:19,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:22:19,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-12 18:22:19,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:22:19,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:19,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-12 18:22:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:19,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:22:19,568 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_440) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)) 0)) is different from false [2024-10-12 18:22:19,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:19,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 51 [2024-10-12 18:22:19,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:19,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2024-10-12 18:22:19,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2024-10-12 18:22:19,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:19,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 88 [2024-10-12 18:22:19,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:19,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 108 [2024-10-12 18:22:19,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:19,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 402 treesize of output 281 [2024-10-12 18:22:19,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 141 [2024-10-12 18:22:19,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 139 [2024-10-12 18:22:19,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 135 [2024-10-12 18:22:19,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 131 [2024-10-12 18:22:19,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:19,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 181 [2024-10-12 18:22:19,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 163 [2024-10-12 18:22:19,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 159 [2024-10-12 18:22:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-12 18:22:20,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054197108] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:22:20,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:22:20,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-10-12 18:22:20,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842815823] [2024-10-12 18:22:20,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:22:20,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-12 18:22:20,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:20,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 18:22:20,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=386, Unknown=2, NotChecked=40, Total=506 [2024-10-12 18:22:20,444 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 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) [2024-10-12 18:22:31,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-12 18:22:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:32,643 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2024-10-12 18:22:32,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 18:22:32,643 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 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) Word has length 24 [2024-10-12 18:22:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:32,644 INFO L225 Difference]: With dead ends: 163 [2024-10-12 18:22:32,644 INFO L226 Difference]: Without dead ends: 128 [2024-10-12 18:22:32,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=140, Invalid=671, Unknown=5, NotChecked=54, Total=870 [2024-10-12 18:22:32,646 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 149 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 15 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:32,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 699 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 490 Invalid, 5 Unknown, 102 Unchecked, 5.4s Time] [2024-10-12 18:22:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-12 18:22:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2024-10-12 18:22:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 94 states have internal predecessors, (117), 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) [2024-10-12 18:22:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2024-10-12 18:22:32,656 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 24 [2024-10-12 18:22:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:32,656 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2024-10-12 18:22:32,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 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) [2024-10-12 18:22:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2024-10-12 18:22:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 18:22:32,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:32,658 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:32,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 18:22:32,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:32,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 18:22:32,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash -660564390, now seen corresponding path program 1 times [2024-10-12 18:22:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:32,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346075357] [2024-10-12 18:22:32,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:32,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 18:22:32,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:32,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346075357] [2024-10-12 18:22:32,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346075357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:22:32,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:22:32,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:22:32,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761631830] [2024-10-12 18:22:32,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:22:32,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:22:32,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:32,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:22:32,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:22:32,968 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) [2024-10-12 18:22:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:33,066 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2024-10-12 18:22:33,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:22:33,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) Word has length 24 [2024-10-12 18:22:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:33,067 INFO L225 Difference]: With dead ends: 143 [2024-10-12 18:22:33,068 INFO L226 Difference]: Without dead ends: 105 [2024-10-12 18:22:33,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:22:33,068 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:33,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 175 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:22:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-12 18:22:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2024-10-12 18:22:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 97 states have internal predecessors, (120), 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) [2024-10-12 18:22:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2024-10-12 18:22:33,079 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 24 [2024-10-12 18:22:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:33,079 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2024-10-12 18:22:33,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) [2024-10-12 18:22:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2024-10-12 18:22:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 18:22:33,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:33,080 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:33,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 18:22:33,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 18:22:33,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:33,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1044619042, now seen corresponding path program 1 times [2024-10-12 18:22:33,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:33,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072316019] [2024-10-12 18:22:33,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:33,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:33,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:33,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:33,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072316019] [2024-10-12 18:22:33,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072316019] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:22:33,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390784783] [2024-10-12 18:22:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:33,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:33,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:33,723 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) [2024-10-12 18:22:33,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 18:22:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:33,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-12 18:22:33,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:22:33,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:22:33,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-10-12 18:22:33,874 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:22:33,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-12 18:22:33,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-10-12 18:22:33,895 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:22:33,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-12 18:22:33,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-12 18:22:33,919 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:22:33,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:22:33,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:33,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:22:33,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:34,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:22:34,045 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-10-12 18:22:34,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 76 [2024-10-12 18:22:34,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:22:34,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2024-10-12 18:22:34,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-10-12 18:22:34,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:22:34,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2024-10-12 18:22:34,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:22:34,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 53 [2024-10-12 18:22:34,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2024-10-12 18:22:34,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-12 18:22:34,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-12 18:22:34,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:34,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-10-12 18:22:34,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-12 18:22:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:34,449 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:22:34,514 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_617 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_617) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_616) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)) 1)) is different from false [2024-10-12 18:22:34,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:34,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2024-10-12 18:22:34,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:34,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 51 [2024-10-12 18:22:34,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:34,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2024-10-12 18:22:34,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:34,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2024-10-12 18:22:39,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:39,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 218 [2024-10-12 18:22:39,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:39,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 178 [2024-10-12 18:22:39,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:39,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 760 treesize of output 539 [2024-10-12 18:22:39,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:39,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 628 treesize of output 611 [2024-10-12 18:22:39,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 479 treesize of output 477 [2024-10-12 18:22:39,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 477 treesize of output 473 [2024-10-12 18:22:39,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 473 treesize of output 471 [2024-10-12 18:22:39,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 471 treesize of output 467 [2024-10-12 18:22:39,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 467 treesize of output 465 [2024-10-12 18:22:39,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 465 treesize of output 461 [2024-10-12 18:22:39,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 461 treesize of output 459 [2024-10-12 18:22:39,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 459 treesize of output 455 [2024-10-12 18:22:39,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 455 treesize of output 453 [2024-10-12 18:22:39,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 453 treesize of output 449 [2024-10-12 18:22:39,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 449 treesize of output 447 [2024-10-12 18:22:39,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 447 treesize of output 443 [2024-10-12 18:22:39,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 443 treesize of output 439 [2024-10-12 18:22:39,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 439 treesize of output 431 [2024-10-12 18:22:39,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 431 treesize of output 429 [2024-10-12 18:22:39,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 429 treesize of output 425 [2024-10-12 18:22:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-12 18:22:41,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390784783] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:22:41,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:22:41,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2024-10-12 18:22:41,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740494957] [2024-10-12 18:22:41,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:22:41,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-12 18:22:41,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:41,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 18:22:41,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=354, Unknown=3, NotChecked=38, Total=462 [2024-10-12 18:22:41,803 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 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) [2024-10-12 18:22:50,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-12 18:22:55,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-12 18:23:04,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-12 18:23:08,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-12 18:23:13,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-12 18:23:17,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-12 18:23:21,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-12 18:23:23,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-12 18:23:27,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-12 18:23:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:23:34,898 INFO L93 Difference]: Finished difference Result 191 states and 235 transitions. [2024-10-12 18:23:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 18:23:34,899 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 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) Word has length 24 [2024-10-12 18:23:34,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:23:34,900 INFO L225 Difference]: With dead ends: 191 [2024-10-12 18:23:34,900 INFO L226 Difference]: Without dead ends: 189 [2024-10-12 18:23:34,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=165, Invalid=888, Unknown=7, NotChecked=62, Total=1122 [2024-10-12 18:23:34,901 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 287 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 21 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 41.6s IncrementalHoareTripleChecker+Time [2024-10-12 18:23:34,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 777 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 588 Invalid, 10 Unknown, 147 Unchecked, 41.6s Time] [2024-10-12 18:23:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-12 18:23:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 109. [2024-10-12 18:23:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 108 states have internal predecessors, (136), 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) [2024-10-12 18:23:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 136 transitions. [2024-10-12 18:23:34,911 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 136 transitions. Word has length 24 [2024-10-12 18:23:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:23:34,911 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 136 transitions. [2024-10-12 18:23:34,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 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) [2024-10-12 18:23:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 136 transitions. [2024-10-12 18:23:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 18:23:34,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:23:34,912 INFO L215 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, 1, 1, 1] [2024-10-12 18:23:34,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 18:23:35,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:23:35,113 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 18:23:35,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:23:35,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1571921691, now seen corresponding path program 1 times [2024-10-12 18:23:35,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:23:35,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234343427] [2024-10-12 18:23:35,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:23:35,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:23:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:23:37,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:23:37,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:23:37,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234343427] [2024-10-12 18:23:37,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234343427] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:23:37,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590182816] [2024-10-12 18:23:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:23:37,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:23:37,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:23:37,380 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:23:37,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 18:23:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:23:37,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-12 18:23:37,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:23:37,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:23:37,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:23:38,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:23:38,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-10-12 18:23:38,206 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:23:38,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-12 18:23:38,508 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-12 18:23:38,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-12 18:23:38,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:23:40,469 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:23:40,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-12 18:23:40,675 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:23:40,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 18:23:41,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:23:41,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2024-10-12 18:23:41,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:23:41,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-10-12 18:23:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:23:41,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:23:42,384 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.base_13| Int) (v_ArrVal_744 Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int#1| |v_ULTIMATE.start_main_~tmp~0#1.base_13| v_ArrVal_743))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_744))) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_13|) 0)))) is different from false [2024-10-12 18:23:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:23:45,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590182816] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:23:45,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:23:45,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 24 [2024-10-12 18:23:45,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650175713] [2024-10-12 18:23:45,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:23:45,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-12 18:23:45,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:23:45,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 18:23:45,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=424, Unknown=9, NotChecked=44, Total=600 [2024-10-12 18:23:45,168 INFO L87 Difference]: Start difference. First operand 109 states and 136 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 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) [2024-10-12 18:23:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:23:49,791 INFO L93 Difference]: Finished difference Result 232 states and 283 transitions. [2024-10-12 18:23:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 18:23:49,792 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 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) Word has length 26 [2024-10-12 18:23:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:23:49,793 INFO L225 Difference]: With dead ends: 232 [2024-10-12 18:23:49,793 INFO L226 Difference]: Without dead ends: 167 [2024-10-12 18:23:49,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=224, Invalid=641, Unknown=9, NotChecked=56, Total=930 [2024-10-12 18:23:49,795 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 274 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:23:49,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 455 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 295 Invalid, 1 Unknown, 111 Unchecked, 3.1s Time] [2024-10-12 18:23:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-12 18:23:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 131. [2024-10-12 18:23:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 125 states have (on average 1.288) internal successors, (161), 130 states have internal predecessors, (161), 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) [2024-10-12 18:23:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2024-10-12 18:23:49,811 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 161 transitions. Word has length 26 [2024-10-12 18:23:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:23:49,811 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 161 transitions. [2024-10-12 18:23:49,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 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) [2024-10-12 18:23:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 161 transitions. [2024-10-12 18:23:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 18:23:49,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:23:49,813 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:23:49,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 18:23:50,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:23:50,014 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 18:23:50,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:23:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash 960418098, now seen corresponding path program 1 times [2024-10-12 18:23:50,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:23:50,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703030502] [2024-10-12 18:23:50,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:23:50,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:23:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat