./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:43:44,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:43:44,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:43:44,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:43:44,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:43:44,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:43:44,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:43:44,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:43:44,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:43:44,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:43:44,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:43:44,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:43:44,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:43:44,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:43:44,164 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:43:44,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:43:44,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:43:44,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:43:44,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:43:44,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:43:44,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:43:44,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:43:44,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:43:44,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:43:44,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:43:44,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:43:44,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:43:44,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:43:44,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:43:44,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:43:44,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:43:44,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:43:44,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:43:44,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:43:44,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:43:44,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:43:44,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:43:44,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:43:44,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:43:44,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:43:44,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:43:44,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:43:44,176 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-clean/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-clean/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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2024-10-11 01:43:44,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:43:44,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:43:44,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:43:44,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:43:44,476 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:43:44,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-10-11 01:43:46,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:43:46,275 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:43:46,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-10-11 01:43:46,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/324e9cfda/f9fa4fc9506b43fbbb3d24fcbfc1f632/FLAG5882c00f6 [2024-10-11 01:43:46,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/324e9cfda/f9fa4fc9506b43fbbb3d24fcbfc1f632 [2024-10-11 01:43:46,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:43:46,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:43:46,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:43:46,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:43:46,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:43:46,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dec7c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46, skipping insertion in model container [2024-10-11 01:43:46,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:43:46,719 WARN L248 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/sll2c_append_unequal.i[24587,24600] [2024-10-11 01:43:46,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:43:46,734 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:43:46,776 WARN L248 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/sll2c_append_unequal.i[24587,24600] [2024-10-11 01:43:46,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:43:46,844 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:43:46,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46 WrapperNode [2024-10-11 01:43:46,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:43:46,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:43:46,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:43:46,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:43:46,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,906 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 161 [2024-10-11 01:43:46,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:43:46,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:43:46,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:43:46,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:43:46,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,941 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 16, 10]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2024-10-11 01:43:46,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:43:46,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:43:46,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:43:46,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:43:46,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46" (1/1) ... [2024-10-11 01:43:46,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:43:46,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:47,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:43:47,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:43:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:43:47,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:43:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 01:43:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:43:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:43:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 01:43:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 01:43:47,055 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 01:43:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:43:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:43:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 01:43:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:43:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:43:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 01:43:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:43:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:43:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 01:43:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:43:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:43:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:43:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 01:43:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:43:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:43:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 01:43:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:43:47,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:43:47,227 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:43:47,229 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:43:47,468 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-11 01:43:47,469 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:43:47,510 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:43:47,510 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 01:43:47,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:47 BoogieIcfgContainer [2024-10-11 01:43:47,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:43:47,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:43:47,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:43:47,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:43:47,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:43:46" (1/3) ... [2024-10-11 01:43:47,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b44c917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:43:47, skipping insertion in model container [2024-10-11 01:43:47,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:46" (2/3) ... [2024-10-11 01:43:47,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b44c917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:43:47, skipping insertion in model container [2024-10-11 01:43:47,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:47" (3/3) ... [2024-10-11 01:43:47,522 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2024-10-11 01:43:47,538 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:43:47,539 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:43:47,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:43:47,612 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;@44d006d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:43:47,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:43:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 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-10-11 01:43:47,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 01:43:47,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:47,625 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:47,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:47,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2101823815, now seen corresponding path program 1 times [2024-10-11 01:43:47,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:47,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158959159] [2024-10-11 01:43:47,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:47,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:47,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:43:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:47,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:43:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:43:48,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:48,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158959159] [2024-10-11 01:43:48,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158959159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:43:48,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:43:48,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:43:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778015752] [2024-10-11 01:43:48,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:43:48,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:43:48,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:48,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:43:48,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:43:48,063 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 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 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-10-11 01:43:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:48,141 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2024-10-11 01:43:48,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:43:48,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 19 [2024-10-11 01:43:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:48,151 INFO L225 Difference]: With dead ends: 62 [2024-10-11 01:43:48,151 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 01:43:48,155 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-10-11 01:43:48,159 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:48,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:43:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 01:43:48,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 01:43:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-10-11 01:43:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-10-11 01:43:48,204 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 19 [2024-10-11 01:43:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:48,207 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-11 01:43:48,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-10-11 01:43:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-10-11 01:43:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 01:43:48,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:48,211 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:48,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:43:48,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:48,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:48,213 INFO L85 PathProgramCache]: Analyzing trace with hash -536293836, now seen corresponding path program 1 times [2024-10-11 01:43:48,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:48,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662247920] [2024-10-11 01:43:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:48,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:48,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:43:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:48,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:43:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:43:48,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:48,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662247920] [2024-10-11 01:43:48,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662247920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:43:48,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:43:48,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:43:48,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389374947] [2024-10-11 01:43:48,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:43:48,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:43:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:43:48,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:43:48,450 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-10-11 01:43:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:48,515 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-10-11 01:43:48,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:43:48,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 20 [2024-10-11 01:43:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:48,518 INFO L225 Difference]: With dead ends: 49 [2024-10-11 01:43:48,518 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 01:43:48,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10-11 01:43:48,520 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:48,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:43:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 01:43:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 01:43:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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-10-11 01:43:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-11 01:43:48,530 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 20 [2024-10-11 01:43:48,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:48,531 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-11 01:43:48,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-10-11 01:43:48,532 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-11 01:43:48,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:43:48,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:48,533 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:48,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:43:48,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash 538316138, now seen corresponding path program 1 times [2024-10-11 01:43:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277364262] [2024-10-11 01:43:48,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:48,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:48,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:43:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:48,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:43:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:49,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:43:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 01:43:49,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:49,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277364262] [2024-10-11 01:43:49,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277364262] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:49,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357998586] [2024-10-11 01:43:49,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:49,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:49,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:49,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:43:49,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:43:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:49,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 01:43:49,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:43:49,471 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-10-11 01:43:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:43:49,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:43:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 01:43:49,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357998586] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:43:49,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:43:49,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 12 [2024-10-11 01:43:49,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933412377] [2024-10-11 01:43:49,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:43:49,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 01:43:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:49,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 01:43:49,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 01:43:49,567 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 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-10-11 01:43:53,584 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-10-11 01:43:57,597 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-10-11 01:44:01,614 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-10-11 01:44:05,632 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-10-11 01:44:09,841 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-10-11 01:44:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:09,844 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-10-11 01:44:09,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 01:44:09,844 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 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 26 [2024-10-11 01:44:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:09,845 INFO L225 Difference]: With dead ends: 44 [2024-10-11 01:44:09,845 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 01:44:09,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-11 01:44:09,847 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:09,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 192 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-10-11 01:44:09,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 01:44:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-10-11 01:44:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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) [2024-10-11 01:44:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-11 01:44:09,855 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2024-10-11 01:44:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:09,855 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-11 01:44:09,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 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-10-11 01:44:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-11 01:44:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 01:44:09,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:09,856 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 01:44:09,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 01:44:10,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:10,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:10,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:10,058 INFO L85 PathProgramCache]: Analyzing trace with hash -62087795, now seen corresponding path program 1 times [2024-10-11 01:44:10,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:10,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422911420] [2024-10-11 01:44:10,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:10,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:11,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:11,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:44:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:11,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:11,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422911420] [2024-10-11 01:44:11,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422911420] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543386797] [2024-10-11 01:44:11,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:11,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:11,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:11,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:11,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:44:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:11,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-10-11 01:44:11,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:11,373 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-10-11 01:44:11,559 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 [2024-10-11 01:44:11,672 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:44:11,672 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-10-11 01:44:11,772 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 25 treesize of output 13 [2024-10-11 01:44:11,790 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-10-11 01:44:11,909 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-11 01:44:11,909 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 102 treesize of output 77 [2024-10-11 01:44:11,920 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 50 treesize of output 21 [2024-10-11 01:44:11,983 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 38 treesize of output 14 [2024-10-11 01:44:11,992 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 17 treesize of output 3 [2024-10-11 01:44:11,997 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-10-11 01:44:12,134 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 01:44:12,135 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 26 treesize of output 29 [2024-10-11 01:44:12,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-11 01:44:12,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:12,163 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 46 treesize of output 35 [2024-10-11 01:44:12,184 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-11 01:44:12,184 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 32 treesize of output 34 [2024-10-11 01:44:12,405 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-10-11 01:44:12,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2024-10-11 01:44:12,439 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-10-11 01:44:12,440 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 3 case distinctions, treesize of input 97 treesize of output 93 [2024-10-11 01:44:12,472 INFO L349 Elim1Store]: treesize reduction 20, result has 60.0 percent of original size [2024-10-11 01:44:12,472 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 2 case distinctions, treesize of input 53 treesize of output 53 [2024-10-11 01:44:12,490 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 12 treesize of output 1 [2024-10-11 01:44:12,542 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-10-11 01:44:12,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 13 [2024-10-11 01:44:12,573 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 45 treesize of output 34 [2024-10-11 01:44:12,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-10-11 01:44:12,662 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 127 treesize of output 95 [2024-10-11 01:44:12,774 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 114 treesize of output 66 [2024-10-11 01:44:12,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:12,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2024-10-11 01:44:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:44:12,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:13,237 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_468 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_471 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_469) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_468) .cse0) (+ .cse1 4))) (not (= (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_469 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) v_ArrVal_469)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_471) .cse0) .cse1) .cse0))))) is different from false [2024-10-11 01:44:17,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543386797] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:17,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:44:17,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 33 [2024-10-11 01:44:17,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83788727] [2024-10-11 01:44:17,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:17,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 01:44:17,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:17,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 01:44:17,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1439, Unknown=8, NotChecked=76, Total=1640 [2024-10-11 01:44:17,407 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 33 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 01:44:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:18,539 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2024-10-11 01:44:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 01:44:18,539 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2024-10-11 01:44:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:18,541 INFO L225 Difference]: With dead ends: 83 [2024-10-11 01:44:18,541 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 01:44:18,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=265, Invalid=3036, Unknown=9, NotChecked=112, Total=3422 [2024-10-11 01:44:18,543 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 78 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:18,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 336 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 01:44:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 01:44:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 46. [2024-10-11 01:44:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 01:44:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-10-11 01:44:18,559 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 29 [2024-10-11 01:44:18,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:18,560 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-10-11 01:44:18,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 01:44:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-10-11 01:44:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 01:44:18,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:18,561 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:18,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:44:18,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:18,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:18,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:18,763 INFO L85 PathProgramCache]: Analyzing trace with hash 509899912, now seen corresponding path program 1 times [2024-10-11 01:44:18,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:18,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369124587] [2024-10-11 01:44:18,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:18,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:19,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:19,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:19,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:44:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 01:44:19,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369124587] [2024-10-11 01:44:19,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369124587] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400652263] [2024-10-11 01:44:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:19,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:19,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:19,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:19,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:44:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:20,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-10-11 01:44:20,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:20,090 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-10-11 01:44:20,229 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 [2024-10-11 01:44:20,282 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:44:20,283 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-10-11 01:44:20,342 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 25 treesize of output 13 [2024-10-11 01:44:20,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-11 01:44:20,497 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 17 treesize of output 3 [2024-10-11 01:44:20,501 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-10-11 01:44:20,615 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 01:44:20,616 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 26 treesize of output 29 [2024-10-11 01:44:20,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-11 01:44:20,646 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-11 01:44:20,646 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 20 treesize of output 22 [2024-10-11 01:44:20,859 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 65 treesize of output 32 [2024-10-11 01:44:20,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:20,867 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 32 treesize of output 21 [2024-10-11 01:44:20,912 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 25 treesize of output 17 [2024-10-11 01:44:20,916 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 21 treesize of output 13 [2024-10-11 01:44:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 01:44:21,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:21,108 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_647 (Array Int Int)) (v_ArrVal_646 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_646) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_647) (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))) (not (= v_ArrVal_646 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_646 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2024-10-11 01:44:21,139 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_647 (Array Int Int)) (v_ArrVal_646 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= v_ArrVal_646 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| (select v_ArrVal_646 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18|)))) (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_646) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_647) (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)))))) is different from false [2024-10-11 01:44:21,156 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_647 (Array Int Int)) (v_ArrVal_646 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_646) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_647) (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))) (not (= v_ArrVal_646 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| (select v_ArrVal_646 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18|)))) (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18|)))) is different from false [2024-10-11 01:44:21,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400652263] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:21,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:44:21,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 35 [2024-10-11 01:44:21,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199686733] [2024-10-11 01:44:21,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:21,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 01:44:21,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:21,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 01:44:21,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1382, Unknown=3, NotChecked=228, Total=1722 [2024-10-11 01:44:21,259 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 35 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:44:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:22,158 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2024-10-11 01:44:22,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 01:44:22,159 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 6 states have call successors, (6), 4 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 31 [2024-10-11 01:44:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:22,159 INFO L225 Difference]: With dead ends: 62 [2024-10-11 01:44:22,160 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 01:44:22,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=213, Invalid=2246, Unknown=3, NotChecked=294, Total=2756 [2024-10-11 01:44:22,161 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 33 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:22,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 437 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 01:44:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 01:44:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 01:44:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 01:44:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-10-11 01:44:22,179 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 31 [2024-10-11 01:44:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:22,179 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-10-11 01:44:22,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:44:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-10-11 01:44:22,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 01:44:22,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:22,180 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:22,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 01:44:22,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:22,389 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:22,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:22,389 INFO L85 PathProgramCache]: Analyzing trace with hash 776284163, now seen corresponding path program 1 times [2024-10-11 01:44:22,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:22,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333501389] [2024-10-11 01:44:22,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:22,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:24,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:24,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:44:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:24,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333501389] [2024-10-11 01:44:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333501389] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119382375] [2024-10-11 01:44:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:24,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:24,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:24,881 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:24,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:44:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:25,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-10-11 01:44:25,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:25,150 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-10-11 01:44:25,357 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-10-11 01:44:25,443 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:44:25,443 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-10-11 01:44:25,516 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-10-11 01:44:25,529 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-10-11 01:44:25,648 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 [2024-10-11 01:44:25,655 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 [2024-10-11 01:44:25,741 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-10-11 01:44:25,750 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-10-11 01:44:25,755 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 [2024-10-11 01:44:25,955 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-11 01:44:25,955 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 20 treesize of output 22 [2024-10-11 01:44:25,967 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 [2024-10-11 01:44:25,974 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 [2024-10-11 01:44:26,407 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 57 treesize of output 33 [2024-10-11 01:44:26,411 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:44:26,412 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:44:26,413 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2024-10-11 01:44:26,660 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 [2024-10-11 01:44:26,670 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 25 treesize of output 15 [2024-10-11 01:44:26,754 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 01:44:26,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 01:44:26,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 01:44:26,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-11 01:44:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:44:27,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:27,155 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 12 treesize of output 8 [2024-10-11 01:44:27,371 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 51 treesize of output 43 [2024-10-11 01:44:27,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (or (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_arrayElimCell_69 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_69 v_ArrVal_826) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_827) .cse0) .cse1))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_arrayElimCell_69 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_69 v_ArrVal_826) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_827) .cse0) .cse1)) (= v_arrayElimCell_69 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) is different from false [2024-10-11 01:44:27,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (or (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_arrayElimCell_69 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_69 v_ArrVal_826) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_827) .cse0) .cse1))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= .cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse2)))) (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_arrayElimCell_69 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_69 v_ArrVal_826) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_827) .cse0) .cse1)) (= v_arrayElimCell_69 .cse3))))) is different from false [2024-10-11 01:44:27,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_arrayElimCell_69 Int)) (or (= v_arrayElimCell_69 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_69 v_ArrVal_826) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_827) .cse1) .cse2)))) (or (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_arrayElimCell_69 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_69 v_ArrVal_826) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_827) .cse1) .cse2))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= .cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse3)))))) is different from false [2024-10-11 01:44:27,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119382375] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:27,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:44:27,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 49 [2024-10-11 01:44:27,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101535807] [2024-10-11 01:44:27,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:27,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-11 01:44:27,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:27,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-11 01:44:27,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2902, Unknown=18, NotChecked=330, Total=3422 [2024-10-11 01:44:27,611 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:44:30,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:30,362 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2024-10-11 01:44:30,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 01:44:30,362 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 6 states have call successors, (6), 4 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 33 [2024-10-11 01:44:30,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:30,363 INFO L225 Difference]: With dead ends: 91 [2024-10-11 01:44:30,363 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 01:44:30,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=455, Invalid=6345, Unknown=18, NotChecked=492, Total=7310 [2024-10-11 01:44:30,366 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 76 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:30,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 507 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 01:44:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 01:44:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2024-10-11 01:44:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 01:44:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2024-10-11 01:44:30,387 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 33 [2024-10-11 01:44:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:30,387 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2024-10-11 01:44:30,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:44:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2024-10-11 01:44:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 01:44:30,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:30,388 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:30,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 01:44:30,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 01:44:30,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:30,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:30,594 INFO L85 PathProgramCache]: Analyzing trace with hash -926488386, now seen corresponding path program 2 times [2024-10-11 01:44:30,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:30,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889744762] [2024-10-11 01:44:30,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:30,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:32,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:32,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:44:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 01:44:32,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:32,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889744762] [2024-10-11 01:44:32,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889744762] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:32,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618167100] [2024-10-11 01:44:32,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:44:32,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:32,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:32,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:32,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 01:44:32,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:44:32,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:44:32,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 178 conjuncts are in the unsatisfiable core [2024-10-11 01:44:32,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:32,624 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-10-11 01:44:32,819 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-10-11 01:44:32,894 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:44:32,895 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-10-11 01:44:32,981 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-10-11 01:44:33,001 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-10-11 01:44:33,007 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-10-11 01:44:33,117 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-11 01:44:33,118 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 112 treesize of output 58 [2024-10-11 01:44:33,125 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 39 treesize of output 30 [2024-10-11 01:44:33,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-10-11 01:44:33,231 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 01:44:33,232 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 64 treesize of output 31 [2024-10-11 01:44:33,237 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-11 01:44:33,241 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-10-11 01:44:33,244 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 [2024-10-11 01:44:33,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:33,409 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-11 01:44:33,410 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 72 treesize of output 55 [2024-10-11 01:44:33,426 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 01:44:33,427 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-10-11 01:44:33,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-10-11 01:44:33,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 01:44:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 01:44:34,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:34,456 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1015 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| .cse6 (store (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1015)) (.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1018))) (let ((.cse1 (select (select .cse0 .cse3) .cse4)) (.cse2 (select (select .cse5 .cse3) .cse4))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse3)) (not (= .cse4 (select (select .cse5 .cse1) .cse2))))))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1012 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse6 (store (select |c_#memory_int#1| .cse6) .cse7 v_ArrVal_1012)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1017) .cse3) (+ .cse4 4)))))) is different from false [2024-10-11 01:44:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618167100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:43,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:44:43,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2024-10-11 01:44:43,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428674588] [2024-10-11 01:44:43,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:43,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 01:44:43,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:43,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 01:44:43,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2094, Unknown=4, NotChecked=92, Total=2352 [2024-10-11 01:44:43,432 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 36 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 27 states have internal predecessors, (45), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:44:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:44,588 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2024-10-11 01:44:44,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 01:44:44,589 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 27 states have internal predecessors, (45), 6 states have call successors, (6), 4 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 35 [2024-10-11 01:44:44,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:44,590 INFO L225 Difference]: With dead ends: 81 [2024-10-11 01:44:44,590 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 01:44:44,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=284, Invalid=3376, Unknown=4, NotChecked=118, Total=3782 [2024-10-11 01:44:44,592 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:44,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 341 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 01:44:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 01:44:44,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-10-11 01:44:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 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) [2024-10-11 01:44:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2024-10-11 01:44:44,605 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 35 [2024-10-11 01:44:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:44,606 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2024-10-11 01:44:44,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 27 states have internal predecessors, (45), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:44:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2024-10-11 01:44:44,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 01:44:44,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:44,607 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:44,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 01:44:44,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:44,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:44,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1531607570, now seen corresponding path program 1 times [2024-10-11 01:44:44,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:44,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358948630] [2024-10-11 01:44:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:44,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:45,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:45,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:45,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:44:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 01:44:45,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:45,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358948630] [2024-10-11 01:44:45,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358948630] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133741408] [2024-10-11 01:44:45,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:45,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:45,150 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:45,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 01:44:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:45,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-10-11 01:44:45,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:45,367 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-10-11 01:44:45,475 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:44:45,475 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-10-11 01:44:45,504 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-10-11 01:44:45,511 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 [2024-10-11 01:44:45,559 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-11 01:44:45,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 53 [2024-10-11 01:44:45,563 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 24 treesize of output 1 [2024-10-11 01:44:45,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-11 01:44:45,594 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-10-11 01:44:45,701 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 8 treesize of output 1 [2024-10-11 01:44:45,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:45,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-10-11 01:44:45,715 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 01:44:45,716 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-10-11 01:44:45,954 INFO L349 Elim1Store]: treesize reduction 52, result has 43.5 percent of original size [2024-10-11 01:44:45,954 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 4 case distinctions, treesize of input 91 treesize of output 78 [2024-10-11 01:44:45,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2024-10-11 01:44:45,979 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-11 01:44:45,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2024-10-11 01:44:45,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-10-11 01:44:46,152 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 55 treesize of output 42 [2024-10-11 01:44:46,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 01:45:07,011 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 01:45:07,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 01:45:07,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:07,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 385 treesize of output 421 [2024-10-11 01:45:08,526 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2024-10-11 01:45:08,526 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 60 [2024-10-11 01:45:08,530 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 0 case distinctions, treesize of input 32 treesize of output 19 [2024-10-11 01:45:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:45:08,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:45:08,804 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1202 (Array Int Int))) (let ((.cse6 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse8 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1202)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse5 .cse4) .cse7)) (.cse0 (select (select .cse6 .cse4) .cse7))) (let ((.cse1 (select .cse6 .cse0)) (.cse3 (select (select .cse5 .cse0) .cse2))) (or (not (= .cse0 (select .cse1 .cse2))) (not (= .cse3 .cse2)) (not (= (select .cse1 .cse3) .cse4))))))) is different from false