./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-08 13:54:40,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:54:40,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:54:40,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:54:40,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:54:40,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:54:40,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:54:40,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:54:40,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:54:40,650 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:54:40,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:54:40,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:54:40,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:54:40,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:54:40,654 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:54:40,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:54:40,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:54:40,654 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:54:40,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:54:40,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:54:40,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:54:40,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:54:40,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:54:40,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:54:40,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:54:40,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:54:40,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:54:40,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:54:40,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:54:40,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:54:40,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:54:40,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:54:40,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:54:40,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:54:40,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:54:40,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:54:40,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:54:40,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:54:40,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:54:40,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:54:40,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:54:40,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:54:40,664 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-11-08 13:54:40,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:54:40,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:54:40,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:54:40,959 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:54:40,959 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:54:40,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-sorted-2.i [2024-11-08 13:54:42,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:54:42,736 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:54:42,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2024-11-08 13:54:42,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c078247/edb38476ea6c4577aa579e4e1dfac171/FLAG51aad12ca [2024-11-08 13:54:43,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c078247/edb38476ea6c4577aa579e4e1dfac171 [2024-11-08 13:54:43,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:54:43,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:54:43,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:54:43,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:54:43,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:54:43,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ed30e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43, skipping insertion in model container [2024-11-08 13:54:43,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:54:43,419 WARN L250 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-11-08 13:54:43,426 WARN L250 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-11-08 13:54:43,427 WARN L250 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-11-08 13:54:43,432 WARN L250 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-11-08 13:54:43,432 WARN L250 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-11-08 13:54:43,434 WARN L250 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-11-08 13:54:43,436 WARN L250 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-11-08 13:54:43,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:54:43,453 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:54:43,506 WARN L250 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-11-08 13:54:43,508 WARN L250 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-11-08 13:54:43,509 WARN L250 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-11-08 13:54:43,512 WARN L250 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-11-08 13:54:43,513 WARN L250 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-11-08 13:54:43,514 WARN L250 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-11-08 13:54:43,525 WARN L250 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-11-08 13:54:43,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:54:43,557 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:54:43,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43 WrapperNode [2024-11-08 13:54:43,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:54:43,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:54:43,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:54:43,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:54:43,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,603 INFO L138 Inliner]: procedures = 119, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 198 [2024-11-08 13:54:43,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:54:43,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:54:43,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:54:43,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:54:43,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,638 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-11-08 13:54:43,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:54:43,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:54:43,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:54:43,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:54:43,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43" (1/1) ... [2024-11-08 13:54:43,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:54:43,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:54:43,697 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-11-08 13:54:43,701 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-11-08 13:54:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:54:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:54:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:54:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:54:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:54:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:54:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:54:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:54:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:54:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:54:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:54:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:54:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:54:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:54:43,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:54:43,912 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:54:43,914 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:54:44,208 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-08 13:54:44,209 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:54:44,226 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:54:44,227 INFO L316 CfgBuilder]: Removed 20 assume(true) statements. [2024-11-08 13:54:44,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:54:44 BoogieIcfgContainer [2024-11-08 13:54:44,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:54:44,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:54:44,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:54:44,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:54:44,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:54:43" (1/3) ... [2024-11-08 13:54:44,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1187b589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:54:44, skipping insertion in model container [2024-11-08 13:54:44,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:54:43" (2/3) ... [2024-11-08 13:54:44,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1187b589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:54:44, skipping insertion in model container [2024-11-08 13:54:44,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:54:44" (3/3) ... [2024-11-08 13:54:44,237 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2024-11-08 13:54:44,251 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:54:44,252 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-08 13:54:44,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:54:44,330 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;@22df5ba4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:54:44,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 13:54:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 54 states have (on average 1.8518518518518519) internal successors, (100), 61 states have internal predecessors, (100), 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-11-08 13:54:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 13:54:44,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:44,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 13:54:44,344 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-11-08 13:54:44,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash 890153286, now seen corresponding path program 1 times [2024-11-08 13:54:44,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:44,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463982287] [2024-11-08 13:54:44,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:44,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:44,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:54:44,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463982287] [2024-11-08 13:54:44,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463982287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:54:44,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:54:44,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:54:44,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671908617] [2024-11-08 13:54:44,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:54:44,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:54:44,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:54:44,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:54:44,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:54:44,613 INFO L87 Difference]: Start difference. First operand has 62 states, 54 states have (on average 1.8518518518518519) internal successors, (100), 61 states have internal predecessors, (100), 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 3.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-11-08 13:54:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:54:44,637 INFO L93 Difference]: Finished difference Result 118 states and 190 transitions. [2024-11-08 13:54:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:54:44,639 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.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-11-08 13:54:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:54:44,647 INFO L225 Difference]: With dead ends: 118 [2024-11-08 13:54:44,648 INFO L226 Difference]: Without dead ends: 56 [2024-11-08 13:54:44,651 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-11-08 13:54:44,655 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:54:44,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:54:44,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-08 13:54:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-08 13:54:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.346938775510204) internal successors, (66), 55 states have internal predecessors, (66), 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-11-08 13:54:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2024-11-08 13:54:44,727 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 6 [2024-11-08 13:54:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:54:44,729 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2024-11-08 13:54:44,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.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-11-08 13:54:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-11-08 13:54:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 13:54:44,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:44,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:54:44,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:54:44,770 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-11-08 13:54:44,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:44,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1806859191, now seen corresponding path program 1 times [2024-11-08 13:54:44,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:44,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742232283] [2024-11-08 13:54:44,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:44,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:44,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:54:44,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742232283] [2024-11-08 13:54:44,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742232283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:54:44,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:54:44,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:54:44,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469145691] [2024-11-08 13:54:44,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:54:44,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:54:44,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:54:44,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:54:44,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:54:44,853 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11-08 13:54:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:54:44,916 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2024-11-08 13:54:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:54:44,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-08 13:54:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:54:44,918 INFO L225 Difference]: With dead ends: 118 [2024-11-08 13:54:44,918 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 13:54:44,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:54:44,921 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:54:44,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 122 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:54:44,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 13:54:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-11-08 13:54:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 59 states have internal predecessors, (71), 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-11-08 13:54:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-11-08 13:54:44,935 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 7 [2024-11-08 13:54:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:54:44,936 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-11-08 13:54:44,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11-08 13:54:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-11-08 13:54:44,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 13:54:44,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:44,937 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:54:44,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:54:44,938 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-11-08 13:54:44,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash 443319948, now seen corresponding path program 1 times [2024-11-08 13:54:44,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:44,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894317541] [2024-11-08 13:54:44,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:44,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 13:54:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:54:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894317541] [2024-11-08 13:54:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894317541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:54:45,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:54:45,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:54:45,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197557437] [2024-11-08 13:54:45,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:54:45,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:54:45,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:54:45,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:54:45,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:54:45,106 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-11-08 13:54:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:54:45,221 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2024-11-08 13:54:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:54:45,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2024-11-08 13:54:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:54:45,224 INFO L225 Difference]: With dead ends: 98 [2024-11-08 13:54:45,224 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 13:54:45,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:54:45,226 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 150 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:54:45,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 75 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:54:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 13:54:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 58. [2024-11-08 13:54:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 57 states have internal predecessors, (69), 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-11-08 13:54:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2024-11-08 13:54:45,243 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 11 [2024-11-08 13:54:45,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:54:45,243 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2024-11-08 13:54:45,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-11-08 13:54:45,244 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2024-11-08 13:54:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 13:54:45,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:45,244 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:54:45,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:54:45,245 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-11-08 13:54:45,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2064961448, now seen corresponding path program 1 times [2024-11-08 13:54:45,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:45,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997884241] [2024-11-08 13:54:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:45,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:46,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:54:46,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997884241] [2024-11-08 13:54:46,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997884241] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:54:46,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232850305] [2024-11-08 13:54:46,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:46,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:54:46,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:54:46,118 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-11-08 13:54:46,119 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-11-08 13:54:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:46,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 13:54:46,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:54:46,293 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-11-08 13:54:46,305 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-11-08 13:54:46,381 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-11-08 13:54:46,393 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-11-08 13:54:46,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:46,400 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-11-08 13:54:46,417 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:54:46,418 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-11-08 13:54:46,456 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-11-08 13:54:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:46,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:54:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:46,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232850305] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:54:46,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:54:46,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2024-11-08 13:54:46,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994703920] [2024-11-08 13:54:46,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:54:46,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 13:54:46,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:54:46,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 13:54:46,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=228, Unknown=5, NotChecked=0, Total=272 [2024-11-08 13:54:46,777 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 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-11-08 13:54:50,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:54:50,320 INFO L93 Difference]: Finished difference Result 201 states and 253 transitions. [2024-11-08 13:54:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 13:54:50,321 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 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 18 [2024-11-08 13:54:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:54:50,322 INFO L225 Difference]: With dead ends: 201 [2024-11-08 13:54:50,322 INFO L226 Difference]: Without dead ends: 145 [2024-11-08 13:54:50,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=913, Unknown=9, NotChecked=0, Total=1122 [2024-11-08 13:54:50,324 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 242 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 38 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:54:50,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 705 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 470 Invalid, 9 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 13:54:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-08 13:54:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 84. [2024-11-08 13:54:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 83 states have internal predecessors, (103), 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-11-08 13:54:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2024-11-08 13:54:50,339 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 18 [2024-11-08 13:54:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:54:50,340 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-11-08 13:54:50,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 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-11-08 13:54:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2024-11-08 13:54:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 13:54:50,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:50,341 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] [2024-11-08 13:54:50,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 13:54:50,548 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-11-08 13:54:50,549 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-11-08 13:54:50,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash -644381054, now seen corresponding path program 1 times [2024-11-08 13:54:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:50,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761710012] [2024-11-08 13:54:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:51,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:54:51,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761710012] [2024-11-08 13:54:51,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761710012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:54:51,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365413796] [2024-11-08 13:54:51,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:51,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:54:51,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:54:51,051 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-11-08 13:54:51,052 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-11-08 13:54:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:51,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-08 13:54:51,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:54:51,157 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-11-08 13:54:51,193 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-11-08 13:54:51,211 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 13:54:51,212 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-11-08 13:54:51,236 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:54:51,236 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-11-08 13:54:51,243 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-11-08 13:54:51,248 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-11-08 13:54:51,282 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:54:51,283 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-11-08 13:54:51,289 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-11-08 13:54:51,297 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-11-08 13:54:51,466 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-11-08 13:54:51,473 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-11-08 13:54:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:51,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:54:51,578 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-11-08 13:54:51,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:51,647 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-11-08 13:54:51,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:51,655 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 29 treesize of output 30 [2024-11-08 13:54:51,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:51,671 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-11-08 13:54:51,678 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-11-08 13:54:51,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:51,694 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-11-08 13:54:51,704 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-11-08 13:54:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:51,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365413796] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:54:51,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:54:51,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2024-11-08 13:54:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518442595] [2024-11-08 13:54:51,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:54:51,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 13:54:51,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:54:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 13:54:51,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=199, Unknown=2, NotChecked=0, Total=240 [2024-11-08 13:54:51,826 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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-11-08 13:54:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:54:52,333 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2024-11-08 13:54:52,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 13:54:52,333 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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-11-08 13:54:52,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:54:52,335 INFO L225 Difference]: With dead ends: 111 [2024-11-08 13:54:52,335 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 13:54:52,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=339, Unknown=2, NotChecked=0, Total=420 [2024-11-08 13:54:52,336 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 55 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 13:54:52,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 547 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 13:54:52,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 13:54:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2024-11-08 13:54:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 89 states have internal predecessors, (111), 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-11-08 13:54:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2024-11-08 13:54:52,356 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 21 [2024-11-08 13:54:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:54:52,356 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2024-11-08 13:54:52,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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-11-08 13:54:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2024-11-08 13:54:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 13:54:52,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:52,357 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:54:52,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 13:54:52,558 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-11-08 13:54:52,559 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-11-08 13:54:52,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:52,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1244226061, now seen corresponding path program 1 times [2024-11-08 13:54:52,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:52,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968509507] [2024-11-08 13:54:52,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:52,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:52,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-11-08 13:54:52,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:54:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968509507] [2024-11-08 13:54:52,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968509507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:54:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247371679] [2024-11-08 13:54:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:52,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:54:52,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:54:52,920 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-11-08 13:54:52,922 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-11-08 13:54:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:53,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 13:54:53,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:54:53,043 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-11-08 13:54:53,049 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-11-08 13:54:53,092 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:54:53,092 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-11-08 13:54:53,100 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-11-08 13:54:53,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:53,105 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-11-08 13:54:53,118 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-11-08 13:54:53,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-08 13:54:53,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:53,165 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 14 treesize of output 14 [2024-11-08 13:54:53,169 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 8 treesize of output 7 [2024-11-08 13:54:53,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2024-11-08 13:54:53,184 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 8 treesize of output 7 [2024-11-08 13:54:53,207 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 13:54:53,207 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 21 treesize of output 15 [2024-11-08 13:54:53,220 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 9 treesize of output 8 [2024-11-08 13:54:53,225 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 8 treesize of output 7 [2024-11-08 13:54:53,233 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-11-08 13:54:53,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:53,252 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-08 13:54:53,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2024-11-08 13:54:53,315 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 13:54:53,315 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 20 treesize of output 19 [2024-11-08 13:54:53,325 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 23 treesize of output 11 [2024-11-08 13:54:53,331 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 23 treesize of output 11 [2024-11-08 13:54:53,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:53,554 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 76 treesize of output 68 [2024-11-08 13:54:53,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:53,565 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 60 treesize of output 52 [2024-11-08 13:54:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:53,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:54:53,808 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_319 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= v_ArrVal_319 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_319 .cse0)))))) (forall ((v_ArrVal_317 (Array Int Int))) (or (not (= v_ArrVal_317 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_317 .cse0)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))))) is different from false [2024-11-08 13:54:53,877 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 13:54:53,877 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 2 case distinctions, treesize of input 168 treesize of output 179 [2024-11-08 13:54:53,889 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 94 treesize of output 92 [2024-11-08 13:54:53,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:53,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 137 [2024-11-08 13:54:53,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:53,939 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 147 treesize of output 152 [2024-11-08 13:54:53,990 INFO L349 Elim1Store]: treesize reduction 26, result has 53.6 percent of original size [2024-11-08 13:54:53,994 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 163 [2024-11-08 13:54:54,141 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 8 treesize of output 6 [2024-11-08 13:54:54,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:54,211 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 93 [2024-11-08 13:54:54,587 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-11-08 13:54:54,595 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:54:54,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 16 [2024-11-08 13:54:54,768 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_53| Int) (v_ArrVal_307 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_52| Int) (v_ArrVal_318 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_307) |v_ULTIMATE.start_main_~x~0#1.base_53| v_ArrVal_314) |v_ULTIMATE.start_main_~x~0#1.base_52| v_ArrVal_318) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0) (not (= v_ArrVal_307 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_307 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_53|) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_53| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_53|) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (or (not (= v_ArrVal_307 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_307 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_52| Int) (v_ArrVal_318 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_307) |v_ULTIMATE.start_main_~x~0#1.base_53| v_ArrVal_314) |v_ULTIMATE.start_main_~x~0#1.base_52| v_ArrVal_318) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_~x~0#1.base_52|))))))))) is different from false [2024-11-08 13:54:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-08 13:54:54,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247371679] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:54:54,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:54:54,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2024-11-08 13:54:54,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190991846] [2024-11-08 13:54:54,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:54:54,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 13:54:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:54:54,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 13:54:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=272, Unknown=11, NotChecked=70, Total=420 [2024-11-08 13:54:54,812 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 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-11-08 13:54:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:54:55,478 INFO L93 Difference]: Finished difference Result 154 states and 184 transitions. [2024-11-08 13:54:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 13:54:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 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 22 [2024-11-08 13:54:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:54:55,479 INFO L225 Difference]: With dead ends: 154 [2024-11-08 13:54:55,479 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 13:54:55,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=650, Unknown=14, NotChecked=114, Total=992 [2024-11-08 13:54:55,481 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 311 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 13:54:55,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 653 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 401 Invalid, 0 Unknown, 237 Unchecked, 0.3s Time] [2024-11-08 13:54:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 13:54:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 82. [2024-11-08 13:54:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 81 states have internal predecessors, (100), 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-11-08 13:54:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2024-11-08 13:54:55,492 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 22 [2024-11-08 13:54:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:54:55,492 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2024-11-08 13:54:55,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 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-11-08 13:54:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2024-11-08 13:54:55,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 13:54:55,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:55,493 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, 1] [2024-11-08 13:54:55,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 13:54:55,694 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-11-08 13:54:55,694 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-11-08 13:54:55,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:55,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2029850711, now seen corresponding path program 1 times [2024-11-08 13:54:55,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:55,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934005878] [2024-11-08 13:54:55,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:55,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:56,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:54:56,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934005878] [2024-11-08 13:54:56,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934005878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:54:56,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709090988] [2024-11-08 13:54:56,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:56,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:54:56,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:54:56,566 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-11-08 13:54:56,568 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-11-08 13:54:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:56,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-08 13:54:56,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:54:56,694 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-11-08 13:54:56,726 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:54:56,727 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-11-08 13:54:56,736 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-11-08 13:54:56,740 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-11-08 13:54:56,748 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-11-08 13:54:56,752 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-11-08 13:54:56,808 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-11-08 13:54:56,814 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-11-08 13:54:56,837 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-11-08 13:54:56,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:56,910 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 71 treesize of output 54 [2024-11-08 13:54:56,919 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-11-08 13:54:56,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:56,943 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-11-08 13:54:56,944 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 106 treesize of output 77 [2024-11-08 13:54:56,962 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 13:54:56,963 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-11-08 13:54:56,983 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:54:56,983 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-11-08 13:54:56,992 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 39 treesize of output 15 [2024-11-08 13:54:56,996 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-11-08 13:54:57,048 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-11-08 13:54:57,055 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-11-08 13:54:57,059 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-11-08 13:54:57,162 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-11-08 13:54:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:57,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:54:57,284 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_59| Int) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_59|) 0)) (not (= v_ArrVal_440 (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_440 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_440) |v_ULTIMATE.start_main_~x~0#1.base_59| v_ArrVal_442) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_435) |v_ULTIMATE.start_main_~x~0#1.base_59| v_ArrVal_441) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_438) |v_ULTIMATE.start_main_~x~0#1.base_59| v_ArrVal_443) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)) 0))) is different from false [2024-11-08 13:54:57,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:57,315 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 186 treesize of output 190 [2024-11-08 13:54:57,321 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 158 treesize of output 130 [2024-11-08 13:54:57,341 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 17 treesize of output 3 [2024-11-08 13:54:57,360 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 120 treesize of output 106 [2024-11-08 13:54:57,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:57,583 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 201 treesize of output 162 [2024-11-08 13:54:57,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:57,593 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 213 treesize of output 214 [2024-11-08 13:54:57,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:57,625 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 704 treesize of output 495 [2024-11-08 13:54:57,637 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 361 treesize of output 357 [2024-11-08 13:54:57,647 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 357 treesize of output 353 [2024-11-08 13:54:57,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 353 treesize of output 351 [2024-11-08 13:54:57,668 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 351 treesize of output 347 [2024-11-08 13:54:57,677 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 347 treesize of output 339 [2024-11-08 13:54:57,687 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 339 treesize of output 335 [2024-11-08 13:54:57,697 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 335 treesize of output 327 [2024-11-08 13:54:57,706 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 327 treesize of output 325 [2024-11-08 13:54:57,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:57,730 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 434 treesize of output 433 [2024-11-08 13:54:57,752 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 359 treesize of output 357 [2024-11-08 13:54:57,761 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 357 treesize of output 353 [2024-11-08 13:54:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-08 13:54:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709090988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:54:58,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:54:58,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-11-08 13:54:58,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877831606] [2024-11-08 13:54:58,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:54:58,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 13:54:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:54:58,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 13:54:58,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=338, Unknown=12, NotChecked=38, Total=462 [2024-11-08 13:54:58,417 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) 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-11-08 13:54:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:54:59,017 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2024-11-08 13:54:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 13:54:59,018 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) 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 25 [2024-11-08 13:54:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:54:59,019 INFO L225 Difference]: With dead ends: 164 [2024-11-08 13:54:59,019 INFO L226 Difference]: Without dead ends: 129 [2024-11-08 13:54:59,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=526, Unknown=12, NotChecked=48, Total=702 [2024-11-08 13:54:59,020 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 93 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 13:54:59,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 656 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 424 Invalid, 0 Unknown, 102 Unchecked, 0.4s Time] [2024-11-08 13:54:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-08 13:54:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 96. [2024-11-08 13:54:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 95 states have internal predecessors, (118), 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-11-08 13:54:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2024-11-08 13:54:59,034 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 25 [2024-11-08 13:54:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:54:59,034 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2024-11-08 13:54:59,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6363636363636362) 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-11-08 13:54:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2024-11-08 13:54:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 13:54:59,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:59,036 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, 1] [2024-11-08 13:54:59,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 13:54:59,240 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-11-08 13:54:59,241 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-11-08 13:54:59,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:59,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1220504085, now seen corresponding path program 1 times [2024-11-08 13:54:59,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:59,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160127291] [2024-11-08 13:54:59,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:59,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 13:54:59,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:54:59,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160127291] [2024-11-08 13:54:59,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160127291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:54:59,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:54:59,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:54:59,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770546436] [2024-11-08 13:54:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:54:59,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:54:59,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:54:59,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:54:59,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:54:59,360 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11-08 13:54:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:54:59,482 INFO L93 Difference]: Finished difference Result 144 states and 178 transitions. [2024-11-08 13:54:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:54:59,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 25 [2024-11-08 13:54:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:54:59,484 INFO L225 Difference]: With dead ends: 144 [2024-11-08 13:54:59,484 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 13:54:59,484 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-11-08 13:54:59,485 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:54:59,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 180 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:54:59,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 13:54:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2024-11-08 13:54:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 98 states have internal predecessors, (121), 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-11-08 13:54:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2024-11-08 13:54:59,504 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 25 [2024-11-08 13:54:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:54:59,504 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2024-11-08 13:54:59,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11-08 13:54:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2024-11-08 13:54:59,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 13:54:59,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:59,508 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, 1] [2024-11-08 13:54:59,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 13:54:59,509 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-11-08 13:54:59,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 836449433, now seen corresponding path program 1 times [2024-11-08 13:54:59,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:59,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092499932] [2024-11-08 13:54:59,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:59,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:55:00,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:55:00,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092499932] [2024-11-08 13:55:00,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092499932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:55:00,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119312169] [2024-11-08 13:55:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:00,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:55:00,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:55:00,221 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-11-08 13:55:00,222 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-11-08 13:55:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:00,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-08 13:55:00,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:55:00,351 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-11-08 13:55:00,367 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-11-08 13:55:00,381 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 13:55:00,381 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-11-08 13:55:00,390 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-11-08 13:55:00,406 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 13:55:00,407 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-11-08 13:55:00,415 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-11-08 13:55:00,437 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:55:00,438 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-11-08 13:55:00,469 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-11-08 13:55:00,477 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-11-08 13:55:00,484 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-11-08 13:55:00,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:55:00,587 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-11-08 13:55:00,588 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-11-08 13:55:00,592 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-11-08 13:55:00,596 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 20 treesize of output 15 [2024-11-08 13:55:00,616 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 13:55:00,617 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-11-08 13:55:00,636 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:55:00,636 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-11-08 13:55:00,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:55:00,647 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-11-08 13:55:00,653 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-08 13:55:00,658 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:55:00,658 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 20 treesize of output 5 [2024-11-08 13:55:00,667 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-11-08 13:55:00,718 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-11-08 13:55:00,723 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-11-08 13:55:00,727 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-11-08 13:55:00,884 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-11-08 13:55:00,891 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-11-08 13:55:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:55:00,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:55:00,985 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_619) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_618) |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_620) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)) 1)) is different from false [2024-11-08 13:55:01,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:55:01,061 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-11-08 13:55:01,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:55:01,073 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-11-08 13:55:01,081 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-11-08 13:55:01,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:55:01,281 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 96 [2024-11-08 13:55:01,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:55:01,290 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 87 treesize of output 80 [2024-11-08 13:55:01,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:55:01,304 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 312 treesize of output 219 [2024-11-08 13:55:01,311 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-11-08 13:55:01,317 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-11-08 13:55:01,323 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-11-08 13:55:01,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:55:01,340 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 182 treesize of output 185 [2024-11-08 13:55:01,349 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 169 treesize of output 165 [2024-11-08 13:55:01,355 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 161 [2024-11-08 13:55:01,362 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 161 treesize of output 159 [2024-11-08 13:55:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-08 13:55:01,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119312169] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:55:01,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:55:01,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2024-11-08 13:55:01,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424755649] [2024-11-08 13:55:01,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:55:01,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 13:55:01,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:55:01,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 13:55:01,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=350, Unknown=2, NotChecked=38, Total=462 [2024-11-08 13:55:01,901 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 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-11-08 13:55:10,485 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-11-08 13:55:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:55:11,062 INFO L93 Difference]: Finished difference Result 176 states and 216 transitions. [2024-11-08 13:55:11,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 13:55:11,063 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 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) Word has length 25 [2024-11-08 13:55:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:55:11,064 INFO L225 Difference]: With dead ends: 176 [2024-11-08 13:55:11,064 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 13:55:11,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=159, Invalid=770, Unknown=5, NotChecked=58, Total=992 [2024-11-08 13:55:11,065 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 207 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 16 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-08 13:55:11,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 815 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 595 Invalid, 6 Unknown, 127 Unchecked, 4.7s Time] [2024-11-08 13:55:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 13:55:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 110. [2024-11-08 13:55:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 109 states have internal predecessors, (137), 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-11-08 13:55:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 137 transitions. [2024-11-08 13:55:11,099 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 137 transitions. Word has length 25 [2024-11-08 13:55:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:55:11,099 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 137 transitions. [2024-11-08 13:55:11,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 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-11-08 13:55:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2024-11-08 13:55:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:55:11,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:11,101 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, 1] [2024-11-08 13:55:11,114 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-11-08 13:55:11,302 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-11-08 13:55:11,302 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-11-08 13:55:11,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:11,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2046348832, now seen corresponding path program 1 times [2024-11-08 13:55:11,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:11,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152937633] [2024-11-08 13:55:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:11,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:55:11,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:55:11,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152937633] [2024-11-08 13:55:11,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152937633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:55:11,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344749737] [2024-11-08 13:55:11,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:11,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:55:11,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:55:11,752 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-11-08 13:55:11,754 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-11-08 13:55:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:11,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 13:55:11,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:55:11,893 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-11-08 13:55:11,901 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-11-08 13:55:11,963 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 13:55:11,963 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-11-08 13:55:11,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 35 treesize of output 18 [2024-11-08 13:55:11,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:55:11,987 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-11-08 13:55:12,020 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-11-08 13:55:12,138 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:55:12,138 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-11-08 13:55:12,144 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-11-08 13:55:12,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:55:12,173 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-11-08 13:55:12,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:55:12,178 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-11-08 13:55:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:55:12,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:55:12,250 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_742 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_743))) (or (not (= v_ArrVal_742 (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_742 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0)))) is different from false [2024-11-08 13:55:12,265 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.base_12| Int) (v_ArrVal_742 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |v_ULTIMATE.start_main_~tmp~0#1.base_12| v_ArrVal_743))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_742) |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_12|) 0)) (not (= v_ArrVal_742 (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_742 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) is different from false [2024-11-08 13:55:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:55:12,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344749737] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:55:12,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:55:12,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 24 [2024-11-08 13:55:12,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384762379] [2024-11-08 13:55:12,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:55:12,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 13:55:12,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:55:12,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 13:55:12,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=351, Unknown=9, NotChecked=82, Total=552 [2024-11-08 13:55:12,617 INFO L87 Difference]: Start difference. First operand 110 states and 137 transitions. Second operand has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 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-11-08 13:55:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:55:12,967 INFO L93 Difference]: Finished difference Result 233 states and 284 transitions. [2024-11-08 13:55:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 13:55:12,968 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 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 27 [2024-11-08 13:55:12,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:55:12,969 INFO L225 Difference]: With dead ends: 233 [2024-11-08 13:55:12,969 INFO L226 Difference]: Without dead ends: 168 [2024-11-08 13:55:12,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=514, Unknown=9, NotChecked=102, Total=812 [2024-11-08 13:55:12,970 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 295 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:55:12,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 509 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 322 Invalid, 0 Unknown, 232 Unchecked, 0.2s Time] [2024-11-08 13:55:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-08 13:55:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2024-11-08 13:55:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 126 states have (on average 1.2857142857142858) internal successors, (162), 131 states have internal predecessors, (162), 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-11-08 13:55:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions. [2024-11-08 13:55:13,000 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 27 [2024-11-08 13:55:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:55:13,000 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 162 transitions. [2024-11-08 13:55:13,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 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-11-08 13:55:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2024-11-08 13:55:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:55:13,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:13,001 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, 1] [2024-11-08 13:55:13,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 13:55:13,204 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-11-08 13:55:13,205 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-11-08 13:55:13,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:13,205 INFO L85 PathProgramCache]: Analyzing trace with hash 485990957, now seen corresponding path program 1 times [2024-11-08 13:55:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:13,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266010790] [2024-11-08 13:55:13,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:13,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:55:13,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:55:13,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266010790] [2024-11-08 13:55:13,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266010790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:55:13,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224733240] [2024-11-08 13:55:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:13,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:55:13,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:55:13,585 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:55:13,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 13:55:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:13,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-08 13:55:13,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:55:13,725 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-11-08 13:55:13,768 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 13:55:13,768 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 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-08 13:55:13,786 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 13:55:13,787 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 1 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 13:55:13,803 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:55:13,803 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-11-08 13:55:13,852 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 13:55:13,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2024-11-08 13:55:13,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-11-08 13:55:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:55:14,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:55:14,157 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_815 (Array Int Int))) (or (not (= v_ArrVal_815 (store .cse0 .cse1 (select v_ArrVal_815 .cse1)))) (forall ((v_ArrVal_816 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_816 .cse1)) v_ArrVal_816)) (= (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_816))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))))) (forall ((v_ArrVal_815 (Array Int Int))) (or (forall ((v_ArrVal_816 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_816 .cse1)) v_ArrVal_816)) (= (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_815))) (select .cse4 (select (select .cse4 |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_816) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) (not (= v_ArrVal_815 (store .cse0 .cse1 (select v_ArrVal_815 .cse1)))))))) is different from false [2024-11-08 13:55:14,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:55:14,204 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 187 treesize of output 156 [2024-11-08 13:55:14,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:55:14,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 386 treesize of output 414 [2024-11-08 13:55:14,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:55:14,293 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 305 treesize of output 242 [2024-11-08 13:55:14,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:55:14,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 424 treesize of output 488 [2024-11-08 13:55:14,515 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 6 treesize of output 4 [2024-11-08 13:55:14,910 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 13 treesize of output 3 [2024-11-08 13:55:14,919 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 13 treesize of output 3 [2024-11-08 13:55:16,018 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 18 treesize of output 14 [2024-11-08 13:55:16,224 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 11 treesize of output 7 [2024-11-08 13:55:16,725 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 18 treesize of output 12 [2024-11-08 13:55:17,241 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 18 treesize of output 12 [2024-11-08 13:55:17,288 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 29 [2024-11-08 13:55:20,246 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 7 treesize of output 3 [2024-11-08 13:55:20,362 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 7 treesize of output 3 [2024-11-08 13:55:20,468 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 7 treesize of output 3 [2024-11-08 13:55:20,526 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 7 treesize of output 3 [2024-11-08 13:55:20,586 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 7 treesize of output 3 [2024-11-08 13:55:20,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:55:20,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 196 [2024-11-08 13:55:30,204 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 7 treesize of output 3 [2024-11-08 13:55:30,214 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 7 treesize of output 3 [2024-11-08 13:55:30,257 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 7 treesize of output 3 [2024-11-08 13:55:30,277 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 7 treesize of output 3 [2024-11-08 13:55:30,439 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 7 treesize of output 3 [2024-11-08 13:55:30,449 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 7 treesize of output 3 [2024-11-08 13:55:30,493 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 7 treesize of output 3 [2024-11-08 13:55:42,836 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 7 treesize of output 3 [2024-11-08 13:55:42,846 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 7 treesize of output 3 [2024-11-08 13:55:42,871 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 7 treesize of output 3 [2024-11-08 13:55:42,895 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 7 treesize of output 3 [2024-11-08 13:55:43,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 7 treesize of output 3 [2024-11-08 13:55:43,080 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 7 treesize of output 3 [2024-11-08 13:55:43,127 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 7 treesize of output 3 [2024-11-08 13:55:52,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:55:52,020 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 7072 treesize of output 7052