./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/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 23:46:21,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 23:46:21,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 23:46:21,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 23:46:21,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 23:46:22,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 23:46:22,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 23:46:22,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 23:46:22,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 23:46:22,015 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 23:46:22,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 23:46:22,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 23:46:22,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 23:46:22,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 23:46:22,016 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 23:46:22,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 23:46:22,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 23:46:22,017 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 23:46:22,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 23:46:22,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 23:46:22,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 23:46:22,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 23:46:22,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 23:46:22,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 23:46:22,023 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 23:46:22,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 23:46:22,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 23:46:22,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 23:46:22,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 23:46:22,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 23:46:22,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 23:46:22,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 23:46:22,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:46:22,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 23:46:22,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 23:46:22,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 23:46:22,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 23:46:22,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 23:46:22,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 23:46:22,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 23:46:22,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 23:46:22,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 23:46:22,027 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2024-10-23 23:46:22,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 23:46:22,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 23:46:22,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 23:46:22,274 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 23:46:22,280 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 23:46:22,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-10-23 23:46:23,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 23:46:23,741 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 23:46:23,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-10-23 23:46:23,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca5861167/7929feab01334074aaa23801c36b9d95/FLAGa86620034 [2024-10-23 23:46:23,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca5861167/7929feab01334074aaa23801c36b9d95 [2024-10-23 23:46:23,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 23:46:23,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 23:46:23,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 23:46:23,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 23:46:23,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 23:46:23,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:46:23" (1/1) ... [2024-10-23 23:46:23,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2142edd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:23, skipping insertion in model container [2024-10-23 23:46:23,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:46:23" (1/1) ... [2024-10-23 23:46:23,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 23:46:24,087 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/sll2n_insert_equal.i[24301,24314] [2024-10-23 23:46:24,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:46:24,102 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 23:46:24,130 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/sll2n_insert_equal.i[24301,24314] [2024-10-23 23:46:24,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:46:24,166 INFO L204 MainTranslator]: Completed translation [2024-10-23 23:46:24,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24 WrapperNode [2024-10-23 23:46:24,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 23:46:24,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 23:46:24,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 23:46:24,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 23:46:24,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24" (1/1) ... [2024-10-23 23:46:24,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24" (1/1) ... [2024-10-23 23:46:24,220 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2024-10-23 23:46:24,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 23:46:24,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 23:46:24,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 23:46:24,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 23:46:24,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24" (1/1) ... [2024-10-23 23:46:24,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24" (1/1) ... [2024-10-23 23:46:24,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24" (1/1) ... [2024-10-23 23:46:24,262 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2024-10-23 23:46:24,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24" (1/1) ... [2024-10-23 23:46:24,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24" (1/1) ... [2024-10-23 23:46:24,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24" (1/1) ... [2024-10-23 23:46:24,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24" (1/1) ... [2024-10-23 23:46:24,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24" (1/1) ... [2024-10-23 23:46:24,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24" (1/1) ... [2024-10-23 23:46:24,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 23:46:24,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 23:46:24,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 23:46:24,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 23:46:24,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24" (1/1) ... [2024-10-23 23:46:24,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:46:24,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:24,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 23:46:24,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 23:46:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-23 23:46:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-23 23:46:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-23 23:46:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-23 23:46:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-23 23:46:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-23 23:46:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-23 23:46:24,349 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-23 23:46:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-23 23:46:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 23:46:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 23:46:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-23 23:46:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-23 23:46:24,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-23 23:46:24,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-23 23:46:24,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-23 23:46:24,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-23 23:46:24,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 23:46:24,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-23 23:46:24,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-23 23:46:24,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-23 23:46:24,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 23:46:24,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-23 23:46:24,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-23 23:46:24,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 23:46:24,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 23:46:24,455 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 23:46:24,456 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 23:46:24,628 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-23 23:46:24,629 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 23:46:24,666 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 23:46:24,666 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-23 23:46:24,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:46:24 BoogieIcfgContainer [2024-10-23 23:46:24,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 23:46:24,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 23:46:24,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 23:46:24,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 23:46:24,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 11:46:23" (1/3) ... [2024-10-23 23:46:24,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fce54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:46:24, skipping insertion in model container [2024-10-23 23:46:24,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:24" (2/3) ... [2024-10-23 23:46:24,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fce54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:46:24, skipping insertion in model container [2024-10-23 23:46:24,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:46:24" (3/3) ... [2024-10-23 23:46:24,673 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2024-10-23 23:46:24,685 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 23:46:24,685 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 23:46:24,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 23:46:24,729 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;@6ae86c68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 23:46:24,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 23:46:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:46:24,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-23 23:46:24,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:24,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:24,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:24,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:24,743 INFO L85 PathProgramCache]: Analyzing trace with hash -245179890, now seen corresponding path program 1 times [2024-10-23 23:46:24,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:24,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875985214] [2024-10-23 23:46:24,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:24,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:24,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-23 23:46:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 23:46:24,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:24,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875985214] [2024-10-23 23:46:24,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875985214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:46:24,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:46:24,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 23:46:24,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844304210] [2024-10-23 23:46:24,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:46:24,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 23:46:24,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:25,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 23:46:25,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 23:46:25,018 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 23:46:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:25,062 INFO L93 Difference]: Finished difference Result 42 states and 63 transitions. [2024-10-23 23:46:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 23:46:25,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-23 23:46:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:25,069 INFO L225 Difference]: With dead ends: 42 [2024-10-23 23:46:25,069 INFO L226 Difference]: Without dead ends: 18 [2024-10-23 23:46:25,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-23 23:46:25,074 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:25,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:46:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-23 23:46:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-23 23:46:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-23 23:46:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-10-23 23:46:25,097 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 14 [2024-10-23 23:46:25,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:25,098 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-10-23 23:46:25,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 23:46:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2024-10-23 23:46:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-23 23:46:25,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:25,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:25,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 23:46:25,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:25,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1987527562, now seen corresponding path program 1 times [2024-10-23 23:46:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:25,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742338515] [2024-10-23 23:46:25,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:25,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-23 23:46:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 23:46:25,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:25,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742338515] [2024-10-23 23:46:25,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742338515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:46:25,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:46:25,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 23:46:25,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194020790] [2024-10-23 23:46:25,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:46:25,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 23:46:25,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:25,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 23:46:25,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 23:46:25,225 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 23:46:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:25,286 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2024-10-23 23:46:25,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 23:46:25,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-23 23:46:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:25,287 INFO L225 Difference]: With dead ends: 35 [2024-10-23 23:46:25,287 INFO L226 Difference]: Without dead ends: 21 [2024-10-23 23:46:25,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-23 23:46:25,289 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:25,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 23:46:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-23 23:46:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-10-23 23:46:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-23 23:46:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2024-10-23 23:46:25,298 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2024-10-23 23:46:25,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:25,298 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-10-23 23:46:25,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 23:46:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2024-10-23 23:46:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-23 23:46:25,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:25,299 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-23 23:46:25,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 23:46:25,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:25,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:25,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1535308516, now seen corresponding path program 1 times [2024-10-23 23:46:25,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:25,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398090481] [2024-10-23 23:46:25,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:25,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:25,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:46:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:25,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-23 23:46:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:46:25,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:25,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398090481] [2024-10-23 23:46:25,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398090481] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:25,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190675849] [2024-10-23 23:46:25,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:25,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:25,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:25,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:46:25,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 23:46:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:25,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-23 23:46:25,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 23:46:25,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:46:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:46:25,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190675849] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 23:46:25,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 23:46:25,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-10-23 23:46:25,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605204105] [2024-10-23 23:46:25,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 23:46:25,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 23:46:25,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:25,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 23:46:25,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-23 23:46:25,687 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-23 23:46:25,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:25,727 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2024-10-23 23:46:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 23:46:25,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2024-10-23 23:46:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:25,728 INFO L225 Difference]: With dead ends: 36 [2024-10-23 23:46:25,729 INFO L226 Difference]: Without dead ends: 22 [2024-10-23 23:46:25,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-23 23:46:25,730 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:25,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:46:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-23 23:46:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-23 23:46:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-23 23:46:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-23 23:46:25,736 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 20 [2024-10-23 23:46:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:25,737 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-23 23:46:25,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-23 23:46:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-10-23 23:46:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-23 23:46:25,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:25,738 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:25,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-23 23:46:25,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:25,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:25,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:25,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1788207406, now seen corresponding path program 2 times [2024-10-23 23:46:25,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:25,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408785675] [2024-10-23 23:46:25,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:25,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:26,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:46:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:26,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:46:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:26,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:46:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-23 23:46:26,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:26,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408785675] [2024-10-23 23:46:26,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408785675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:46:26,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:46:26,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 23:46:26,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139253887] [2024-10-23 23:46:26,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:46:26,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 23:46:26,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:26,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 23:46:26,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 23:46:26,028 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 23:46:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:26,053 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-10-23 23:46:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 23:46:26,053 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-10-23 23:46:26,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:26,054 INFO L225 Difference]: With dead ends: 30 [2024-10-23 23:46:26,054 INFO L226 Difference]: Without dead ends: 24 [2024-10-23 23:46:26,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-23 23:46:26,055 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:26,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:46:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-23 23:46:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-23 23:46:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-23 23:46:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-23 23:46:26,059 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 26 [2024-10-23 23:46:26,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:26,059 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-23 23:46:26,059 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 23:46:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-23 23:46:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-23 23:46:26,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:26,060 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:26,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 23:46:26,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:26,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1790054448, now seen corresponding path program 1 times [2024-10-23 23:46:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:26,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747262007] [2024-10-23 23:46:26,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:26,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:46:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:26,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:46:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:26,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:46:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:46:26,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:26,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747262007] [2024-10-23 23:46:26,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747262007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:46:26,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:46:26,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-23 23:46:26,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66976983] [2024-10-23 23:46:26,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:46:26,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 23:46:26,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:26,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 23:46:26,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-23 23:46:26,329 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:46:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:26,392 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-10-23 23:46:26,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 23:46:26,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-10-23 23:46:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:26,393 INFO L225 Difference]: With dead ends: 34 [2024-10-23 23:46:26,393 INFO L226 Difference]: Without dead ends: 31 [2024-10-23 23:46:26,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-23 23:46:26,394 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:26,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:46:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-23 23:46:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2024-10-23 23:46:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:46:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-23 23:46:26,398 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 26 [2024-10-23 23:46:26,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:26,399 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-23 23:46:26,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:46:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-23 23:46:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-23 23:46:26,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:26,400 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:26,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 23:46:26,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:26,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:26,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1790056122, now seen corresponding path program 1 times [2024-10-23 23:46:26,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:26,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420093193] [2024-10-23 23:46:26,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:26,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:26,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:46:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:46:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:26,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:46:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:46:26,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:26,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420093193] [2024-10-23 23:46:26,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420093193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:46:26,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:46:26,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-23 23:46:26,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64649053] [2024-10-23 23:46:26,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:46:26,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-23 23:46:26,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:26,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-23 23:46:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-23 23:46:26,842 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:46:26,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:26,949 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-10-23 23:46:26,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-23 23:46:26,950 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-10-23 23:46:26,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:26,950 INFO L225 Difference]: With dead ends: 29 [2024-10-23 23:46:26,950 INFO L226 Difference]: Without dead ends: 27 [2024-10-23 23:46:26,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-23 23:46:26,951 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:26,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 82 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 23:46:26,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-23 23:46:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-23 23:46:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:46:26,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-10-23 23:46:26,955 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 26 [2024-10-23 23:46:26,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:26,955 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-10-23 23:46:26,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:46:26,956 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-10-23 23:46:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-23 23:46:26,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:26,956 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:26,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 23:46:26,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:26,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:26,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1086442489, now seen corresponding path program 1 times [2024-10-23 23:46:26,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:26,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681325337] [2024-10-23 23:46:26,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:26,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:27,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:46:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:46:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:27,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:46:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-23 23:46:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:27,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681325337] [2024-10-23 23:46:27,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681325337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:27,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060766216] [2024-10-23 23:46:27,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:27,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:27,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:27,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:46:27,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 23:46:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:27,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-23 23:46:27,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:27,275 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-23 23:46:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-23 23:46:27,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:46:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-23 23:46:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060766216] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 23:46:27,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 23:46:27,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 10 [2024-10-23 23:46:27,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075163624] [2024-10-23 23:46:27,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 23:46:27,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 23:46:27,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:27,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 23:46:27,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-23 23:46:27,312 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 23:46:31,327 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-23 23:46:35,338 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-23 23:46:39,346 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-23 23:46:43,359 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-23 23:46:47,377 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-23 23:46:51,455 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-23 23:46:55,467 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-23 23:46:55,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:55,494 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-10-23 23:46:55,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-23 23:46:55,495 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-10-23 23:46:55,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:55,495 INFO L225 Difference]: With dead ends: 39 [2024-10-23 23:46:55,495 INFO L226 Difference]: Without dead ends: 36 [2024-10-23 23:46:55,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-23 23:46:55,496 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:55,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 137 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 7 Unknown, 0 Unchecked, 28.1s Time] [2024-10-23 23:46:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-23 23:46:55,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-10-23 23:46:55,501 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-23 23:46:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-23 23:46:55,501 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 27 [2024-10-23 23:46:55,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:55,502 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-23 23:46:55,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 23:46:55,502 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-23 23:46:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-23 23:46:55,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:55,503 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:55,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 23:46:55,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-23 23:46:55,704 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:55,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:55,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1086444163, now seen corresponding path program 1 times [2024-10-23 23:46:55,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:55,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211745679] [2024-10-23 23:46:55,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:55,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:56,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:46:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:56,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:46:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:56,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:46:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-23 23:46:56,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:56,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211745679] [2024-10-23 23:46:56,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211745679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:56,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039420105] [2024-10-23 23:46:56,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:56,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:56,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:56,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:46:56,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 23:46:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:56,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-10-23 23:46:56,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:56,877 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-23 23:46:56,885 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-23 23:46:56,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-23 23:46:57,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-23 23:46:57,014 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-23 23:46:57,134 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-23 23:46:57,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-10-23 23:46:57,157 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-23 23:46:57,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-23 23:46:57,337 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 39 treesize of output 15 [2024-10-23 23:46:57,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-23 23:46:57,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-23 23:46:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:46:57,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:46:57,525 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_813) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-10-23 23:46:59,268 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int)) (v_ArrVal_811 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) v_ArrVal_811)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_813) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-10-23 23:46:59,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039420105] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:59,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:46:59,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 33 [2024-10-23 23:46:59,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148474851] [2024-10-23 23:46:59,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:46:59,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-23 23:46:59,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:59,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-23 23:46:59,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1137, Unknown=30, NotChecked=138, Total=1406 [2024-10-23 23:46:59,480 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-23 23:46:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:59,948 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-10-23 23:46:59,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-23 23:46:59,949 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2024-10-23 23:46:59,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:59,949 INFO L225 Difference]: With dead ends: 38 [2024-10-23 23:46:59,949 INFO L226 Difference]: Without dead ends: 36 [2024-10-23 23:46:59,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=142, Invalid=1642, Unknown=30, NotChecked=166, Total=1980 [2024-10-23 23:46:59,951 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:59,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 242 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 23:46:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-23 23:46:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-10-23 23:46:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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-23 23:46:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-10-23 23:46:59,955 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 27 [2024-10-23 23:46:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:59,956 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-23 23:46:59,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-23 23:46:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-10-23 23:46:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-23 23:46:59,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:59,956 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:59,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-23 23:47:00,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:00,157 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:47:00,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:47:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2037919669, now seen corresponding path program 1 times [2024-10-23 23:47:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:47:00,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288966354] [2024-10-23 23:47:00,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:47:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:47:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:00,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:47:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:00,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:47:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-23 23:47:00,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:47:00,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288966354] [2024-10-23 23:47:00,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288966354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:47:00,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:47:00,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 23:47:00,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658951965] [2024-10-23 23:47:00,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:47:00,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 23:47:00,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:47:00,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 23:47:00,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 23:47:00,282 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (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-23 23:47:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:47:00,318 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-10-23 23:47:00,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 23:47:00,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (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 28 [2024-10-23 23:47:00,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:47:00,319 INFO L225 Difference]: With dead ends: 43 [2024-10-23 23:47:00,319 INFO L226 Difference]: Without dead ends: 34 [2024-10-23 23:47:00,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 23:47:00,319 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:47:00,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 40 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:47:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-23 23:47:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-10-23 23:47:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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-23 23:47:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-10-23 23:47:00,329 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 28 [2024-10-23 23:47:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:47:00,330 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-10-23 23:47:00,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (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-23 23:47:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-10-23 23:47:00,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-23 23:47:00,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:47:00,331 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:47:00,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 23:47:00,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:47:00,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:47:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash 806568216, now seen corresponding path program 2 times [2024-10-23 23:47:00,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:47:00,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873098137] [2024-10-23 23:47:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:00,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:47:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:00,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:47:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:00,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:47:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:00,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:47:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-23 23:47:00,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:47:00,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873098137] [2024-10-23 23:47:00,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873098137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:47:00,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:47:00,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 23:47:00,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127371198] [2024-10-23 23:47:00,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:47:00,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 23:47:00,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:47:00,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 23:47:00,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 23:47:00,447 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:47:00,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:47:00,488 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-10-23 23:47:00,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-23 23:47:00,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-23 23:47:00,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:47:00,490 INFO L225 Difference]: With dead ends: 42 [2024-10-23 23:47:00,490 INFO L226 Difference]: Without dead ends: 30 [2024-10-23 23:47:00,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-23 23:47:00,491 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:47:00,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:47:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-23 23:47:00,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-10-23 23:47:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-23 23:47:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-23 23:47:00,498 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2024-10-23 23:47:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:47:00,499 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-23 23:47:00,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:47:00,499 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-23 23:47:00,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-23 23:47:00,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:47:00,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:47:00,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 23:47:00,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:47:00,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:47:00,502 INFO L85 PathProgramCache]: Analyzing trace with hash 395820500, now seen corresponding path program 1 times [2024-10-23 23:47:00,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:47:00,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429498796] [2024-10-23 23:47:00,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:00,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:47:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:00,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:47:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:00,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:47:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:01,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:47:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-23 23:47:01,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:47:01,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429498796] [2024-10-23 23:47:01,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429498796] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:47:01,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234097536] [2024-10-23 23:47:01,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:01,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:01,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:47:01,068 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:47:01,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-23 23:47:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:01,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-23 23:47:01,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:47:01,260 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-23 23:47:01,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-23 23:47:01,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2024-10-23 23:47:01,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-23 23:47:01,468 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-23 23:47:01,469 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-23 23:47:01,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-10-23 23:47:01,564 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-10-23 23:47:01,565 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 32 treesize of output 47 [2024-10-23 23:47:01,636 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 62 treesize of output 46 [2024-10-23 23:47:01,643 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 46 treesize of output 34 [2024-10-23 23:47:01,655 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-10-23 23:47:01,656 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 2 case distinctions, treesize of input 39 treesize of output 39 [2024-10-23 23:47:01,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-23 23:47:01,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-10-23 23:47:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-23 23:47:01,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:47:01,711 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1178 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1178) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2024-10-23 23:47:01,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234097536] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:47:01,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:47:01,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 33 [2024-10-23 23:47:01,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633748565] [2024-10-23 23:47:01,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:47:01,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-23 23:47:01,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:47:01,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-23 23:47:01,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1099, Unknown=11, NotChecked=66, Total=1260 [2024-10-23 23:47:01,958 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 33 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-23 23:47:02,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:47:02,472 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-10-23 23:47:02,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-23 23:47:02,473 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2024-10-23 23:47:02,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:47:02,474 INFO L225 Difference]: With dead ends: 36 [2024-10-23 23:47:02,474 INFO L226 Difference]: Without dead ends: 33 [2024-10-23 23:47:02,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=1917, Unknown=11, NotChecked=88, Total=2162 [2024-10-23 23:47:02,476 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 23:47:02,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 298 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 23:47:02,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-23 23:47:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-10-23 23:47:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-23 23:47:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-23 23:47:02,489 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 29 [2024-10-23 23:47:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:47:02,489 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-23 23:47:02,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-23 23:47:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-23 23:47:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-23 23:47:02,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:47:02,489 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:47:02,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-23 23:47:02,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:02,690 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:47:02,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:47:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash 395822174, now seen corresponding path program 1 times [2024-10-23 23:47:02,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:47:02,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683901808] [2024-10-23 23:47:02,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:02,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:47:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:03,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:47:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:03,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:47:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:03,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:47:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:47:03,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:47:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683901808] [2024-10-23 23:47:03,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683901808] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:47:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140866535] [2024-10-23 23:47:03,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:03,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:03,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:47:03,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:47:03,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-23 23:47:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:03,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-10-23 23:47:03,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:47:04,030 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-23 23:47:04,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-23 23:47:04,221 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-23 23:47:04,282 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-23 23:47:04,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-23 23:47:04,510 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 24 treesize of output 11 [2024-10-23 23:47:04,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-23 23:47:04,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-23 23:47:04,597 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 137 treesize of output 89 [2024-10-23 23:47:04,608 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-23 23:47:04,609 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 79 treesize of output 68 [2024-10-23 23:47:04,613 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 39 treesize of output 15 [2024-10-23 23:47:04,618 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 24 treesize of output 11 [2024-10-23 23:47:04,679 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 27 treesize of output 15 [2024-10-23 23:47:04,683 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 7 treesize of output 3 [2024-10-23 23:47:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:47:04,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:47:04,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:04,972 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 1 case distinctions, treesize of input 77 treesize of output 78 [2024-10-23 23:47:04,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:04,988 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 150 treesize of output 149 [2024-10-23 23:47:04,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:04,994 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 1 case distinctions, treesize of input 126 treesize of output 116 [2024-10-23 23:47:04,999 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 56 treesize of output 48 [2024-10-23 23:47:05,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:05,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 200 treesize of output 185 [2024-10-23 23:47:05,019 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 39 treesize of output 31 [2024-10-23 23:47:06,167 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse9 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse16)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse1 (= .cse7 .cse16)) (.cse3 (and (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1352 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_35 Int) (v_arrayElimCell_38 Int) (v_arrayElimCell_33 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_int#1| .cse7 v_ArrVal_1347))) (store .cse13 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 v_ArrVal_1352))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_33) v_arrayElimCell_36)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_35) v_arrayElimCell_38))))) (or .cse9 (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1352 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_33 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse14 (store |c_#memory_int#1| .cse7 v_ArrVal_1347))) (store .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 v_ArrVal_1352))) v_arrayElimCell_33) v_arrayElimCell_36)))) (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1352 Int) (v_arrayElimCell_35 Int) (v_arrayElimCell_38 Int) (v_arrayElimCell_33 Int)) (let ((.cse15 (store |c_#memory_int#1| .cse7 v_ArrVal_1347))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_33) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 v_ArrVal_1352)) v_arrayElimCell_35) v_arrayElimCell_38))))) (or .cse9 (forall ((v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_33 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse7 v_ArrVal_1347) v_arrayElimCell_33) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))))) (.cse0 (and (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1352 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_35 Int) (v_arrayElimCell_38 Int)) (let ((.cse11 (store |c_#memory_int#1| .cse7 v_ArrVal_1347))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 v_ArrVal_1352))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 v_arrayElimCell_36)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse10) v_arrayElimCell_35) v_arrayElimCell_38)))))) (or .cse9 (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1352 Int) (v_arrayElimCell_36 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse7 v_ArrVal_1347) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 v_ArrVal_1352) v_arrayElimCell_36)))))) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |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_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1352 Int) (v_arrayElimCell_35 Int) (v_arrayElimCell_38 Int)) (let ((.cse4 (store |c_#memory_int#1| .cse7 v_ArrVal_1347))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store .cse5 .cse6 v_ArrVal_1352)) v_arrayElimCell_35) v_arrayElimCell_38)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))))) (or .cse1 .cse3) (or (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1352 Int) (v_arrayElimCell_35 Int) (v_arrayElimCell_38 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse8 (store |c_#memory_int#1| .cse7 v_ArrVal_1347))) (store .cse8 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 v_ArrVal_1352))) v_arrayElimCell_35) v_arrayElimCell_38))) (not .cse9)) (or .cse9 (forall ((v_ArrVal_1347 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse7 v_ArrVal_1347) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))) (or .cse0 .cse2))))) is different from false [2024-10-23 23:47:08,569 INFO L349 Elim1Store]: treesize reduction 180, result has 84.1 percent of original size [2024-10-23 23:47:08,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 13 new quantified variables, introduced 79 case distinctions, treesize of input 2553 treesize of output 3024 [2024-10-23 23:47:10,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:10,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 2132 treesize of output 3126 [2024-10-23 23:47:10,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:10,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1879 treesize of output 1876 [2024-10-23 23:47:11,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:11,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1887 treesize of output 1888 [2024-10-23 23:47:11,572 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 1879 treesize of output 1877 [2024-10-23 23:47:11,993 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 1897 treesize of output 1891 [2024-10-23 23:47:12,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:12,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1921 treesize of output 1922 [2024-10-23 23:47:12,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:12,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1953 treesize of output 1950 [2024-10-23 23:47:13,372 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 1941 treesize of output 1939 [2024-10-23 23:47:13,822 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 1959 treesize of output 1953 [2024-10-23 23:47:14,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:14,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1973 treesize of output 1974 [2024-10-23 23:47:14,766 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 1965 treesize of output 1963 [2024-10-23 23:47:15,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:15,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1993 treesize of output 1994 [2024-10-23 23:47:15,711 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 1995 treesize of output 1993 [2024-10-23 23:47:16,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:16,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2013 treesize of output 2014 [2024-10-23 23:47:16,718 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 2015 treesize of output 2013 [2024-10-23 23:47:17,177 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 2033 treesize of output 2027