./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:25:30,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:25:30,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:25:30,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:25:30,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:25:30,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:25:30,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:25:30,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:25:30,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:25:30,339 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:25:30,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:25:30,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:25:30,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:25:30,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:25:30,341 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:25:30,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:25:30,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:25:30,341 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:25:30,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:25:30,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:25:30,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:25:30,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:25:30,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:25:30,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:25:30,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:25:30,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:25:30,342 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:25:30,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:25:30,342 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:25:30,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:25:30,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:25:30,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:25:30,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:25:30,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:25:30,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:25:30,343 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:25:30,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:25:30,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:25:30,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:25:30,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:25:30,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:25:30,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:25:30,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:25:30,344 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/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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2025-03-03 13:25:30,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:25:30,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:25:30,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:25:30,597 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:25:30,597 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:25:30,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2025-03-03 13:25:31,792 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff6c0e3e5/20138becb3944a1490629e9e126895be/FLAGa30907311 [2025-03-03 13:25:32,029 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:25:32,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2025-03-03 13:25:32,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff6c0e3e5/20138becb3944a1490629e9e126895be/FLAGa30907311 [2025-03-03 13:25:32,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff6c0e3e5/20138becb3944a1490629e9e126895be [2025-03-03 13:25:32,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:25:32,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:25:32,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:25:32,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:25:32,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:25:32,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32, skipping insertion in model container [2025-03-03 13:25:32,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:25:32,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2025-03-03 13:25:32,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:25:32,313 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:25:32,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2025-03-03 13:25:32,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:25:32,370 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:25:32,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32 WrapperNode [2025-03-03 13:25:32,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:25:32,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:25:32,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:25:32,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:25:32,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,394 INFO L138 Inliner]: procedures = 127, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 129 [2025-03-03 13:25:32,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:25:32,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:25:32,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:25:32,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:25:32,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,429 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 12, 6]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2025-03-03 13:25:32,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:25:32,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:25:32,451 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:25:32,451 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:25:32,452 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32" (1/1) ... [2025-03-03 13:25:32,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:25:32,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:25:32,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:25:32,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:25:32,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:25:32,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:25:32,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 13:25:32,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:25:32,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:25:32,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 13:25:32,501 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-03 13:25:32,501 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-03 13:25:32,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:25:32,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:25:32,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:25:32,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 13:25:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 13:25:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 13:25:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 13:25:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 13:25:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 13:25:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:25:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 13:25:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 13:25:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 13:25:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:25:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:25:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 13:25:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:25:32,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:25:32,604 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:25:32,605 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:25:32,764 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-03 13:25:32,784 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-03 13:25:32,799 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-03 13:25:32,800 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:25:32,807 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:25:32,807 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:25:32,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:25:32 BoogieIcfgContainer [2025-03-03 13:25:32,808 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:25:32,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:25:32,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:25:32,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:25:32,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:25:32" (1/3) ... [2025-03-03 13:25:32,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef8f638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:25:32, skipping insertion in model container [2025-03-03 13:25:32,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:25:32" (2/3) ... [2025-03-03 13:25:32,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef8f638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:25:32, skipping insertion in model container [2025-03-03 13:25:32,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:25:32" (3/3) ... [2025-03-03 13:25:32,817 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2025-03-03 13:25:32,829 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:25:32,830 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_append_unequal.i that has 2 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 13:25:32,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:25:32,874 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;@4f50b482, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:25:32,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:25:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:25:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 13:25:32,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:25:32,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:25:32,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:25:32,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:25:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash -481451351, now seen corresponding path program 1 times [2025-03-03 13:25:32,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:25:32,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001350071] [2025-03-03 13:25:32,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:25:32,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:25:32,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 13:25:32,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:25:32,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:25:32,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:25:33,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:25:33,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001350071] [2025-03-03 13:25:33,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001350071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:25:33,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:25:33,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:25:33,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619906080] [2025-03-03 13:25:33,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:25:33,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:25:33,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:25:33,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:25:33,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:25:33,212 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:25:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:25:33,240 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2025-03-03 13:25:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:25:33,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-03 13:25:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:25:33,246 INFO L225 Difference]: With dead ends: 64 [2025-03-03 13:25:33,247 INFO L226 Difference]: Without dead ends: 30 [2025-03-03 13:25:33,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:25:33,253 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:25:33,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:25:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-03 13:25:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-03 13:25:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:25:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-03 13:25:33,282 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 16 [2025-03-03 13:25:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:25:33,283 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-03 13:25:33,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:25:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-03-03 13:25:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:25:33,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:25:33,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:25:33,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:25:33,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:25:33,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:25:33,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1001701419, now seen corresponding path program 1 times [2025-03-03 13:25:33,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:25:33,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501857509] [2025-03-03 13:25:33,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:25:33,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:25:33,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:25:33,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:25:33,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:25:33,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 13:25:33,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:25:33,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501857509] [2025-03-03 13:25:33,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501857509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:25:33,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858980362] [2025-03-03 13:25:33,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:25:33,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:25:33,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:25:33,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:25:33,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:25:33,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:25:33,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:25:33,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:25:33,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:33,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:25:33,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:25:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:25:33,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:25:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 13:25:33,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858980362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:25:33,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:25:33,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-03 13:25:33,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605162295] [2025-03-03 13:25:33,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:25:33,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:25:33,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:25:33,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:25:33,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:25:33,717 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 13:25:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:25:33,741 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-03-03 13:25:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:25:33,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2025-03-03 13:25:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:25:33,743 INFO L225 Difference]: With dead ends: 53 [2025-03-03 13:25:33,743 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 13:25:33,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:25:33,743 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:25:33,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:25:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 13:25:33,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-03 13:25:33,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:25:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-03-03 13:25:33,746 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 24 [2025-03-03 13:25:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:25:33,746 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-03-03 13:25:33,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 13:25:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-03-03 13:25:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 13:25:33,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:25:33,747 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:25:33,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 13:25:33,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:25:33,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:25:33,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:25:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1215249325, now seen corresponding path program 2 times [2025-03-03 13:25:33,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:25:33,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082151543] [2025-03-03 13:25:33,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:25:33,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:25:33,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-03 13:25:33,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:25:33,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:25:33,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 13:25:34,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:25:34,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082151543] [2025-03-03 13:25:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082151543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:25:34,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672056610] [2025-03-03 13:25:34,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:25:34,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:25:34,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:25:34,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:25:34,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:25:34,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-03 13:25:34,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:25:34,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:25:34,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:34,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 13:25:34,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:25:34,566 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 16 treesize of output 8 [2025-03-03 13:25:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:25:34,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:25:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 13:25:34,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672056610] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:25:34,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:25:34,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2025-03-03 13:25:34,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537291620] [2025-03-03 13:25:34,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:25:34,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:25:34,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:25:34,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:25:34,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:25:34,631 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 13:25:38,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:25:42,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:25:46,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:25:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:25:46,830 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2025-03-03 13:25:46,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 13:25:46,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2025-03-03 13:25:46,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:25:46,836 INFO L225 Difference]: With dead ends: 46 [2025-03-03 13:25:46,836 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 13:25:46,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:25:46,837 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:25:46,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 258 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2025-03-03 13:25:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 13:25:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-03 13:25:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:25:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-03 13:25:46,844 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 32 [2025-03-03 13:25:46,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:25:46,844 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-03 13:25:46,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 13:25:46,845 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-03 13:25:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 13:25:46,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:25:46,845 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:25:46,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:25:47,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 13:25:47,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:25:47,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:25:47,047 INFO L85 PathProgramCache]: Analyzing trace with hash 88309504, now seen corresponding path program 1 times [2025-03-03 13:25:47,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:25:47,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625208736] [2025-03-03 13:25:47,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:25:47,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:25:47,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 13:25:47,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:25:47,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:25:47,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:25:47,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:25:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625208736] [2025-03-03 13:25:47,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625208736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:25:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251517913] [2025-03-03 13:25:47,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:25:47,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:25:47,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:25:47,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:25:47,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:25:48,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 13:25:48,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:25:48,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:25:48,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:48,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 13:25:48,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:25:48,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-03 13:25:48,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-03 13:25:48,234 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 18 treesize of output 4 [2025-03-03 13:25:48,237 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 9 treesize of output 3 [2025-03-03 13:25:48,258 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_25| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_25| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_25|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_25|) 0))) is different from true [2025-03-03 13:25:48,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:25:48,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-03 13:25:48,284 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-03 13:25:48,285 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 15 treesize of output 15 [2025-03-03 13:25:48,391 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2025-03-03 13:25:48,391 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 47 treesize of output 42 [2025-03-03 13:25:48,403 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 36 treesize of output 28 [2025-03-03 13:25:48,406 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 28 treesize of output 20 [2025-03-03 13:25:48,408 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 20 treesize of output 8 [2025-03-03 13:25:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-03 13:25:48,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:25:48,590 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_328 (Array Int Int)) (|v_node_create_~temp~0#1.base_30| Int)) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_30|) 0)) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_30| v_ArrVal_328) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0)))) is different from false [2025-03-03 13:25:48,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251517913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:25:48,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:25:48,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 29 [2025-03-03 13:25:48,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730270852] [2025-03-03 13:25:48,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:25:48,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 13:25:48,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:25:48,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 13:25:48,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=793, Unknown=2, NotChecked=114, Total=992 [2025-03-03 13:25:48,595 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 25 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 13:25:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:25:49,050 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-03-03 13:25:49,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 13:25:49,050 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 25 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2025-03-03 13:25:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:25:49,053 INFO L225 Difference]: With dead ends: 50 [2025-03-03 13:25:49,053 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 13:25:49,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=1215, Unknown=2, NotChecked=142, Total=1482 [2025-03-03 13:25:49,054 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:25:49,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 363 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 509 Invalid, 0 Unknown, 39 Unchecked, 0.3s Time] [2025-03-03 13:25:49,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 13:25:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-03-03 13:25:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:25:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-03-03 13:25:49,065 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 35 [2025-03-03 13:25:49,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:25:49,065 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-03 13:25:49,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 25 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 13:25:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-03-03 13:25:49,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:25:49,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:25:49,067 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:25:49,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 13:25:49,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:25:49,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:25:49,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:25:49,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1345904660, now seen corresponding path program 1 times [2025-03-03 13:25:49,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:25:49,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662871809] [2025-03-03 13:25:49,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:25:49,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:25:49,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:25:49,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:25:49,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:25:49,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:25:50,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:25:50,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662871809] [2025-03-03 13:25:50,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662871809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:25:50,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897439586] [2025-03-03 13:25:50,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:25:50,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:25:50,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:25:50,511 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:25:50,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:25:50,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:25:50,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:25:50,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:25:50,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:50,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-03 13:25:50,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:25:50,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-03 13:25:50,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:25:50,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 13:25:50,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 13:25:51,079 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 9 treesize of output 3 [2025-03-03 13:25:51,082 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 11 treesize of output 3 [2025-03-03 13:25:51,084 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 11 treesize of output 3 [2025-03-03 13:25:51,186 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_33| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_33| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_33|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_33|) 0) (= (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_33| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_33|)) |c_#memory_int#1|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3|) 0) 0))) is different from true [2025-03-03 13:25:51,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:25:51,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-03 13:25:51,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:25:51,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-03 13:25:51,245 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-03 13:25:51,246 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 15 treesize of output 15 [2025-03-03 13:25:51,405 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 23 treesize of output 7 [2025-03-03 13:25:51,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:25:51,502 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 31 treesize of output 15 [2025-03-03 13:25:51,558 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 19 treesize of output 11 [2025-03-03 13:25:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-03 13:25:51,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:25:51,762 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_19| Int)) (or (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (v_ArrVal_450 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_450) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_450 (let ((.cse0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_19| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_450 .cse0))))))) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_19| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))))) is different from false [2025-03-03 13:25:51,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897439586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:25:51,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:25:51,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 41 [2025-03-03 13:25:51,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689204249] [2025-03-03 13:25:51,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:25:51,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 13:25:51,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:25:51,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 13:25:51,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1641, Unknown=32, NotChecked=166, Total=1980 [2025-03-03 13:25:51,980 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 41 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 35 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:25:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:25:56,958 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2025-03-03 13:25:56,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 13:25:56,958 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 35 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2025-03-03 13:25:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:25:56,959 INFO L225 Difference]: With dead ends: 57 [2025-03-03 13:25:56,959 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 13:25:56,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=252, Invalid=2913, Unknown=35, NotChecked=222, Total=3422 [2025-03-03 13:25:56,961 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 13:25:56,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 383 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 670 Invalid, 0 Unknown, 60 Unchecked, 0.5s Time] [2025-03-03 13:25:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 13:25:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2025-03-03 13:25:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:25:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-03-03 13:25:56,969 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 39 [2025-03-03 13:25:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:25:56,970 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-03-03 13:25:56,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 35 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:25:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-03-03 13:25:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 13:25:56,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:25:56,972 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:25:56,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 13:25:57,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:25:57,173 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:25:57,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:25:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1226660798, now seen corresponding path program 1 times [2025-03-03 13:25:57,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:25:57,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328842575] [2025-03-03 13:25:57,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:25:57,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:25:57,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 13:25:57,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:25:57,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:25:57,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:25:57,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:25:57,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328842575] [2025-03-03 13:25:57,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328842575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:25:57,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:25:57,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:25:57,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731928131] [2025-03-03 13:25:57,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:25:57,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:25:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:25:57,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:25:57,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:25:57,264 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:25:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:25:57,310 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2025-03-03 13:25:57,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:25:57,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-03-03 13:25:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:25:57,311 INFO L225 Difference]: With dead ends: 53 [2025-03-03 13:25:57,311 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 13:25:57,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:25:57,311 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:25:57,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:25:57,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 13:25:57,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-03 13:25:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:25:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-03-03 13:25:57,323 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 40 [2025-03-03 13:25:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:25:57,323 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-03-03 13:25:57,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:25:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-03-03 13:25:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 13:25:57,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:25:57,324 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:25:57,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 13:25:57,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:25:57,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:25:57,324 INFO L85 PathProgramCache]: Analyzing trace with hash -517945099, now seen corresponding path program 2 times [2025-03-03 13:25:57,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:25:57,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269289177] [2025-03-03 13:25:57,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:25:57,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:25:57,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-03 13:25:57,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 13:25:57,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:25:57,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:25:59,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:25:59,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269289177] [2025-03-03 13:25:59,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269289177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:25:59,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033885436] [2025-03-03 13:25:59,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:25:59,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:25:59,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:25:59,418 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:25:59,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:25:59,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-03 13:25:59,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 13:25:59,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:25:59,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:59,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-03-03 13:25:59,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:25:59,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-03 13:25:59,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-03 13:25:59,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:25:59,849 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:25:59,849 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-03-03 13:25:59,864 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 18 treesize of output 13 [2025-03-03 13:25:59,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 13:25:59,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 13:25:59,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 33 treesize of output 21 [2025-03-03 13:26:00,186 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-03-03 13:26:00,187 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 20 [2025-03-03 13:26:00,192 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 7 [2025-03-03 13:26:00,196 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 11 treesize of output 3 [2025-03-03 13:26:00,338 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_42| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_42| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_42|))) (= 0 (select |c_old(#valid)| |v_node_create_~temp~0#1.base_42|)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_42| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_42|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_42| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_42|)))))) is different from true [2025-03-03 13:26:00,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:26:00,378 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-03 13:26:00,379 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 63 treesize of output 52 [2025-03-03 13:26:00,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:26:00,389 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 34 treesize of output 29 [2025-03-03 13:26:00,406 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-03 13:26:00,406 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 28 treesize of output 30 [2025-03-03 13:26:00,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-03 13:26:00,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-03 13:26:00,993 INFO L349 Elim1Store]: treesize reduction 41, result has 29.3 percent of original size [2025-03-03 13:26:00,994 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 53 treesize of output 43 [2025-03-03 13:26:00,999 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 31 treesize of output 15 [2025-03-03 13:26:01,083 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 72 treesize of output 44 [2025-03-03 13:26:01,092 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-03 13:26:01,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 15 [2025-03-03 13:26:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-03 13:26:01,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:26:01,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_642 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_642) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_642 (let ((.cse0 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_642 .cse0))))))) is different from false [2025-03-03 13:26:01,323 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_25| Int) (v_ArrVal_642 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse0 v_ArrVal_642) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_642 (let ((.cse1 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| 4))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_642 .cse1)))))))) is different from false [2025-03-03 13:26:01,344 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_25| Int) (v_ArrVal_642 (Array Int Int))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2)) (+ 4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2)))))) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| 4))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_642 .cse1))) v_ArrVal_642)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse0 v_ArrVal_642) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2025-03-03 13:26:01,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033885436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:26:01,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:26:01,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2025-03-03 13:26:01,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12291119] [2025-03-03 13:26:01,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:26:01,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-03 13:26:01,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:26:01,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-03 13:26:01,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2388, Unknown=4, NotChecked=404, Total=2970 [2025-03-03 13:26:01,686 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 47 states, 45 states have (on average 1.511111111111111) internal successors, (68), 38 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:26:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:26:03,430 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2025-03-03 13:26:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 13:26:03,431 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 1.511111111111111) internal successors, (68), 38 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2025-03-03 13:26:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:26:03,432 INFO L225 Difference]: With dead ends: 101 [2025-03-03 13:26:03,433 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 13:26:03,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=307, Invalid=4397, Unknown=4, NotChecked=548, Total=5256 [2025-03-03 13:26:03,434 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 13:26:03,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 646 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1157 Invalid, 0 Unknown, 96 Unchecked, 0.8s Time] [2025-03-03 13:26:03,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 13:26:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 64. [2025-03-03 13:26:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 13:26:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2025-03-03 13:26:03,448 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 41 [2025-03-03 13:26:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:26:03,450 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2025-03-03 13:26:03,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 1.511111111111111) internal successors, (68), 38 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:26:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2025-03-03 13:26:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 13:26:03,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:26:03,453 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:26:03,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 13:26:03,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:26:03,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:26:03,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:26:03,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1966329985, now seen corresponding path program 1 times [2025-03-03 13:26:03,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:26:03,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122790998] [2025-03-03 13:26:03,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:26:03,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:26:03,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 13:26:03,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 13:26:03,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:26:03,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:26:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:26:05,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:26:05,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122790998] [2025-03-03 13:26:05,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122790998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:26:05,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67434570] [2025-03-03 13:26:05,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:26:05,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:26:05,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:26:05,555 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:26:05,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:26:05,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 13:26:05,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 13:26:05,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:26:05,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:26:05,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 154 conjuncts are in the unsatisfiable core [2025-03-03 13:26:05,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:26:05,731 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 6 treesize of output 5 [2025-03-03 13:26:05,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:26:05,887 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 23 treesize of output 11 [2025-03-03 13:26:05,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:26:05,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:26:06,158 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:26:06,158 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-03 13:26:06,181 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:26:06,182 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 17 treesize of output 21 [2025-03-03 13:26:06,194 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-03-03 13:26:06,205 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-03-03 13:26:06,277 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 23 treesize of output 22 [2025-03-03 13:26:06,289 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 27 treesize of output 15 [2025-03-03 13:26:06,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:26:06,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-03 13:26:06,536 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-03 13:26:06,536 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 38 [2025-03-03 13:26:06,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2025-03-03 13:26:06,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-03 13:26:06,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 7 [2025-03-03 13:26:08,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:26:08,133 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-03 13:26:08,133 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 79 treesize of output 56 [2025-03-03 13:26:08,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:26:08,151 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 24 treesize of output 19 [2025-03-03 13:26:08,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:26:08,238 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-03 13:26:08,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-03 13:26:08,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:26:08,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-03-03 13:26:09,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:26:10,084 INFO L349 Elim1Store]: treesize reduction 140, result has 24.7 percent of original size [2025-03-03 13:26:10,084 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 123 treesize of output 111 [2025-03-03 13:26:10,286 INFO L349 Elim1Store]: treesize reduction 87, result has 31.5 percent of original size [2025-03-03 13:26:10,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 80 treesize of output 67 [2025-03-03 13:26:10,388 INFO L349 Elim1Store]: treesize reduction 37, result has 45.6 percent of original size [2025-03-03 13:26:10,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2025-03-03 13:26:10,749 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 110 treesize of output 74 [2025-03-03 13:26:12,327 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2025-03-03 13:26:12,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 113 [2025-03-03 13:26:12,648 INFO L349 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2025-03-03 13:26:12,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 74 treesize of output 106 [2025-03-03 13:26:14,093 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 35 treesize of output 27 [2025-03-03 13:26:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:26:14,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:26:37,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67434570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:26:37,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:26:37,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 55 [2025-03-03 13:26:37,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078200447] [2025-03-03 13:26:37,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:26:37,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-03 13:26:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:26:37,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-03 13:26:37,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=4150, Unknown=35, NotChecked=0, Total=4422 [2025-03-03 13:26:37,798 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 55 states, 53 states have (on average 1.320754716981132) internal successors, (70), 46 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:26:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:26:57,677 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2025-03-03 13:26:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-03 13:26:57,677 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.320754716981132) internal successors, (70), 46 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2025-03-03 13:26:57,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:26:57,678 INFO L225 Difference]: With dead ends: 119 [2025-03-03 13:26:57,678 INFO L226 Difference]: Without dead ends: 96 [2025-03-03 13:26:57,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2092 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=583, Invalid=9679, Unknown=40, NotChecked=0, Total=10302 [2025-03-03 13:26:57,680 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 86 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:26:57,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 430 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2025-03-03 13:26:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-03 13:26:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 67. [2025-03-03 13:26:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 13:26:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2025-03-03 13:26:57,690 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 42 [2025-03-03 13:26:57,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:26:57,690 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2025-03-03 13:26:57,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.320754716981132) internal successors, (70), 46 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:26:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2025-03-03 13:26:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 13:26:57,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:26:57,691 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 13:26:57,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 13:26:57,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:26:57,891 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:26:57,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:26:57,892 INFO L85 PathProgramCache]: Analyzing trace with hash -826719689, now seen corresponding path program 1 times [2025-03-03 13:26:57,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:26:57,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405935233] [2025-03-03 13:26:57,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:26:57,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:26:57,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 13:26:57,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:26:57,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:26:57,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:27:02,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:02,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405935233] [2025-03-03 13:27:02,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405935233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:02,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257714154] [2025-03-03 13:27:02,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:02,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:02,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:02,391 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:27:02,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 13:27:02,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 13:27:02,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:27:02,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:02,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:02,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 149 conjuncts are in the unsatisfiable core [2025-03-03 13:27:02,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:02,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-03 13:27:04,127 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:27:04,127 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-03-03 13:27:04,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:27:04,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 13:27:05,348 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 14 [2025-03-03 13:27:05,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-03 13:27:05,369 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 7 [2025-03-03 13:27:06,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:27:06,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:27:06,581 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 38 treesize of output 27 [2025-03-03 13:27:06,691 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-03 13:27:06,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-03 13:27:06,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-03 13:27:09,995 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-03 13:27:09,995 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 201 treesize of output 99 [2025-03-03 13:27:10,046 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 54 treesize of output 33 [2025-03-03 13:27:10,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 23