./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/heap-manipulation/bubble_sort_linux-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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:01:06,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:01:06,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:01:06,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:01:06,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:01:06,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:01:06,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:01:06,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:01:06,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:01:06,402 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:01:06,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:01:06,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:01:06,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:01:06,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:01:06,415 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:01:06,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:01:06,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:01:06,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:01:06,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:01:06,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:01:06,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:01:06,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:01:06,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:01:06,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:01:06,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:01:06,422 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:01:06,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:01:06,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:01:06,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:01:06,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:01:06,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:01:06,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:01:06,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:01:06,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:01:06,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:01:06,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:01:06,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:01:06,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:01:06,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:01:06,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:01:06,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:01:06,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:01:06,427 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2024-11-09 22:01:06,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:01:06,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:01:06,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:01:06,733 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:01:06,733 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:01:06,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-09 22:01:08,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:01:08,521 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:01:08,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-09 22:01:08,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49305f47d/e7f7077eca7d498386c0313ca1e3b1a4/FLAG3c05c2891 [2024-11-09 22:01:08,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49305f47d/e7f7077eca7d498386c0313ca1e3b1a4 [2024-11-09 22:01:08,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:01:08,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:01:08,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:01:08,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:01:08,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:01:08,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:01:08" (1/1) ... [2024-11-09 22:01:08,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b94f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:08, skipping insertion in model container [2024-11-09 22:01:08,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:01:08" (1/1) ... [2024-11-09 22:01:08,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:01:09,101 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/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2024-11-09 22:01:09,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:01:09,183 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:01:09,240 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/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2024-11-09 22:01:09,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:01:09,326 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:01:09,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09 WrapperNode [2024-11-09 22:01:09,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:01:09,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:01:09,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:01:09,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:01:09,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09" (1/1) ... [2024-11-09 22:01:09,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09" (1/1) ... [2024-11-09 22:01:09,397 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 114 [2024-11-09 22:01:09,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:01:09,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:01:09,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:01:09,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:01:09,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09" (1/1) ... [2024-11-09 22:01:09,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09" (1/1) ... [2024-11-09 22:01:09,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09" (1/1) ... [2024-11-09 22:01:09,456 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-11-09 22:01:09,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09" (1/1) ... [2024-11-09 22:01:09,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09" (1/1) ... [2024-11-09 22:01:09,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09" (1/1) ... [2024-11-09 22:01:09,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09" (1/1) ... [2024-11-09 22:01:09,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09" (1/1) ... [2024-11-09 22:01:09,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09" (1/1) ... [2024-11-09 22:01:09,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:01:09,493 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:01:09,493 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:01:09,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:01:09,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09" (1/1) ... [2024-11-09 22:01:09,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:01:09,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:01:09,533 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-09 22:01:09,539 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-09 22:01:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:01:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:01:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-11-09 22:01:09,591 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-11-09 22:01:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:01:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 22:01:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 22:01:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-11-09 22:01:09,593 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-11-09 22:01:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 22:01:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 22:01:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-09 22:01:09,594 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-09 22:01:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:01:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:01:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:01:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:01:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:01:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:01:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-11-09 22:01:09,595 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-11-09 22:01:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:01:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:01:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:01:09,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:01:09,786 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:01:09,788 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:01:09,834 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc #t~mem54; [2024-11-09 22:01:10,166 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-09 22:01:10,166 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:01:10,183 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:01:10,184 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:01:10,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:01:10 BoogieIcfgContainer [2024-11-09 22:01:10,184 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:01:10,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:01:10,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:01:10,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:01:10,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:01:08" (1/3) ... [2024-11-09 22:01:10,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d40518b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:01:10, skipping insertion in model container [2024-11-09 22:01:10,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:09" (2/3) ... [2024-11-09 22:01:10,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d40518b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:01:10, skipping insertion in model container [2024-11-09 22:01:10,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:01:10" (3/3) ... [2024-11-09 22:01:10,194 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2024-11-09 22:01:10,217 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:01:10,218 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:01:10,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:01:10,289 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;@80fb20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:01:10,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:01:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 97 states have (on average 1.6804123711340206) internal successors, (163), 116 states have internal predecessors, (163), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 22:01:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 22:01:10,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:10,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:10,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:10,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:10,306 INFO L85 PathProgramCache]: Analyzing trace with hash -69019976, now seen corresponding path program 1 times [2024-11-09 22:01:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:10,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700898604] [2024-11-09 22:01:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:10,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:10,477 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-09 22:01:10,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:10,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700898604] [2024-11-09 22:01:10,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700898604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:01:10,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:01:10,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:01:10,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613562207] [2024-11-09 22:01:10,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:01:10,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:01:10,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:10,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:01:10,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:01:10,522 INFO L87 Difference]: Start difference. First operand has 126 states, 97 states have (on average 1.6804123711340206) internal successors, (163), 116 states have internal predecessors, (163), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:01:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:10,581 INFO L93 Difference]: Finished difference Result 245 states and 412 transitions. [2024-11-09 22:01:10,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:01:10,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 22:01:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:10,593 INFO L225 Difference]: With dead ends: 245 [2024-11-09 22:01:10,594 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 22:01:10,602 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-09 22:01:10,605 INFO L432 NwaCegarLoop]: 143 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, 143 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-09 22:01:10,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:01:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 22:01:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 22:01:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 104 states have internal predecessors, (109), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:01:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2024-11-09 22:01:10,651 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 11 [2024-11-09 22:01:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:10,653 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2024-11-09 22:01:10,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:01:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2024-11-09 22:01:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 22:01:10,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:10,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:10,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:01:10,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:10,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:10,656 INFO L85 PathProgramCache]: Analyzing trace with hash -806428757, now seen corresponding path program 1 times [2024-11-09 22:01:10,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:10,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755346234] [2024-11-09 22:01:10,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:10,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:11,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 22:01:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:11,172 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-09 22:01:11,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:11,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755346234] [2024-11-09 22:01:11,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755346234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:01:11,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:01:11,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:01:11,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036752003] [2024-11-09 22:01:11,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:01:11,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:01:11,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:11,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:01:11,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:01:11,177 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:11,625 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2024-11-09 22:01:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:01:11,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-09 22:01:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:11,628 INFO L225 Difference]: With dead ends: 117 [2024-11-09 22:01:11,629 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 22:01:11,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 22:01:11,633 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 265 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:11,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 121 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 22:01:11,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 22:01:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 22:01:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 103 states have internal predecessors, (108), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:01:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2024-11-09 22:01:11,662 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 22 [2024-11-09 22:01:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:11,664 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2024-11-09 22:01:11,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2024-11-09 22:01:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 22:01:11,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:11,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:11,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:01:11,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:11,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:11,667 INFO L85 PathProgramCache]: Analyzing trace with hash -103289893, now seen corresponding path program 1 times [2024-11-09 22:01:11,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:11,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053285190] [2024-11-09 22:01:11,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:11,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:12,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 22:01:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:12,211 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-09 22:01:12,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053285190] [2024-11-09 22:01:12,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053285190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:01:12,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:01:12,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 22:01:12,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778631336] [2024-11-09 22:01:12,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:01:12,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:01:12,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:12,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:01:12,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:01:12,218 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:13,211 INFO L93 Difference]: Finished difference Result 214 states and 251 transitions. [2024-11-09 22:01:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 22:01:13,212 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-09 22:01:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:13,216 INFO L225 Difference]: With dead ends: 214 [2024-11-09 22:01:13,216 INFO L226 Difference]: Without dead ends: 207 [2024-11-09 22:01:13,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-09 22:01:13,220 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 527 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:13,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 164 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 22:01:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-09 22:01:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 186. [2024-11-09 22:01:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 158 states have (on average 1.2215189873417722) internal successors, (193), 172 states have internal predecessors, (193), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 22:01:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 223 transitions. [2024-11-09 22:01:13,266 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 223 transitions. Word has length 25 [2024-11-09 22:01:13,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:13,266 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 223 transitions. [2024-11-09 22:01:13,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 223 transitions. [2024-11-09 22:01:13,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 22:01:13,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:13,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:13,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:01:13,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:13,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:13,268 INFO L85 PathProgramCache]: Analyzing trace with hash 401284078, now seen corresponding path program 1 times [2024-11-09 22:01:13,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:13,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189403122] [2024-11-09 22:01:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:13,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:14,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 22:01:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:14,307 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-09 22:01:14,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:14,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189403122] [2024-11-09 22:01:14,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189403122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:01:14,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:01:14,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 22:01:14,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948128847] [2024-11-09 22:01:14,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:01:14,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:01:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:14,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:01:14,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:01:14,311 INFO L87 Difference]: Start difference. First operand 186 states and 223 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:15,371 INFO L93 Difference]: Finished difference Result 296 states and 351 transitions. [2024-11-09 22:01:15,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 22:01:15,372 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-09 22:01:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:15,375 INFO L225 Difference]: With dead ends: 296 [2024-11-09 22:01:15,375 INFO L226 Difference]: Without dead ends: 292 [2024-11-09 22:01:15,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-09 22:01:15,377 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 338 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:15,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 227 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 22:01:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-09 22:01:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 273. [2024-11-09 22:01:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 238 states have (on average 1.218487394957983) internal successors, (290), 253 states have internal predecessors, (290), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 22:01:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2024-11-09 22:01:15,419 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 28 [2024-11-09 22:01:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:15,419 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2024-11-09 22:01:15,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2024-11-09 22:01:15,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 22:01:15,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:15,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:15,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 22:01:15,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:15,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1413341198, now seen corresponding path program 1 times [2024-11-09 22:01:15,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:15,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556076035] [2024-11-09 22:01:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:15,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 22:01:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:16,352 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-09 22:01:16,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:16,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556076035] [2024-11-09 22:01:16,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556076035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:01:16,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:01:16,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 22:01:16,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777910708] [2024-11-09 22:01:16,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:01:16,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 22:01:16,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:16,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 22:01:16,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:01:16,357 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:17,539 INFO L93 Difference]: Finished difference Result 295 states and 349 transitions. [2024-11-09 22:01:17,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 22:01:17,540 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-09 22:01:17,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:17,542 INFO L225 Difference]: With dead ends: 295 [2024-11-09 22:01:17,543 INFO L226 Difference]: Without dead ends: 291 [2024-11-09 22:01:17,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-09 22:01:17,545 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 404 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:17,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 227 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 22:01:17,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-09 22:01:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 273. [2024-11-09 22:01:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 238 states have (on average 1.2142857142857142) internal successors, (289), 253 states have internal predecessors, (289), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 22:01:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 328 transitions. [2024-11-09 22:01:17,593 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 328 transitions. Word has length 32 [2024-11-09 22:01:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:17,594 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 328 transitions. [2024-11-09 22:01:17,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 328 transitions. [2024-11-09 22:01:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 22:01:17,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:17,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:17,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:01:17,599 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:17,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1027062046, now seen corresponding path program 1 times [2024-11-09 22:01:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:17,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390675922] [2024-11-09 22:01:17,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:17,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:18,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 22:01:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:19,034 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-09 22:01:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:19,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390675922] [2024-11-09 22:01:19,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390675922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:01:19,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:01:19,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 22:01:19,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105350696] [2024-11-09 22:01:19,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:01:19,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 22:01:19,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:19,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 22:01:19,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-09 22:01:19,038 INFO L87 Difference]: Start difference. First operand 273 states and 328 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 12 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:20,729 INFO L93 Difference]: Finished difference Result 294 states and 347 transitions. [2024-11-09 22:01:20,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 22:01:20,729 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 12 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-09 22:01:20,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:20,731 INFO L225 Difference]: With dead ends: 294 [2024-11-09 22:01:20,731 INFO L226 Difference]: Without dead ends: 290 [2024-11-09 22:01:20,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2024-11-09 22:01:20,733 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 379 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:20,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 319 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 22:01:20,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-09 22:01:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 273. [2024-11-09 22:01:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 238 states have (on average 1.2100840336134453) internal successors, (288), 253 states have internal predecessors, (288), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 22:01:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 327 transitions. [2024-11-09 22:01:20,770 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 327 transitions. Word has length 35 [2024-11-09 22:01:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:20,772 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 327 transitions. [2024-11-09 22:01:20,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 12 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 327 transitions. [2024-11-09 22:01:20,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 22:01:20,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:20,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:20,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 22:01:20,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:20,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:20,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1976461777, now seen corresponding path program 1 times [2024-11-09 22:01:20,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:20,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622345628] [2024-11-09 22:01:20,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:20,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:21,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 22:01:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:21,935 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-09 22:01:21,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:21,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622345628] [2024-11-09 22:01:21,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622345628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:01:21,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:01:21,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 22:01:21,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623332163] [2024-11-09 22:01:21,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:01:21,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:01:21,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:21,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:01:21,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:01:21,938 INFO L87 Difference]: Start difference. First operand 273 states and 327 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:23,103 INFO L93 Difference]: Finished difference Result 293 states and 345 transitions. [2024-11-09 22:01:23,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 22:01:23,104 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-11-09 22:01:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:23,106 INFO L225 Difference]: With dead ends: 293 [2024-11-09 22:01:23,106 INFO L226 Difference]: Without dead ends: 289 [2024-11-09 22:01:23,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-09 22:01:23,108 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 368 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:23,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 250 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 22:01:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-09 22:01:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 273. [2024-11-09 22:01:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 238 states have (on average 1.2058823529411764) internal successors, (287), 253 states have internal predecessors, (287), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 22:01:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 326 transitions. [2024-11-09 22:01:23,149 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 326 transitions. Word has length 38 [2024-11-09 22:01:23,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:23,149 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 326 transitions. [2024-11-09 22:01:23,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:23,150 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 326 transitions. [2024-11-09 22:01:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 22:01:23,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:23,153 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:23,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 22:01:23,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:23,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:23,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1104598946, now seen corresponding path program 1 times [2024-11-09 22:01:23,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:23,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124104845] [2024-11-09 22:01:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:24,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 22:01:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:24,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 22:01:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:24,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 22:01:24,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:24,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124104845] [2024-11-09 22:01:24,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124104845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:01:24,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170594334] [2024-11-09 22:01:24,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:24,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:01:24,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:01:24,519 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-09 22:01:24,520 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-09 22:01:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:24,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-09 22:01:24,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:01:24,891 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 22:01:24,892 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-09 22:01:24,958 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-09 22:01:24,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 22:01:24,993 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 7 treesize of output 3 [2024-11-09 22:01:24,997 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 7 treesize of output 3 [2024-11-09 22:01:25,136 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 43 treesize of output 35 [2024-11-09 22:01:25,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-09 22:01:25,158 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 0 case distinctions, treesize of input 45 treesize of output 45 [2024-11-09 22:01:25,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:01:25,237 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 29 treesize of output 16 [2024-11-09 22:01:25,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:01:25,247 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 1 case distinctions, treesize of input 26 treesize of output 24 [2024-11-09 22:01:25,331 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:01:25,332 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-09 22:01:25,388 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 30 treesize of output 21 [2024-11-09 22:01:25,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:01:25,405 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 22 treesize of output 8 [2024-11-09 22:01:40,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:02:07,730 WARN L286 SmtUtils]: Spent 27.35s on a formula simplification. DAG size of input: 149 DAG size of output: 55 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 22:02:07,731 INFO L349 Elim1Store]: treesize reduction 612, result has 15.1 percent of original size [2024-11-09 22:02:07,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 12 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 15 new quantified variables, introduced 12 case distinctions, treesize of input 729 treesize of output 2192 [2024-11-09 22:02:17,139 WARN L286 SmtUtils]: Spent 9.25s on a formula simplification. DAG size of input: 63 DAG size of output: 30 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 22:02:17,140 INFO L349 Elim1Store]: treesize reduction 144, result has 23.0 percent of original size [2024-11-09 22:02:17,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 1785 treesize of output 1540 [2024-11-09 22:02:22,738 INFO L224 Elim1Store]: Index analysis took 4128 ms [2024-11-09 22:02:23,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 383