./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-551b009-m [2025-01-09 02:40:26,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:40:26,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:40:26,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:40:26,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:40:26,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:40:26,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:40:26,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:40:26,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:40:26,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:40:26,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:40:26,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:40:26,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:40:26,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:40:26,315 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:40:26,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:40:26,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:40:26,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:40:26,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:40:26,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:40:26,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:40:26,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:40:26,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:40:26,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:40:26,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:40:26,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:40:26,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:40:26,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:40:26,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:40:26,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:40:26,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:40:26,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:40:26,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:40:26,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:40:26,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:40:26,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:40:26,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:40:26,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:40:26,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:40:26,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:40:26,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:40:26,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:40:26,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:40:26,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:40:26,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:40:26,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:40:26,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:40:26,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:40:26,318 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 [2025-01-09 02:40:26,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:40:26,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:40:26,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:40:26,600 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:40:26,601 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:40:26,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2025-01-09 02:40:27,883 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38167b0c8/d4079badb5f54aefb2c137ef03f2b569/FLAGcb1794858 [2025-01-09 02:40:28,203 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:40:28,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2025-01-09 02:40:28,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38167b0c8/d4079badb5f54aefb2c137ef03f2b569/FLAGcb1794858 [2025-01-09 02:40:28,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38167b0c8/d4079badb5f54aefb2c137ef03f2b569 [2025-01-09 02:40:28,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:40:28,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:40:28,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:40:28,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:40:28,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:40:28,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@460a6c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28, skipping insertion in model container [2025-01-09 02:40:28,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:40:28,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2025-01-09 02:40:28,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:40:28,633 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:40:28,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2025-01-09 02:40:28,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:40:28,755 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:40:28,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28 WrapperNode [2025-01-09 02:40:28,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:40:28,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:40:28,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:40:28,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:40:28,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,807 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 114 [2025-01-09 02:40:28,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:40:28,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:40:28,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:40:28,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:40:28,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,845 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]. [2025-01-09 02:40:28,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,857 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:40:28,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:40:28,877 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:40:28,877 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:40:28,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (1/1) ... [2025-01-09 02:40:28,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:40:28,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:28,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:40:28,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:40:28,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:40:28,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:40:28,927 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2025-01-09 02:40:28,927 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2025-01-09 02:40:28,928 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-01-09 02:40:28,928 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:40:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-01-09 02:40:28,928 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-01-09 02:40:28,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:40:28,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:40:28,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:40:28,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:40:29,064 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:40:29,066 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:40:29,440 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-01-09 02:40:29,440 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:40:29,451 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:40:29,452 INFO L312 CfgBuilder]: Removed 22 assume(true) statements. [2025-01-09 02:40:29,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:40:29 BoogieIcfgContainer [2025-01-09 02:40:29,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:40:29,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:40:29,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:40:29,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:40:29,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:40:28" (1/3) ... [2025-01-09 02:40:29,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382074d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:40:29, skipping insertion in model container [2025-01-09 02:40:29,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:28" (2/3) ... [2025-01-09 02:40:29,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382074d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:40:29, skipping insertion in model container [2025-01-09 02:40:29,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:40:29" (3/3) ... [2025-01-09 02:40:29,463 INFO L128 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2025-01-09 02:40:29,477 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:40:29,479 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubble_sort_linux-2.i that has 5 procedures, 117 locations, 1 initial locations, 23 loop locations, and 1 error locations. [2025-01-09 02:40:29,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:40:29,539 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;@5b2d520c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:40:29,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:40:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 88 states have (on average 1.7386363636363635) internal successors, (153), 107 states have internal predecessors, (153), 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) [2025-01-09 02:40:29,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 02:40:29,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:29,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:29,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:29,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:29,556 INFO L85 PathProgramCache]: Analyzing trace with hash -138897241, now seen corresponding path program 1 times [2025-01-09 02:40:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:29,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399456498] [2025-01-09 02:40:29,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:29,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:29,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 02:40:29,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 02:40:29,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:29,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:29,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:29,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:29,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399456498] [2025-01-09 02:40:29,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399456498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:29,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:29,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 02:40:29,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764728054] [2025-01-09 02:40:29,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:29,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:40:29,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:29,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:40:29,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:40:29,741 INFO L87 Difference]: Start difference. First operand has 117 states, 88 states have (on average 1.7386363636363635) internal successors, (153), 107 states have internal predecessors, (153), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2025-01-09 02:40:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:29,782 INFO L93 Difference]: Finished difference Result 228 states and 393 transitions. [2025-01-09 02:40:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:40:29,785 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 9 [2025-01-09 02:40:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:29,791 INFO L225 Difference]: With dead ends: 228 [2025-01-09 02:40:29,791 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 02:40:29,795 INFO L434 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 [2025-01-09 02:40:29,798 INFO L435 NwaCegarLoop]: 135 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, 135 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 [2025-01-09 02:40:29,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:40:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 02:40:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-01-09 02:40:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.25) internal successors, (100), 95 states have internal predecessors, (100), 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) [2025-01-09 02:40:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2025-01-09 02:40:29,842 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 9 [2025-01-09 02:40:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:29,845 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2025-01-09 02:40:29,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2025-01-09 02:40:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2025-01-09 02:40:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 02:40:29,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:29,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:29,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:40:29,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:29,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1833152115, now seen corresponding path program 1 times [2025-01-09 02:40:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:29,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679860286] [2025-01-09 02:40:29,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:29,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 02:40:29,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 02:40:29,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:29,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:30,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:30,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:30,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679860286] [2025-01-09 02:40:30,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679860286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:30,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:30,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:40:30,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486384196] [2025-01-09 02:40:30,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:30,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:40:30,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:30,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:40:30,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:40:30,275 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-01-09 02:40:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:30,451 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2025-01-09 02:40:30,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:40:30,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 20 [2025-01-09 02:40:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:30,453 INFO L225 Difference]: With dead ends: 107 [2025-01-09 02:40:30,453 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 02:40:30,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:40:30,454 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 173 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:30,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 245 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:40:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 02:40:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-09 02:40:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.2375) internal successors, (99), 94 states have internal predecessors, (99), 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) [2025-01-09 02:40:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2025-01-09 02:40:30,476 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 20 [2025-01-09 02:40:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:30,478 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2025-01-09 02:40:30,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-01-09 02:40:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2025-01-09 02:40:30,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 02:40:30,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:30,479 INFO L218 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] [2025-01-09 02:40:30,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:40:30,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:30,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash 618744327, now seen corresponding path program 1 times [2025-01-09 02:40:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:30,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418488343] [2025-01-09 02:40:30,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:30,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 02:40:30,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 02:40:30,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:30,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:30,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418488343] [2025-01-09 02:40:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418488343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:30,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:30,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 02:40:30,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134706046] [2025-01-09 02:40:30,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:30,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 02:40:30,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:30,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 02:40:30,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:40:30,998 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 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) [2025-01-09 02:40:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:31,593 INFO L93 Difference]: Finished difference Result 195 states and 232 transitions. [2025-01-09 02:40:31,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 02:40:31,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 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 23 [2025-01-09 02:40:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:31,597 INFO L225 Difference]: With dead ends: 195 [2025-01-09 02:40:31,598 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 02:40:31,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-01-09 02:40:31,601 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 355 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:31,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 507 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 02:40:31,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 02:40:31,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2025-01-09 02:40:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 141 states have (on average 1.24822695035461) internal successors, (176), 155 states have internal predecessors, (176), 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) [2025-01-09 02:40:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2025-01-09 02:40:31,634 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 23 [2025-01-09 02:40:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:31,636 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2025-01-09 02:40:31,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 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) [2025-01-09 02:40:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2025-01-09 02:40:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:40:31,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:31,638 INFO L218 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] [2025-01-09 02:40:31,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:40:31,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:31,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:31,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1277849566, now seen corresponding path program 1 times [2025-01-09 02:40:31,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:31,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647301748] [2025-01-09 02:40:31,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:31,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:31,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:40:31,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:40:31,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:31,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:32,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:32,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647301748] [2025-01-09 02:40:32,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647301748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:32,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:32,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 02:40:32,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076180240] [2025-01-09 02:40:32,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:32,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 02:40:32,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:32,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 02:40:32,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:40:32,795 INFO L87 Difference]: Start difference. First operand 169 states and 206 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 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) [2025-01-09 02:40:33,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:33,826 INFO L93 Difference]: Finished difference Result 269 states and 324 transitions. [2025-01-09 02:40:33,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 02:40:33,827 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 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 26 [2025-01-09 02:40:33,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:33,828 INFO L225 Difference]: With dead ends: 269 [2025-01-09 02:40:33,828 INFO L226 Difference]: Without dead ends: 266 [2025-01-09 02:40:33,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-01-09 02:40:33,829 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 303 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:33,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 227 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 02:40:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-09 02:40:33,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 248. [2025-01-09 02:40:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 213 states have (on average 1.244131455399061) internal successors, (265), 228 states have internal predecessors, (265), 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) [2025-01-09 02:40:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 304 transitions. [2025-01-09 02:40:33,898 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 304 transitions. Word has length 26 [2025-01-09 02:40:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:33,898 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 304 transitions. [2025-01-09 02:40:33,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 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) [2025-01-09 02:40:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 304 transitions. [2025-01-09 02:40:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 02:40:33,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:33,900 INFO L218 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] [2025-01-09 02:40:33,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:40:33,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:33,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:33,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1899455833, now seen corresponding path program 1 times [2025-01-09 02:40:33,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:33,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296354071] [2025-01-09 02:40:33,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:33,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:33,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:40:33,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:40:33,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:33,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:34,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:34,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296354071] [2025-01-09 02:40:34,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296354071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:34,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:34,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 02:40:34,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366677582] [2025-01-09 02:40:34,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:34,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 02:40:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:34,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 02:40:34,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:40:34,605 INFO L87 Difference]: Start difference. First operand 248 states and 304 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 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) [2025-01-09 02:40:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:35,510 INFO L93 Difference]: Finished difference Result 268 states and 322 transitions. [2025-01-09 02:40:35,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 02:40:35,511 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 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 29 [2025-01-09 02:40:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:35,514 INFO L225 Difference]: With dead ends: 268 [2025-01-09 02:40:35,515 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 02:40:35,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-01-09 02:40:35,518 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 342 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:35,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 220 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 02:40:35,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 02:40:35,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 248. [2025-01-09 02:40:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 213 states have (on average 1.2394366197183098) internal successors, (264), 228 states have internal predecessors, (264), 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) [2025-01-09 02:40:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 303 transitions. [2025-01-09 02:40:35,562 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 303 transitions. Word has length 29 [2025-01-09 02:40:35,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:35,562 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 303 transitions. [2025-01-09 02:40:35,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 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) [2025-01-09 02:40:35,562 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 303 transitions. [2025-01-09 02:40:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 02:40:35,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:35,563 INFO L218 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] [2025-01-09 02:40:35,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 02:40:35,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:35,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash 237657999, now seen corresponding path program 1 times [2025-01-09 02:40:35,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:35,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714744863] [2025-01-09 02:40:35,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:35,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:35,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:40:35,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:40:35,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:35,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:36,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:36,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714744863] [2025-01-09 02:40:36,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714744863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:36,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:36,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 02:40:36,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689540895] [2025-01-09 02:40:36,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:36,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 02:40:36,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:36,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 02:40:36,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:40:36,424 INFO L87 Difference]: Start difference. First operand 248 states and 303 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 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) [2025-01-09 02:40:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:37,394 INFO L93 Difference]: Finished difference Result 267 states and 320 transitions. [2025-01-09 02:40:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 02:40:37,395 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 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 [2025-01-09 02:40:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:37,396 INFO L225 Difference]: With dead ends: 267 [2025-01-09 02:40:37,396 INFO L226 Difference]: Without dead ends: 264 [2025-01-09 02:40:37,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-01-09 02:40:37,398 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 336 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:37,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 250 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 02:40:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-09 02:40:37,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 248. [2025-01-09 02:40:37,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 213 states have (on average 1.2347417840375587) internal successors, (263), 228 states have internal predecessors, (263), 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) [2025-01-09 02:40:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 302 transitions. [2025-01-09 02:40:37,429 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 302 transitions. Word has length 32 [2025-01-09 02:40:37,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:37,429 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 302 transitions. [2025-01-09 02:40:37,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 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) [2025-01-09 02:40:37,429 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 302 transitions. [2025-01-09 02:40:37,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:40:37,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:37,430 INFO L218 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] [2025-01-09 02:40:37,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 02:40:37,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:37,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1722690504, now seen corresponding path program 1 times [2025-01-09 02:40:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:37,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969481733] [2025-01-09 02:40:37,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:37,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:37,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:40:37,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:40:37,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:37,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:38,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:38,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969481733] [2025-01-09 02:40:38,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969481733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:38,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:38,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 02:40:38,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9279518] [2025-01-09 02:40:38,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:38,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 02:40:38,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:38,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 02:40:38,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:40:38,347 INFO L87 Difference]: Start difference. First operand 248 states and 302 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 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) [2025-01-09 02:40:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:39,404 INFO L93 Difference]: Finished difference Result 266 states and 318 transitions. [2025-01-09 02:40:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 02:40:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 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 [2025-01-09 02:40:39,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:39,407 INFO L225 Difference]: With dead ends: 266 [2025-01-09 02:40:39,407 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 02:40:39,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-01-09 02:40:39,410 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 329 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:39,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 250 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 02:40:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 02:40:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 248. [2025-01-09 02:40:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 228 states have internal predecessors, (262), 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) [2025-01-09 02:40:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 301 transitions. [2025-01-09 02:40:39,454 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 301 transitions. Word has length 35 [2025-01-09 02:40:39,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:39,456 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 301 transitions. [2025-01-09 02:40:39,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 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) [2025-01-09 02:40:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 301 transitions. [2025-01-09 02:40:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 02:40:39,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:39,460 INFO L218 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] [2025-01-09 02:40:39,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 02:40:39,460 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:39,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash 995215422, now seen corresponding path program 1 times [2025-01-09 02:40:39,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:39,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464484190] [2025-01-09 02:40:39,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:39,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:39,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:40:39,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:40:39,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:39,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:40:40,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:40,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464484190] [2025-01-09 02:40:40,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464484190] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:40,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898220983] [2025-01-09 02:40:40,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:40,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:40,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:40,778 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:40:40,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:40:40,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:40:40,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:40:40,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:40,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:40,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 130 conjuncts are in the unsatisfiable core [2025-01-09 02:40:40,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:40:41,066 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 02:40:41,067 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 [2025-01-09 02:40:41,107 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 [2025-01-09 02:40:41,117 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 [2025-01-09 02:40:41,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:41,363 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 22 treesize of output 14 [2025-01-09 02:40:41,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-01-09 02:40:41,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2025-01-09 02:40:41,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 65 [2025-01-09 02:40:41,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 15 [2025-01-09 02:40:41,414 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 22 treesize of output 34 [2025-01-09 02:40:41,535 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2025-01-09 02:40:41,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 136 treesize of output 105 [2025-01-09 02:40:41,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2025-01-09 02:40:41,559 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:40:41,559 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 25 treesize of output 26 [2025-01-09 02:40:41,661 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:40:41,662 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 [2025-01-09 02:40:41,725 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 16 [2025-01-09 02:40:41,732 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 17 treesize of output 12 [2025-01-09 02:40:41,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:41,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:41,883 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2025-01-09 02:40:41,884 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 40 treesize of output 45 [2025-01-09 02:40:41,888 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 26 treesize of output 14 [2025-01-09 02:40:41,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2025-01-09 02:40:41,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 02:40:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:42,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:40:42,287 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_402 (Array Int Int))) (< |c_~#gl_list~0.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_402) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4)))) is different from false [2025-01-09 02:40:42,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_410 Int) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< |c_~#gl_list~0.offset| (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) v_ArrVal_412))) (store .cse0 |c_~#gl_list~0.base| (store (select (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_411) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_410))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_402) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4)))) is different from false [2025-01-09 02:40:42,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898220983] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:42,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:40:42,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2025-01-09 02:40:42,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030942261] [2025-01-09 02:40:42,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:40:42,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 02:40:42,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:42,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 02:40:42,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=936, Unknown=14, NotChecked=126, Total=1190 [2025-01-09 02:40:42,401 INFO L87 Difference]: Start difference. First operand 248 states and 301 transitions. Second operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 19 states have internal predecessors, (58), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 02:40:48,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:40:49,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:49,119 INFO L93 Difference]: Finished difference Result 270 states and 320 transitions. [2025-01-09 02:40:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 02:40:49,120 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 19 states have internal predecessors, (58), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2025-01-09 02:40:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:49,121 INFO L225 Difference]: With dead ends: 270 [2025-01-09 02:40:49,121 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 02:40:49,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=252, Invalid=1539, Unknown=23, NotChecked=166, Total=1980 [2025-01-09 02:40:49,123 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 600 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 2044 mSolverCounterSat, 112 mSolverCounterUnsat, 121 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2044 IncrementalHoareTripleChecker+Invalid, 121 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:49,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 376 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2044 Invalid, 121 Unknown, 0 Unchecked, 6.2s Time] [2025-01-09 02:40:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 02:40:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 252. [2025-01-09 02:40:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 216 states have (on average 1.2222222222222223) internal successors, (264), 231 states have internal predecessors, (264), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 02:40:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 303 transitions. [2025-01-09 02:40:49,157 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 303 transitions. Word has length 38 [2025-01-09 02:40:49,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:49,157 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 303 transitions. [2025-01-09 02:40:49,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 19 states have internal predecessors, (58), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 02:40:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 303 transitions. [2025-01-09 02:40:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 02:40:49,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:49,160 INFO L218 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] [2025-01-09 02:40:49,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 02:40:49,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:49,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:49,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash -115843551, now seen corresponding path program 1 times [2025-01-09 02:40:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:49,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974164212] [2025-01-09 02:40:49,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:49,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:40:49,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:40:49,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:49,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:50,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:50,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974164212] [2025-01-09 02:40:50,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974164212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:50,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:50,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 02:40:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480428747] [2025-01-09 02:40:50,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:50,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 02:40:50,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:50,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 02:40:50,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:40:50,067 INFO L87 Difference]: Start difference. First operand 252 states and 303 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) [2025-01-09 02:40:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:51,128 INFO L93 Difference]: Finished difference Result 269 states and 318 transitions. [2025-01-09 02:40:51,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 02:40:51,128 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 [2025-01-09 02:40:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:51,130 INFO L225 Difference]: With dead ends: 269 [2025-01-09 02:40:51,130 INFO L226 Difference]: Without dead ends: 266 [2025-01-09 02:40:51,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2025-01-09 02:40:51,131 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 402 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:51,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 240 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 02:40:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-09 02:40:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 252. [2025-01-09 02:40:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 216 states have (on average 1.2175925925925926) internal successors, (263), 231 states have internal predecessors, (263), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 02:40:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 302 transitions. [2025-01-09 02:40:51,170 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 302 transitions. Word has length 38 [2025-01-09 02:40:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:51,170 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 302 transitions. [2025-01-09 02:40:51,170 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) [2025-01-09 02:40:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 302 transitions. [2025-01-09 02:40:51,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 02:40:51,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:51,171 INFO L218 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, 1] [2025-01-09 02:40:51,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 02:40:51,171 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:51,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash 29157309, now seen corresponding path program 1 times [2025-01-09 02:40:51,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:51,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719812601] [2025-01-09 02:40:51,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:51,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:51,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 02:40:51,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 02:40:51,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:51,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:52,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:52,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719812601] [2025-01-09 02:40:52,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719812601] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:52,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703504585] [2025-01-09 02:40:52,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:52,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:52,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:52,640 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:40:52,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:40:52,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 02:40:52,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 02:40:52,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:52,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:52,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 109 conjuncts are in the unsatisfiable core [2025-01-09 02:40:52,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:40:52,921 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 02:40:52,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2025-01-09 02:40:52,998 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 [2025-01-09 02:40:53,012 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 [2025-01-09 02:40:53,025 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 [2025-01-09 02:40:53,030 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 [2025-01-09 02:40:53,168 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 [2025-01-09 02:40:53,174 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 39 treesize of output 44 [2025-01-09 02:40:53,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 20 [2025-01-09 02:40:53,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:53,188 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 40 treesize of output 21 [2025-01-09 02:40:53,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:40:53,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 21 treesize of output 23 [2025-01-09 02:40:53,251 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:40:53,251 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 46 treesize of output 41 [2025-01-09 02:40:53,348 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:40:53,349 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 [2025-01-09 02:40:53,400 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 38 treesize of output 27 [2025-01-09 02:40:53,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:40:53,411 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 30 treesize of output 12 [2025-01-09 02:40:54,052 INFO L349 Elim1Store]: treesize reduction 178, result has 16.0 percent of original size [2025-01-09 02:40:54,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 117 treesize of output 102 [2025-01-09 02:40:54,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:54,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:54,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:54,091 INFO L349 Elim1Store]: treesize reduction 77, result has 1.3 percent of original size [2025-01-09 02:40:54,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 195 [2025-01-09 02:40:54,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:54,120 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-09 02:40:54,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 58 treesize of output 50 [2025-01-09 02:40:54,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:40:54,129 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 61 treesize of output 45 [2025-01-09 02:40:54,140 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 [2025-01-09 02:40:54,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:54,165 INFO L349 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2025-01-09 02:40:54,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 112 [2025-01-09 02:40:54,190 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2025-01-09 02:40:54,191 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 26 treesize of output 24 [2025-01-09 02:40:54,197 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 [2025-01-09 02:40:54,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:54,215 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-09 02:40:54,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 39 treesize of output 35 [2025-01-09 02:40:54,317 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-01-09 02:40:54,317 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 2 case distinctions, treesize of input 66 treesize of output 63 [2025-01-09 02:40:54,591 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 30 treesize of output 12 [2025-01-09 02:40:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:54,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:40:54,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_616) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4))))) is different from false [2025-01-09 02:40:55,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703504585] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:55,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:40:55,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2025-01-09 02:40:55,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455923115] [2025-01-09 02:40:55,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:40:55,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 02:40:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:55,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 02:40:55,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1146, Unknown=1, NotChecked=68, Total=1332 [2025-01-09 02:40:55,122 INFO L87 Difference]: Start difference. First operand 252 states and 302 transitions. Second operand has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 20 states have internal predecessors, (69), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:41:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:41:04,628 INFO L93 Difference]: Finished difference Result 287 states and 335 transitions. [2025-01-09 02:41:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 02:41:04,629 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 20 states have internal predecessors, (69), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2025-01-09 02:41:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:41:04,630 INFO L225 Difference]: With dead ends: 287 [2025-01-09 02:41:04,630 INFO L226 Difference]: Without dead ends: 284 [2025-01-09 02:41:04,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=399, Invalid=2684, Unknown=1, NotChecked=108, Total=3192 [2025-01-09 02:41:04,632 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1274 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:41:04,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 452 Invalid, 2466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 02:41:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-01-09 02:41:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 252. [2025-01-09 02:41:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 216 states have (on average 1.212962962962963) internal successors, (262), 231 states have internal predecessors, (262), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 02:41:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 301 transitions. [2025-01-09 02:41:04,672 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 301 transitions. Word has length 41 [2025-01-09 02:41:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:41:04,673 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 301 transitions. [2025-01-09 02:41:04,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 20 states have internal predecessors, (69), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:41:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 301 transitions. [2025-01-09 02:41:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 02:41:04,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:41:04,673 INFO L218 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, 1, 1, 1] [2025-01-09 02:41:04,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 02:41:04,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:41:04,874 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:41:04,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:41:04,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1851346933, now seen corresponding path program 1 times [2025-01-09 02:41:04,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:41:04,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328876489] [2025-01-09 02:41:04,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:04,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:41:04,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 02:41:04,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 02:41:04,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:04,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:41:05,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:41:05,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328876489] [2025-01-09 02:41:05,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328876489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:41:05,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:41:05,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 02:41:05,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75827528] [2025-01-09 02:41:05,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:41:05,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 02:41:05,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:41:05,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 02:41:05,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-09 02:41:05,714 INFO L87 Difference]: Start difference. First operand 252 states and 301 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 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) [2025-01-09 02:41:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:41:06,893 INFO L93 Difference]: Finished difference Result 268 states and 315 transitions. [2025-01-09 02:41:06,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 02:41:06,894 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 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 41 [2025-01-09 02:41:06,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:41:06,896 INFO L225 Difference]: With dead ends: 268 [2025-01-09 02:41:06,896 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 02:41:06,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-01-09 02:41:06,897 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 359 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 02:41:06,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 273 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 02:41:06,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 02:41:06,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 252. [2025-01-09 02:41:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 216 states have (on average 1.2083333333333333) internal successors, (261), 231 states have internal predecessors, (261), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 02:41:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 300 transitions. [2025-01-09 02:41:06,949 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 300 transitions. Word has length 41 [2025-01-09 02:41:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:41:06,949 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 300 transitions. [2025-01-09 02:41:06,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 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) [2025-01-09 02:41:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 300 transitions. [2025-01-09 02:41:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 02:41:06,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:41:06,951 INFO L218 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, 1, 1, 1, 1] [2025-01-09 02:41:06,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 02:41:06,952 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:41:06,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:41:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash 785060523, now seen corresponding path program 1 times [2025-01-09 02:41:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:41:06,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466434716] [2025-01-09 02:41:06,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:06,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:41:06,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 02:41:07,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 02:41:07,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:07,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:08,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:41:08,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:41:08,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466434716] [2025-01-09 02:41:08,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466434716] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:41:08,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324493578] [2025-01-09 02:41:08,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:08,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:41:08,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:41:08,746 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:41:08,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:41:08,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 02:41:08,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 02:41:08,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:08,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:08,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 163 conjuncts are in the unsatisfiable core [2025-01-09 02:41:08,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:41:08,973 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:41:08,973 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 [2025-01-09 02:41:09,049 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 [2025-01-09 02:41:09,053 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 [2025-01-09 02:41:09,450 INFO L349 Elim1Store]: treesize reduction 118, result has 40.1 percent of original size [2025-01-09 02:41:09,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 134 [2025-01-09 02:41:09,482 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2025-01-09 02:41:09,482 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 1 case distinctions, treesize of input 53 treesize of output 53 [2025-01-09 02:41:09,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:09,533 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2025-01-09 02:41:09,539 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 14 treesize of output 18 [2025-01-09 02:41:09,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:41:09,556 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 41 treesize of output 53 [2025-01-09 02:41:09,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:09,568 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2025-01-09 02:41:09,571 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 3 [2025-01-09 02:41:09,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 [2025-01-09 02:41:09,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:09,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:09,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:09,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 52 [2025-01-09 02:41:09,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 02:41:09,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:09,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2025-01-09 02:41:09,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 [2025-01-09 02:41:09,640 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 14 treesize of output 18 [2025-01-09 02:41:09,650 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 3 [2025-01-09 02:41:09,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:09,663 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 71 [2025-01-09 02:41:09,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 02:41:09,687 INFO L349 Elim1Store]: treesize reduction 47, result has 21.7 percent of original size [2025-01-09 02:41:09,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 42 [2025-01-09 02:41:09,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:41:09,710 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 25 treesize of output 27 [2025-01-09 02:41:09,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:09,720 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 43 treesize of output 38 [2025-01-09 02:41:09,742 INFO L349 Elim1Store]: treesize reduction 47, result has 21.7 percent of original size [2025-01-09 02:41:09,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 33 treesize of output 42 [2025-01-09 02:41:09,992 INFO L349 Elim1Store]: treesize reduction 100, result has 23.7 percent of original size [2025-01-09 02:41:09,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 196 treesize of output 177 [2025-01-09 02:41:10,011 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-01-09 02:41:10,012 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 163 [2025-01-09 02:41:10,922 INFO L349 Elim1Store]: treesize reduction 36, result has 32.1 percent of original size [2025-01-09 02:41:10,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 356 treesize of output 342 [2025-01-09 02:41:11,268 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-01-09 02:41:11,269 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 321 treesize of output 275 [2025-01-09 02:41:11,303 INFO L349 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2025-01-09 02:41:11,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 311 treesize of output 216 [2025-01-09 02:41:11,365 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 15 treesize of output 3 [2025-01-09 02:41:11,491 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 19 treesize of output 7 [2025-01-09 02:41:12,435 INFO L349 Elim1Store]: treesize reduction 234, result has 20.1 percent of original size [2025-01-09 02:41:12,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 188 treesize of output 187 [2025-01-09 02:41:12,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:12,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:12,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:12,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 134 [2025-01-09 02:41:12,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:12,471 INFO L349 Elim1Store]: treesize reduction 84, result has 9.7 percent of original size [2025-01-09 02:41:12,472 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 196 [2025-01-09 02:41:12,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 159 treesize of output 135 [2025-01-09 02:41:12,485 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 84 treesize of output 74 [2025-01-09 02:41:12,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 79 [2025-01-09 02:41:12,502 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-01-09 02:41:12,502 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 82 treesize of output 72 [2025-01-09 02:41:12,750 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2025-01-09 02:41:12,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 506 treesize of output 388 [2025-01-09 02:41:12,784 INFO L349 Elim1Store]: treesize reduction 92, result has 20.0 percent of original size [2025-01-09 02:41:12,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 145 treesize of output 128 [2025-01-09 02:41:13,820 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:41:13,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 23 [2025-01-09 02:41:13,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 35 treesize of output 15 [2025-01-09 02:41:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:41:13,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:41:14,392 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_841 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_841)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_842))) (let ((.cse2 (select (select .cse3 |c_~#gl_list~0.base|) .cse4)) (.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse4))) (or (not (= .cse0 (select (select .cse1 .cse2) .cse0))) (= .cse2 |c_~#gl_list~0.base|) (not (= .cse2 (select (select .cse3 .cse2) .cse0))))))) (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_841 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_841)) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_842))) (let ((.cse7 (select (select .cse8 |c_~#gl_list~0.base|) .cse4)) (.cse5 (select (select .cse6 |c_~#gl_list~0.base|) .cse4))) (or (not (= .cse5 (select (select .cse6 .cse7) .cse5))) (= |c_~#gl_list~0.offset| .cse5) (not (= .cse7 (select (select .cse8 .cse7) .cse5))))))))) is different from false [2025-01-09 02:41:15,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324493578] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:41:15,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:41:15,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 33 [2025-01-09 02:41:15,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501600445] [2025-01-09 02:41:15,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:41:15,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 02:41:15,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:41:15,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 02:41:15,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1585, Unknown=5, NotChecked=80, Total=1806 [2025-01-09 02:41:15,484 INFO L87 Difference]: Start difference. First operand 252 states and 300 transitions. Second operand has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 24 states have internal predecessors, (75), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:41:24,885 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 176 DAG size of output: 148 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 02:41:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:41:33,990 INFO L93 Difference]: Finished difference Result 363 states and 425 transitions. [2025-01-09 02:41:33,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 02:41:33,991 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 24 states have internal predecessors, (75), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2025-01-09 02:41:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:41:33,993 INFO L225 Difference]: With dead ends: 363 [2025-01-09 02:41:33,994 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 02:41:33,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=438, Invalid=3979, Unknown=9, NotChecked=130, Total=4556 [2025-01-09 02:41:33,996 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1094 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 4273 mSolverCounterSat, 167 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 4449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 4273 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:41:33,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 862 Invalid, 4449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 4273 Invalid, 9 Unknown, 0 Unchecked, 7.1s Time] [2025-01-09 02:41:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 02:41:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 335. [2025-01-09 02:41:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 291 states have (on average 1.2061855670103092) internal successors, (351), 307 states have internal predecessors, (351), 33 states have call successors, (33), 12 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 02:41:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 399 transitions. [2025-01-09 02:41:34,056 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 399 transitions. Word has length 44 [2025-01-09 02:41:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:41:34,056 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 399 transitions. [2025-01-09 02:41:34,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 24 states have internal predecessors, (75), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:41:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 399 transitions. [2025-01-09 02:41:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 02:41:34,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:41:34,057 INFO L218 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, 1, 1, 1, 1, 1, 1] [2025-01-09 02:41:34,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 02:41:34,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:41:34,258 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:41:34,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:41:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1610586064, now seen corresponding path program 1 times [2025-01-09 02:41:34,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:41:34,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812844942] [2025-01-09 02:41:34,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:34,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:41:34,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 02:41:34,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 02:41:34,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:34,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 02:41:34,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 02:41:34,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 02:41:34,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 02:41:34,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:34,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 02:41:34,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 02:41:34,320 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 02:41:34,322 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 02:41:34,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 02:41:34,326 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:41:34,362 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:41:34,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:41:34 BoogieIcfgContainer [2025-01-09 02:41:34,366 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 02:41:34,366 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 02:41:34,366 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 02:41:34,367 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 02:41:34,379 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:40:29" (3/4) ... [2025-01-09 02:41:34,380 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 02:41:34,432 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 31. [2025-01-09 02:41:34,500 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 02:41:34,502 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 02:41:34,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 02:41:34,504 INFO L158 Benchmark]: Toolchain (without parser) took 66263.45ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 111.1MB in the beginning and 501.5MB in the end (delta: -390.5MB). Peak memory consumption was 328.7MB. Max. memory is 16.1GB. [2025-01-09 02:41:34,504 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:41:34,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.53ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 84.2MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 02:41:34,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.30ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:41:34,505 INFO L158 Benchmark]: Boogie Preprocessor took 67.31ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 78.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:41:34,505 INFO L158 Benchmark]: RCFGBuilder took 575.81ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 52.9MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 02:41:34,506 INFO L158 Benchmark]: TraceAbstraction took 64911.64ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 52.5MB in the beginning and 190.2MB in the end (delta: -137.7MB). Peak memory consumption was 261.5MB. Max. memory is 16.1GB. [2025-01-09 02:41:34,506 INFO L158 Benchmark]: Witness Printer took 136.22ms. Allocated memory is still 545.3MB. Free memory was 190.2MB in the beginning and 501.5MB in the end (delta: -311.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:41:34,507 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 517.53ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 84.2MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.30ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.31ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 78.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 575.81ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 52.9MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 64911.64ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 52.5MB in the beginning and 190.2MB in the end (delta: -137.7MB). Peak memory consumption was 261.5MB. Max. memory is 16.1GB. * Witness Printer took 136.22ms. Allocated memory is still 545.3MB. Free memory was 190.2MB in the beginning and 501.5MB in the end (delta: -311.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 840]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; VAL [gl_list={3:0}] [L949] CALL gl_read() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) VAL [gl_list={3:0}, node={-2:0}, value=-1] [L902] node->value = value VAL [gl_list={3:0}] [L903] CALL list_add(&node->linkage, &gl_list) VAL [gl_list={3:0}] [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new VAL [\old(head)={3:0}, \old(new)={-2:4}, gl_list={3:0}] [L890] RET __list_add(new, head, head->next) [L903] RET list_add(&node->linkage, &gl_list) VAL [gl_list={3:0}, node={-2:0}] [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->next = (&node->nested) VAL [gl_list={3:0}] [L904] COND FALSE !(0) VAL [gl_list={3:0}, node={-2:0}] [L909] RET gl_insert(__VERIFIER_nondet_int()) [L911] COND FALSE !(__VERIFIER_nondet_int()) [L949] RET gl_read() [L950] CALL inspect(&gl_list) VAL [\old(head)={3:0}, gl_list={3:0}] [L853] COND FALSE !(!(head)) VAL [\old(head)={3:0}, gl_list={3:0}, head={3:0}] [L853] COND FALSE !(0) VAL [\old(head)={3:0}, gl_list={3:0}, head={3:0}] [L854] EXPR head->next VAL [\old(head)={3:0}, gl_list={3:0}, head={3:0}] [L854] COND FALSE !(!(head->next != head)) [L854] COND FALSE !(0) VAL [\old(head)={3:0}, gl_list={3:0}, head={3:0}] [L855] EXPR head->prev VAL [\old(head)={3:0}, gl_list={3:0}, head={3:0}] [L855] COND FALSE !(!(head->prev != head)) [L855] COND FALSE !(0) VAL [\old(head)={3:0}, gl_list={3:0}, head={3:0}] [L856] EXPR head->prev [L856] head = head->prev [L857] COND FALSE !(!(head)) VAL [\old(head)={3:0}, gl_list={3:0}, head={-2:4}] [L857] COND FALSE !(0) VAL [\old(head)={3:0}, gl_list={3:0}, head={-2:4}] [L858] EXPR head->next VAL [\old(head)={3:0}, gl_list={3:0}, head={-2:4}] [L858] COND FALSE !(!(head->next != head)) [L858] COND FALSE !(0) VAL [\old(head)={3:0}, gl_list={3:0}, head={-2:4}] [L859] EXPR head->prev VAL [\old(head)={3:0}, gl_list={3:0}, head={-2:4}] [L859] COND FALSE !(!(head->prev != head)) [L859] COND FALSE !(0) VAL [\old(head)={3:0}, gl_list={3:0}, head={-2:4}] [L860] const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [\old(head)={3:0}, gl_list={3:0}, head={-2:4}, node={-2:0}] [L861] COND FALSE !(!(node)) VAL [\old(head)={3:0}, gl_list={3:0}, head={-2:4}, node={-2:0}] [L861] COND FALSE !(0) VAL [\old(head)={3:0}, gl_list={3:0}, head={-2:4}, node={-2:0}] [L862] EXPR node->nested.next VAL [\old(head)={3:0}, gl_list={3:0}, head={-2:4}, node={-2:0}] [L862] COND FALSE !(!(node->nested.next == &node->nested)) [L862] COND FALSE !(0) VAL [\old(head)={3:0}, gl_list={3:0}, head={-2:4}, node={-2:0}] [L863] EXPR node->nested.prev VAL [\old(head)={3:0}, gl_list={3:0}, head={-2:4}, node={-2:0}] [L863] COND TRUE !(node->nested.prev == &node->nested) [L863] CALL fail() VAL [gl_list={3:0}] [L840] reach_error() VAL [gl_list={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.8s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 41.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 130 mSolverCounterUnknown, 5590 SdHoareTripleChecker+Valid, 23.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5567 mSDsluCounter, 4037 SdHoareTripleChecker+Invalid, 22.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3420 mSDsCounter, 765 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15098 IncrementalHoareTripleChecker+Invalid, 15993 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 765 mSolverCounterUnsat, 617 mSDtfsCounter, 15098 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 292 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1878 ImplicationChecksByTransitivity, 23.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=12, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 185 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 543 NumberOfCodeBlocks, 543 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 484 ConstructedInterpolants, 42 QuantifiedInterpolants, 19746 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1080 ConjunctsInSsa, 402 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 3/72 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 02:41:34,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE