./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_append_equal.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 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:56:42,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:56:42,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:56:42,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:56:42,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:56:42,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:56:42,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:56:42,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:56:42,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:56:42,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:56:42,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:56:42,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:56:42,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:56:42,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:56:42,755 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:56:42,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:56:42,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:56:42,756 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:56:42,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:56:42,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:56:42,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:56:42,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:56:42,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:56:42,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:56:42,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:56:42,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:56:42,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:56:42,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:56:42,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:56:42,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:56:42,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:56:42,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:56:42,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:56:42,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:56:42,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:56:42,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:56:42,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:56:42,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:56:42,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:56:42,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:56:42,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:56:42,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:56:42,768 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2024-11-08 13:56:43,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:56:43,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:56:43,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:56:43,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:56:43,064 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:56:43,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_equal.i [2024-11-08 13:56:44,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:56:44,791 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:56:44,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2024-11-08 13:56:44,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2422c89/97dfbf65078a47069ece92178d5b5e01/FLAG675950d96 [2024-11-08 13:56:44,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2422c89/97dfbf65078a47069ece92178d5b5e01 [2024-11-08 13:56:44,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:56:44,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:56:44,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:56:44,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:56:44,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:56:44,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:56:44" (1/1) ... [2024-11-08 13:56:44,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321e0fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:44, skipping insertion in model container [2024-11-08 13:56:44,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:56:44" (1/1) ... [2024-11-08 13:56:44,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:56:45,154 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/dll2c_append_equal.i[24585,24598] [2024-11-08 13:56:45,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:56:45,168 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:56:45,224 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/dll2c_append_equal.i[24585,24598] [2024-11-08 13:56:45,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:56:45,253 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:56:45,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45 WrapperNode [2024-11-08 13:56:45,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:56:45,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:56:45,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:56:45,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:56:45,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45" (1/1) ... [2024-11-08 13:56:45,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45" (1/1) ... [2024-11-08 13:56:45,318 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2024-11-08 13:56:45,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:56:45,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:56:45,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:56:45,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:56:45,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45" (1/1) ... [2024-11-08 13:56:45,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45" (1/1) ... [2024-11-08 13:56:45,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45" (1/1) ... [2024-11-08 13:56:45,369 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 18, 9]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2024-11-08 13:56:45,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45" (1/1) ... [2024-11-08 13:56:45,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45" (1/1) ... [2024-11-08 13:56:45,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45" (1/1) ... [2024-11-08 13:56:45,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45" (1/1) ... [2024-11-08 13:56:45,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45" (1/1) ... [2024-11-08 13:56:45,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45" (1/1) ... [2024-11-08 13:56:45,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:56:45,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:56:45,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:56:45,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:56:45,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45" (1/1) ... [2024-11-08 13:56:45,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:56:45,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:56:45,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:56:45,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:56:45,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:56:45,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:56:45,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:56:45,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:56:45,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:56:45,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:56:45,498 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-08 13:56:45,499 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-08 13:56:45,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:56:45,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:56:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:56:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:56:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:56:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:56:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:56:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:56:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:56:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:56:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:56:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:56:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:56:45,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:56:45,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:56:45,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:56:45,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:56:45,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:56:45,631 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:56:45,638 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:56:45,928 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-08 13:56:45,928 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:56:45,944 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:56:45,945 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 13:56:45,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:56:45 BoogieIcfgContainer [2024-11-08 13:56:45,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:56:45,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:56:45,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:56:45,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:56:45,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:56:44" (1/3) ... [2024-11-08 13:56:45,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8a1be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:56:45, skipping insertion in model container [2024-11-08 13:56:45,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:45" (2/3) ... [2024-11-08 13:56:45,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8a1be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:56:45, skipping insertion in model container [2024-11-08 13:56:45,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:56:45" (3/3) ... [2024-11-08 13:56:45,954 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2024-11-08 13:56:45,974 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:56:45,974 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:56:46,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:56:46,032 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;@46c80dea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:56:46,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:56:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 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) [2024-11-08 13:56:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 13:56:46,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:46,043 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:56:46,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:46,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash 976010426, now seen corresponding path program 1 times [2024-11-08 13:56:46,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:46,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983167922] [2024-11-08 13:56:46,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:46,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:56:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:46,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:56:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:56:46,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:56:46,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983167922] [2024-11-08 13:56:46,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983167922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:56:46,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:56:46,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:56:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773603165] [2024-11-08 13:56:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:56:46,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:56:46,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:56:46,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:56:46,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:56:46,487 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 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) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2024-11-08 13:56:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:56:46,554 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2024-11-08 13:56:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:56:46,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) Word has length 24 [2024-11-08 13:56:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:56:46,568 INFO L225 Difference]: With dead ends: 61 [2024-11-08 13:56:46,568 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 13:56:46,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:56:46,574 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:56:46,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:56:46,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 13:56:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 13:56:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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) [2024-11-08 13:56:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-08 13:56:46,619 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2024-11-08 13:56:46,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:56:46,621 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-08 13:56:46,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2024-11-08 13:56:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-08 13:56:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 13:56:46,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:46,623 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:56:46,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:56:46,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:46,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1442307826, now seen corresponding path program 1 times [2024-11-08 13:56:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114667163] [2024-11-08 13:56:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:46,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:56:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:46,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:56:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:56:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:56:46,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114667163] [2024-11-08 13:56:46,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114667163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:56:46,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:56:46,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:56:46,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877073807] [2024-11-08 13:56:46,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:56:46,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:56:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:56:46,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:56:46,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:56:46,925 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-08 13:56:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:56:46,983 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-11-08 13:56:46,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:56:46,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) Word has length 24 [2024-11-08 13:56:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:56:46,984 INFO L225 Difference]: With dead ends: 50 [2024-11-08 13:56:46,985 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 13:56:46,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:56:46,986 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:56:46,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 72 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:56:46,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 13:56:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-08 13:56:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2024-11-08 13:56:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-08 13:56:46,994 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2024-11-08 13:56:46,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:56:46,995 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-08 13:56:46,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-08 13:56:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-08 13:56:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 13:56:46,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:46,997 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:56:46,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:56:46,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:46,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:47,000 INFO L85 PathProgramCache]: Analyzing trace with hash 915772386, now seen corresponding path program 1 times [2024-11-08 13:56:47,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:47,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201705256] [2024-11-08 13:56:47,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:47,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:47,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:56:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:47,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:56:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:56:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:56:47,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:56:47,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201705256] [2024-11-08 13:56:47,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201705256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:56:47,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889088846] [2024-11-08 13:56:47,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:47,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:56:47,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:56:47,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:56:47,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:56:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:47,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 13:56:47,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:56:47,927 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 [2024-11-08 13:56:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:56:47,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:56:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:56:48,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889088846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:56:48,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:56:48,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 14 [2024-11-08 13:56:48,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318523026] [2024-11-08 13:56:48,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:56:48,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 13:56:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:56:48,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 13:56:48,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-08 13:56:48,010 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:56:52,039 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] [2024-11-08 13:56:56,062 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] [2024-11-08 13:57:00,082 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] [2024-11-08 13:57:04,095 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] [2024-11-08 13:57:08,119 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] [2024-11-08 13:57:12,345 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] [2024-11-08 13:57:16,369 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] [2024-11-08 13:57:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:16,375 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-11-08 13:57:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 13:57:16,376 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2024-11-08 13:57:16,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:16,377 INFO L225 Difference]: With dead ends: 59 [2024-11-08 13:57:16,377 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 13:57:16,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-08 13:57:16,378 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:16,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 207 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2024-11-08 13:57:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 13:57:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-08 13:57:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:57:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-08 13:57:16,393 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 34 [2024-11-08 13:57:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:16,394 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-08 13:57:16,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:57:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-08 13:57:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 13:57:16,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:16,396 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:16,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 13:57:16,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:16,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:16,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:16,598 INFO L85 PathProgramCache]: Analyzing trace with hash 917619428, now seen corresponding path program 1 times [2024-11-08 13:57:16,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:16,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195634515] [2024-11-08 13:57:16,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:16,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:18,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:57:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:18,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:57:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:18,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:57:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:57:19,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:19,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195634515] [2024-11-08 13:57:19,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195634515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:19,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163742558] [2024-11-08 13:57:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:19,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:19,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:19,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:57:19,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 13:57:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:19,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-08 13:57:19,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:57:19,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:57:19,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:57:20,043 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:57:20,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 13:57:20,130 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 [2024-11-08 13:57:20,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 13:57:20,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-08 13:57:20,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:20,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2024-11-08 13:57:20,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-08 13:57:20,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2024-11-08 13:57:20,648 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 104 treesize of output 56 [2024-11-08 13:57:20,657 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 7 [2024-11-08 13:57:20,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 13:57:20,672 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 [2024-11-08 13:57:20,896 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 13:57:20,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-08 13:57:20,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:20,921 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 112 treesize of output 65 [2024-11-08 13:57:20,928 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 7 [2024-11-08 13:57:20,949 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 13:57:20,950 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 [2024-11-08 13:57:20,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-08 13:57:21,149 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 84 treesize of output 52 [2024-11-08 13:57:21,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:21,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:21,157 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 45 treesize of output 36 [2024-11-08 13:57:21,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-11-08 13:57:21,225 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 [2024-11-08 13:57:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:57:21,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:57:21,419 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_671 Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_673) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_675))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_671)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2024-11-08 13:57:21,452 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_671 Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_673) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_675))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_671)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (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 [2024-11-08 13:57:21,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163742558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:21,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:57:21,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2024-11-08 13:57:21,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158421815] [2024-11-08 13:57:21,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:57:21,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-08 13:57:21,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:21,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-08 13:57:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2105, Unknown=2, NotChecked=186, Total=2450 [2024-11-08 13:57:21,602 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 45 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 36 states have internal predecessors, (54), 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) [2024-11-08 13:57:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:22,817 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-08 13:57:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 13:57:22,818 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 36 states have internal predecessors, (54), 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 34 [2024-11-08 13:57:22,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:22,819 INFO L225 Difference]: With dead ends: 42 [2024-11-08 13:57:22,819 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 13:57:22,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=290, Invalid=3748, Unknown=2, NotChecked=250, Total=4290 [2024-11-08 13:57:22,822 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 46 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:22,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 303 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 833 Invalid, 1 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 13:57:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 13:57:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-08 13:57:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:57:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-08 13:57:22,829 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 34 [2024-11-08 13:57:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:22,829 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-08 13:57:22,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 36 states have internal predecessors, (54), 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) [2024-11-08 13:57:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-08 13:57:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:57:22,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:22,831 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:22,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 13:57:23,031 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,SelfDestructingSolverStorable3 [2024-11-08 13:57:23,032 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:23,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:23,032 INFO L85 PathProgramCache]: Analyzing trace with hash -665604212, now seen corresponding path program 1 times [2024-11-08 13:57:23,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:23,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737412432] [2024-11-08 13:57:23,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:23,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:24,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:57:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:24,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:57:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:24,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:57:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:57:24,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:24,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737412432] [2024-11-08 13:57:24,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737412432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:24,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157774198] [2024-11-08 13:57:24,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:24,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:24,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:24,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:57:24,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 13:57:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:25,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-08 13:57:25,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:57:25,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:57:25,163 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:57:25,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 13:57:25,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:57:25,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 13:57:25,382 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-08 13:57:25,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 36 [2024-11-08 13:57:25,515 INFO L349 Elim1Store]: treesize reduction 42, result has 2.3 percent of original size [2024-11-08 13:57:25,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 27 [2024-11-08 13:57:25,519 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 [2024-11-08 13:57:25,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:25,626 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 13:57:25,626 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 104 treesize of output 81 [2024-11-08 13:57:25,644 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-08 13:57:25,645 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 34 treesize of output 36 [2024-11-08 13:57:26,097 INFO L349 Elim1Store]: treesize reduction 1162, result has 25.7 percent of original size [2024-11-08 13:57:26,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 534 treesize of output 444 [2024-11-08 13:57:26,114 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 301 treesize of output 217 [2024-11-08 13:57:29,271 INFO L349 Elim1Store]: treesize reduction 647, result has 19.7 percent of original size [2024-11-08 13:57:29,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 492 treesize of output 230 [2024-11-08 13:57:29,278 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 163 treesize of output 107