./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:17:18,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:17:18,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:17:18,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:17:18,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:17:18,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:17:18,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:17:18,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:17:18,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:17:18,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:17:18,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:17:18,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:17:18,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:17:18,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:17:18,640 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:17:18,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:17:18,642 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:17:18,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:17:18,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:17:18,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:17:18,643 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:17:18,643 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:17:18,643 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:17:18,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:17:18,643 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:17:18,644 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:17:18,644 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:17:18,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:17:18,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:17:18,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:17:18,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:17:18,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:17:18,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:17:18,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:17:18,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:17:18,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:17:18,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:17:18,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:17:18,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:17:18,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:17:18,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:17:18,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:17:18,650 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2024-10-11 18:17:18,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:17:18,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:17:18,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:17:18,902 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:17:18,902 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:17:18,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2024-10-11 18:17:20,182 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:17:20,407 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:17:20,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2024-10-11 18:17:20,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3f509c01f/1af867297d54488a999fa30f95e5471a/FLAGe9ab42e26 [2024-10-11 18:17:20,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3f509c01f/1af867297d54488a999fa30f95e5471a [2024-10-11 18:17:20,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:17:20,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:17:20,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:17:20,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:17:20,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:17:20,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:20,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d9931a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20, skipping insertion in model container [2024-10-11 18:17:20,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:20,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:17:20,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:17:20,801 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:17:20,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:17:20,901 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:17:20,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20 WrapperNode [2024-10-11 18:17:20,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:17:20,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:17:20,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:17:20,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:17:20,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:20,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:20,951 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 151 [2024-10-11 18:17:20,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:17:20,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:17:20,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:17:20,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:17:20,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:20,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:20,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:20,988 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 14, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-10-11 18:17:20,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:20,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:21,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:21,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:21,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:21,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:21,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:17:21,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:17:21,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:17:21,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:17:21,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20" (1/1) ... [2024-10-11 18:17:21,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:17:21,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:21,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:17:21,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:17:21,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:17:21,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:17:21,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 18:17:21,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:17:21,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:17:21,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 18:17:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 18:17:21,102 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 18:17:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:17:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:17:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:17:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:17:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:17:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 18:17:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:17:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:17:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:17:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:17:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:17:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:17:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:17:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:17:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:17:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 18:17:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:17:21,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:17:21,215 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:17:21,217 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:17:21,594 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2024-10-11 18:17:21,594 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:17:21,640 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:17:21,641 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 18:17:21,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:17:21 BoogieIcfgContainer [2024-10-11 18:17:21,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:17:21,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:17:21,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:17:21,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:17:21,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:17:20" (1/3) ... [2024-10-11 18:17:21,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fed0b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:17:21, skipping insertion in model container [2024-10-11 18:17:21,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:20" (2/3) ... [2024-10-11 18:17:21,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fed0b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:17:21, skipping insertion in model container [2024-10-11 18:17:21,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:17:21" (3/3) ... [2024-10-11 18:17:21,650 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2024-10-11 18:17:21,665 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:17:21,666 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2024-10-11 18:17:21,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:17:21,713 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=None, 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;@2e1ec277, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:17:21,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-10-11 18:17:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 103 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:21,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:17:21,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:21,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:17:21,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:21,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash 236219979, now seen corresponding path program 1 times [2024-10-11 18:17:21,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:21,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702921600] [2024-10-11 18:17:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:21,936 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-11 18:17:21,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:21,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702921600] [2024-10-11 18:17:21,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702921600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:21,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:21,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:17:21,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193760125] [2024-10-11 18:17:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:21,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:17:21,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:21,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:17:21,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:21,966 INFO L87 Difference]: Start difference. First operand has 108 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 103 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:17:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:22,077 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2024-10-11 18:17:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:17:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:17:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:22,085 INFO L225 Difference]: With dead ends: 105 [2024-10-11 18:17:22,085 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 18:17:22,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:22,089 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:22,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 156 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 18:17:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-11 18:17:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 49 states have (on average 2.163265306122449) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2024-10-11 18:17:22,195 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 5 [2024-10-11 18:17:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:22,196 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2024-10-11 18:17:22,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:17:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2024-10-11 18:17:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:17:22,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:22,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:17:22,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:17:22,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:22,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:22,200 INFO L85 PathProgramCache]: Analyzing trace with hash 236219980, now seen corresponding path program 1 times [2024-10-11 18:17:22,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:22,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127266673] [2024-10-11 18:17:22,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:22,302 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-11 18:17:22,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:22,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127266673] [2024-10-11 18:17:22,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127266673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:22,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:22,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:17:22,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614265700] [2024-10-11 18:17:22,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:22,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:17:22,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:22,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:17:22,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:22,307 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:17:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:22,386 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2024-10-11 18:17:22,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:17:22,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:17:22,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:22,387 INFO L225 Difference]: With dead ends: 101 [2024-10-11 18:17:22,387 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:17:22,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:22,389 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:22,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 160 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:17:22,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 18:17:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 49 states have (on average 2.122448979591837) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-10-11 18:17:22,396 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 5 [2024-10-11 18:17:22,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:22,396 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-10-11 18:17:22,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:17:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-10-11 18:17:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:17:22,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:22,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:22,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:17:22,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:22,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash -561588005, now seen corresponding path program 1 times [2024-10-11 18:17:22,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:22,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923013728] [2024-10-11 18:17:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:22,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:22,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:22,470 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-11 18:17:22,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:22,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923013728] [2024-10-11 18:17:22,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923013728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:22,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:22,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:17:22,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539385287] [2024-10-11 18:17:22,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:22,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:17:22,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:22,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:17:22,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:17:22,472 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11 18:17:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:22,591 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2024-10-11 18:17:22,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:17:22,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-10-11 18:17:22,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:22,592 INFO L225 Difference]: With dead ends: 107 [2024-10-11 18:17:22,593 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 18:17:22,595 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-11 18:17:22,595 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 4 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:22,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 223 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 18:17:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2024-10-11 18:17:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 50 states have (on average 2.1) internal successors, (105), 97 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2024-10-11 18:17:22,610 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 10 [2024-10-11 18:17:22,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:22,610 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2024-10-11 18:17:22,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11 18:17:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2024-10-11 18:17:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:17:22,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:22,611 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:22,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:17:22,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:22,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:22,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1249894050, now seen corresponding path program 1 times [2024-10-11 18:17:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:22,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258528455] [2024-10-11 18:17:22,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:22,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:22,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:22,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:22,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:22,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258528455] [2024-10-11 18:17:22,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258528455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:22,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:22,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:22,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033319710] [2024-10-11 18:17:22,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:22,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:22,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:22,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:22,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:22,805 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:23,015 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2024-10-11 18:17:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:23,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-11 18:17:23,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:23,016 INFO L225 Difference]: With dead ends: 101 [2024-10-11 18:17:23,017 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:17:23,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:23,018 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:23,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 339 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:17:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 18:17:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 50 states have (on average 2.08) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-10-11 18:17:23,029 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 17 [2024-10-11 18:17:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:23,029 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-10-11 18:17:23,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-10-11 18:17:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:17:23,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:23,030 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:23,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:17:23,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:23,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:23,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1249894049, now seen corresponding path program 1 times [2024-10-11 18:17:23,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:23,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593733101] [2024-10-11 18:17:23,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:23,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:23,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:23,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:17:23,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:23,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593733101] [2024-10-11 18:17:23,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593733101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:23,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:23,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:23,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847663658] [2024-10-11 18:17:23,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:23,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:23,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:23,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:23,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:23,376 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:23,546 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2024-10-11 18:17:23,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:23,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-11 18:17:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:23,548 INFO L225 Difference]: With dead ends: 100 [2024-10-11 18:17:23,548 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 18:17:23,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:23,549 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:23,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 18:17:23,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 18:17:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 50 states have (on average 2.06) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-10-11 18:17:23,563 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 17 [2024-10-11 18:17:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:23,563 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-10-11 18:17:23,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-10-11 18:17:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:17:23,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:23,564 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:23,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:17:23,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:23,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:23,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1442858200, now seen corresponding path program 1 times [2024-10-11 18:17:23,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:23,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466447426] [2024-10-11 18:17:23,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:23,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:23,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:23,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:17:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466447426] [2024-10-11 18:17:23,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466447426] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:23,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213262057] [2024-10-11 18:17:23,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:23,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:23,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:23,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:23,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:17:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:23,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 18:17:23,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:23,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:24,061 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:17:24,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:17:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:17:24,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:17:24,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213262057] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:17:24,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:17:24,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2024-10-11 18:17:24,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629912588] [2024-10-11 18:17:24,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:24,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:17:24,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:24,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:17:24,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:17:24,375 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:17:24,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:24,659 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2024-10-11 18:17:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:24,660 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2024-10-11 18:17:24,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:24,661 INFO L225 Difference]: With dead ends: 99 [2024-10-11 18:17:24,661 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 18:17:24,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:17:24,662 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:24,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 541 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:24,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 18:17:24,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 18:17:24,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 50 states have (on average 2.04) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-10-11 18:17:24,666 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 19 [2024-10-11 18:17:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:24,666 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-10-11 18:17:24,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:17:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-10-11 18:17:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:17:24,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:24,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:24,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:17:24,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:24,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:24,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1442858201, now seen corresponding path program 1 times [2024-10-11 18:17:24,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636586882] [2024-10-11 18:17:24,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:25,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:25,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:17:25,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:25,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636586882] [2024-10-11 18:17:25,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636586882] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:25,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190440534] [2024-10-11 18:17:25,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:25,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:25,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:25,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:25,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:17:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:25,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 18:17:25,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:25,346 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 8 treesize of output 1 [2024-10-11 18:17:25,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:25,483 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:25,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:17:25,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:17:25,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:25,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190440534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:25,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:25,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2024-10-11 18:17:25,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639495581] [2024-10-11 18:17:25,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:25,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 18:17:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:25,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 18:17:25,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:17:25,623 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 14 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:25,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:25,913 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2024-10-11 18:17:25,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:17:25,913 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-11 18:17:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:25,914 INFO L225 Difference]: With dead ends: 100 [2024-10-11 18:17:25,914 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 18:17:25,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:17:25,915 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:25,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 465 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:17:25,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 18:17:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-10-11 18:17:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 50 states have (on average 2.02) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-10-11 18:17:25,926 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 19 [2024-10-11 18:17:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:25,927 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-10-11 18:17:25,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-10-11 18:17:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:17:25,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:25,928 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:25,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:17:26,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:26,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:26,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:26,131 INFO L85 PathProgramCache]: Analyzing trace with hash 808156727, now seen corresponding path program 1 times [2024-10-11 18:17:26,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:26,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258653440] [2024-10-11 18:17:26,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:26,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:17:26,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:26,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258653440] [2024-10-11 18:17:26,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258653440] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:26,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072457706] [2024-10-11 18:17:26,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:26,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:26,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:26,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:26,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:17:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 18:17:26,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:26,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:26,651 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-11 18:17:26,674 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:17:26,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:17:26,732 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:17:26,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:17:26,791 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:17:26,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:17:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2024-10-11 18:17:26,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:17:27,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072457706] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:17:27,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:17:27,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2024-10-11 18:17:27,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174180252] [2024-10-11 18:17:27,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:27,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 18:17:27,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:27,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 18:17:27,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=303, Unknown=1, NotChecked=36, Total=420 [2024-10-11 18:17:27,128 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 21 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 18:17:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:27,439 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-10-11 18:17:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:27,440 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 27 [2024-10-11 18:17:27,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:27,441 INFO L225 Difference]: With dead ends: 108 [2024-10-11 18:17:27,441 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 18:17:27,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=402, Unknown=1, NotChecked=42, Total=552 [2024-10-11 18:17:27,442 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 259 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:27,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 307 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 445 Invalid, 0 Unknown, 113 Unchecked, 0.2s Time] [2024-10-11 18:17:27,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 18:17:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2024-10-11 18:17:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 50 states have (on average 1.86) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2024-10-11 18:17:27,446 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 27 [2024-10-11 18:17:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:27,446 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2024-10-11 18:17:27,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 18:17:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-10-11 18:17:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:17:27,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:27,447 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:27,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:27,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:27,652 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:27,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash 808156728, now seen corresponding path program 1 times [2024-10-11 18:17:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715254649] [2024-10-11 18:17:27,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:27,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:27,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:28,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:28,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:28,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715254649] [2024-10-11 18:17:28,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715254649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:28,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:28,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:17:28,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492707189] [2024-10-11 18:17:28,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:28,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:17:28,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:28,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:17:28,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:17:28,082 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 9 states, 5 states have (on average 2.6) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:28,300 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2024-10-11 18:17:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:17:28,303 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 2.6) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2024-10-11 18:17:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:28,304 INFO L225 Difference]: With dead ends: 83 [2024-10-11 18:17:28,304 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:17:28,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:17:28,305 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 106 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:28,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 239 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:17:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-10-11 18:17:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.7) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2024-10-11 18:17:28,308 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 27 [2024-10-11 18:17:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:28,308 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2024-10-11 18:17:28,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 2.6) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2024-10-11 18:17:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:17:28,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:28,309 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:28,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:17:28,310 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:28,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash -750286766, now seen corresponding path program 1 times [2024-10-11 18:17:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:28,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082193361] [2024-10-11 18:17:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:28,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:28,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:28,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:28,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:17:28,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:28,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082193361] [2024-10-11 18:17:28,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082193361] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:28,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597230630] [2024-10-11 18:17:28,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:28,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:28,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:28,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:28,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:17:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:28,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 18:17:28,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:28,846 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-11 18:17:28,865 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-11 18:17:28,894 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-11 18:17:28,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-10-11 18:17:28,907 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 17 treesize of output 9 [2024-10-11 18:17:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:17:28,912 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:28,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597230630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:28,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:28,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-10-11 18:17:28,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966133313] [2024-10-11 18:17:28,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:28,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:17:28,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:28,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:17:28,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=205, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:17:28,913 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:29,056 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2024-10-11 18:17:29,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:17:29,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-10-11 18:17:29,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:29,058 INFO L225 Difference]: With dead ends: 108 [2024-10-11 18:17:29,059 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 18:17:29,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=261, Unknown=1, NotChecked=32, Total=342 [2024-10-11 18:17:29,059 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 79 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:29,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 274 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 153 Unchecked, 0.1s Time] [2024-10-11 18:17:29,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 18:17:29,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 84. [2024-10-11 18:17:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 79 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2024-10-11 18:17:29,063 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 29 [2024-10-11 18:17:29,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:29,063 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-10-11 18:17:29,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2024-10-11 18:17:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:17:29,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:29,068 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:29,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:17:29,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 18:17:29,271 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:29,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash -750286765, now seen corresponding path program 1 times [2024-10-11 18:17:29,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:29,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742832461] [2024-10-11 18:17:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:29,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:29,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:29,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742832461] [2024-10-11 18:17:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742832461] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381873495] [2024-10-11 18:17:29,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:29,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:29,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:29,601 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:29,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:17:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:29,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 18:17:29,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:29,818 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 8 treesize of output 1 [2024-10-11 18:17:29,982 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-11 18:17:29,984 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-11 18:17:30,014 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-10-11 18:17:30,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:30,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 18:17:30,049 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:17:30,049 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-11 18:17:30,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 18:17:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-11 18:17:30,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:30,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381873495] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:30,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:30,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2024-10-11 18:17:30,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153050685] [2024-10-11 18:17:30,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:30,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 18:17:30,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:30,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 18:17:30,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=538, Unknown=1, NotChecked=46, Total=650 [2024-10-11 18:17:30,235 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 23 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:17:30,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:30,960 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2024-10-11 18:17:30,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:17:30,961 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2024-10-11 18:17:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:30,962 INFO L225 Difference]: With dead ends: 115 [2024-10-11 18:17:30,962 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 18:17:30,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=1330, Unknown=1, NotChecked=74, Total=1560 [2024-10-11 18:17:30,963 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 209 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:30,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 770 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 797 Invalid, 0 Unknown, 123 Unchecked, 0.4s Time] [2024-10-11 18:17:30,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 18:17:30,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2024-10-11 18:17:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-10-11 18:17:30,971 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 29 [2024-10-11 18:17:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:30,971 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-10-11 18:17:30,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:17:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-10-11 18:17:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:17:30,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:30,972 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:30,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:17:31,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 18:17:31,173 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:31,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:31,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1784054885, now seen corresponding path program 1 times [2024-10-11 18:17:31,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:31,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459194218] [2024-10-11 18:17:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:31,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:31,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:31,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459194218] [2024-10-11 18:17:31,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459194218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:31,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:31,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:17:31,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299522502] [2024-10-11 18:17:31,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:31,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:17:31,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:31,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:17:31,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:17:31,249 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:31,318 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-10-11 18:17:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:17:31,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-10-11 18:17:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:31,320 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:17:31,320 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:17:31,320 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-11 18:17:31,321 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:31,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:17:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 18:17:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.631578947368421) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2024-10-11 18:17:31,325 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 30 [2024-10-11 18:17:31,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:31,326 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2024-10-11 18:17:31,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-10-11 18:17:31,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:17:31,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:31,328 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:31,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:17:31,328 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:31,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:31,331 INFO L85 PathProgramCache]: Analyzing trace with hash 529094116, now seen corresponding path program 1 times [2024-10-11 18:17:31,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:31,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867186056] [2024-10-11 18:17:31,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:31,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 18:17:31,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867186056] [2024-10-11 18:17:31,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867186056] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365866479] [2024-10-11 18:17:31,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:31,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:31,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:31,499 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:31,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:17:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:17:31,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:31,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:31,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365866479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:31,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:31,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-10-11 18:17:31,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673431224] [2024-10-11 18:17:31,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:31,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:17:31,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:31,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:17:31,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:31,646 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:31,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:31,684 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-10-11 18:17:31,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:17:31,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-10-11 18:17:31,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:31,685 INFO L225 Difference]: With dead ends: 91 [2024-10-11 18:17:31,685 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 18:17:31,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:17:31,686 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 45 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:31,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 171 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:17:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 18:17:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-10-11 18:17:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-10-11 18:17:31,688 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 31 [2024-10-11 18:17:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:31,689 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-10-11 18:17:31,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-10-11 18:17:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:17:31,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:31,689 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:31,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:17:31,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 18:17:31,894 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:31,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash -784545668, now seen corresponding path program 1 times [2024-10-11 18:17:31,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:31,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068838363] [2024-10-11 18:17:31,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:31,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 18:17:31,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:31,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068838363] [2024-10-11 18:17:31,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068838363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:31,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:31,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:31,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700973504] [2024-10-11 18:17:31,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:31,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:31,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:31,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:31,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:31,991 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:32,095 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-10-11 18:17:32,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:32,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-11 18:17:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:32,096 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:17:32,096 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:17:32,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:32,097 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 15 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:32,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 242 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:17:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:17:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 78 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2024-10-11 18:17:32,100 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 32 [2024-10-11 18:17:32,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:32,100 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2024-10-11 18:17:32,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2024-10-11 18:17:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:17:32,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:32,101 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:32,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:17:32,101 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:32,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:32,101 INFO L85 PathProgramCache]: Analyzing trace with hash -784545667, now seen corresponding path program 1 times [2024-10-11 18:17:32,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:32,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729780213] [2024-10-11 18:17:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:32,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:17:32,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:32,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729780213] [2024-10-11 18:17:32,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729780213] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:32,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179864077] [2024-10-11 18:17:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:32,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:32,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:32,227 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:32,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:17:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:17:32,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:32,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:32,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179864077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:32,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:32,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-10-11 18:17:32,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208014072] [2024-10-11 18:17:32,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:32,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:17:32,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:32,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:17:32,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:17:32,409 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:32,439 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2024-10-11 18:17:32,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:17:32,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-10-11 18:17:32,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:32,443 INFO L225 Difference]: With dead ends: 87 [2024-10-11 18:17:32,443 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 18:17:32,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:17:32,444 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 43 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:32,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 165 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:17:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 18:17:32,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-10-11 18:17:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 77 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2024-10-11 18:17:32,446 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 32 [2024-10-11 18:17:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:32,446 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2024-10-11 18:17:32,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-10-11 18:17:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:17:32,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:32,447 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:32,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 18:17:32,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:32,647 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:32,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash -777953207, now seen corresponding path program 1 times [2024-10-11 18:17:32,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:32,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688814970] [2024-10-11 18:17:32,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:32,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:32,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:32,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688814970] [2024-10-11 18:17:32,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688814970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:32,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:32,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:17:32,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027464720] [2024-10-11 18:17:32,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:32,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:17:32,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:32,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:17:32,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:17:32,743 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:32,835 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2024-10-11 18:17:32,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:17:32,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-11 18:17:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:32,836 INFO L225 Difference]: With dead ends: 82 [2024-10-11 18:17:32,836 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 18:17:32,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:17:32,837 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:32,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 18:17:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 18:17:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.509090909090909) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2024-10-11 18:17:32,839 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 32 [2024-10-11 18:17:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:32,840 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-10-11 18:17:32,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-10-11 18:17:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:17:32,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:32,840 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:32,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:17:32,840 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:32,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:32,841 INFO L85 PathProgramCache]: Analyzing trace with hash -777953206, now seen corresponding path program 1 times [2024-10-11 18:17:32,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:32,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045660441] [2024-10-11 18:17:32,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:32,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:32,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:32,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045660441] [2024-10-11 18:17:32,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045660441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:32,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:32,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:17:32,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15396236] [2024-10-11 18:17:32,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:32,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:17:32,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:32,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:17:32,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:17:32,949 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:33,029 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2024-10-11 18:17:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:17:33,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-11 18:17:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:33,030 INFO L225 Difference]: With dead ends: 81 [2024-10-11 18:17:33,030 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 18:17:33,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:17:33,031 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:33,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:33,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 18:17:33,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 18:17:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.490909090909091) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2024-10-11 18:17:33,034 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 32 [2024-10-11 18:17:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:33,034 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2024-10-11 18:17:33,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2024-10-11 18:17:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:17:33,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:33,035 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:33,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 18:17:33,035 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:33,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:33,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1653254387, now seen corresponding path program 1 times [2024-10-11 18:17:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:33,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727744258] [2024-10-11 18:17:33,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 18:17:33,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:33,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727744258] [2024-10-11 18:17:33,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727744258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:33,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:33,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:33,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171163475] [2024-10-11 18:17:33,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:33,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:33,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:33,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:33,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:33,202 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:33,307 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-10-11 18:17:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:33,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-10-11 18:17:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:33,308 INFO L225 Difference]: With dead ends: 78 [2024-10-11 18:17:33,309 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 18:17:33,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:33,309 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 11 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:33,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 262 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:33,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 18:17:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 18:17:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 72 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-10-11 18:17:33,312 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 33 [2024-10-11 18:17:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:33,312 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-10-11 18:17:33,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-10-11 18:17:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:17:33,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:33,313 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:33,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 18:17:33,313 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:33,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1711495481, now seen corresponding path program 1 times [2024-10-11 18:17:33,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:33,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593258543] [2024-10-11 18:17:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:33,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:33,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:33,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593258543] [2024-10-11 18:17:33,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593258543] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:33,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21241656] [2024-10-11 18:17:33,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:33,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:33,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:33,460 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:33,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:17:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 18:17:33,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:33,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:33,690 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-11 18:17:33,736 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:17:33,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-11 18:17:33,799 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 17 treesize of output 9 [2024-10-11 18:17:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:17:33,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:33,970 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 10 [2024-10-11 18:17:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:17:33,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21241656] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:17:33,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:17:33,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 21 [2024-10-11 18:17:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401901358] [2024-10-11 18:17:33,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:33,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 18:17:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:33,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 18:17:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:17:33,992 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 22 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 18:17:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:34,375 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2024-10-11 18:17:34,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:17:34,375 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 36 [2024-10-11 18:17:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:34,376 INFO L225 Difference]: With dead ends: 105 [2024-10-11 18:17:34,376 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 18:17:34,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2024-10-11 18:17:34,377 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 170 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:34,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 547 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:17:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 18:17:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 80. [2024-10-11 18:17:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 74 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2024-10-11 18:17:34,379 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 36 [2024-10-11 18:17:34,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:34,379 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2024-10-11 18:17:34,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 18:17:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2024-10-11 18:17:34,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:17:34,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:34,380 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:34,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 18:17:34,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:34,581 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:34,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1711495482, now seen corresponding path program 1 times [2024-10-11 18:17:34,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:34,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670995530] [2024-10-11 18:17:34,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:34,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:34,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:34,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:35,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:35,139 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-11 18:17:35,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:35,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670995530] [2024-10-11 18:17:35,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670995530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:35,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862267467] [2024-10-11 18:17:35,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:35,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:35,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:35,142 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:35,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:17:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:35,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-11 18:17:35,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:35,316 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 8 treesize of output 1 [2024-10-11 18:17:35,450 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-11 18:17:35,453 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-11 18:17:35,571 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:17:35,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-11 18:17:35,583 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:17:35,583 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-11 18:17:35,666 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 17 treesize of output 9 [2024-10-11 18:17:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:17:35,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:35,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862267467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:35,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:35,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2024-10-11 18:17:35,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591726832] [2024-10-11 18:17:35,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:35,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:17:35,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:35,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:17:35,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2024-10-11 18:17:35,847 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 27 states, 20 states have (on average 2.5) internal successors, (50), 22 states have internal predecessors, (50), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:17:36,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:36,467 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2024-10-11 18:17:36,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:17:36,468 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 20 states have (on average 2.5) internal successors, (50), 22 states have internal predecessors, (50), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2024-10-11 18:17:36,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:36,469 INFO L225 Difference]: With dead ends: 101 [2024-10-11 18:17:36,469 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:17:36,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=1402, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 18:17:36,470 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 116 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:36,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 525 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:17:36,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:17:36,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2024-10-11 18:17:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.4) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-10-11 18:17:36,475 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 36 [2024-10-11 18:17:36,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:36,475 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-10-11 18:17:36,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 20 states have (on average 2.5) internal successors, (50), 22 states have internal predecessors, (50), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:17:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-10-11 18:17:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:17:36,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:36,476 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:36,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:36,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:36,677 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:36,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash 264403767, now seen corresponding path program 1 times [2024-10-11 18:17:36,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:36,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976560625] [2024-10-11 18:17:36,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:36,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:36,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:36,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976560625] [2024-10-11 18:17:36,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976560625] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:36,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520822703] [2024-10-11 18:17:36,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:36,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:36,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:36,790 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:36,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:17:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 18:17:36,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:37,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:17:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:37,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:37,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520822703] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:17:37,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:17:37,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-11 18:17:37,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148073231] [2024-10-11 18:17:37,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:37,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:17:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:37,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:17:37,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:17:37,108 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:37,250 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2024-10-11 18:17:37,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:17:37,250 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-10-11 18:17:37,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:37,251 INFO L225 Difference]: With dead ends: 76 [2024-10-11 18:17:37,251 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 18:17:37,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:17:37,252 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:37,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 480 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 18:17:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 18:17:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2024-10-11 18:17:37,254 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 37 [2024-10-11 18:17:37,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:37,254 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2024-10-11 18:17:37,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-10-11 18:17:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:17:37,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:37,255 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:37,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 18:17:37,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 18:17:37,456 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:37,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:37,457 INFO L85 PathProgramCache]: Analyzing trace with hash 75542939, now seen corresponding path program 1 times [2024-10-11 18:17:37,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:37,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618662805] [2024-10-11 18:17:37,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:37,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:17:37,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:37,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618662805] [2024-10-11 18:17:37,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618662805] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:37,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555364283] [2024-10-11 18:17:37,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:37,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:37,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:37,700 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:37,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:17:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:17:37,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:37,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:17:37,946 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 17 treesize of output 9 [2024-10-11 18:17:37,955 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 18:17:37,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:37,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555364283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:37,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:37,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-11 18:17:37,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968717520] [2024-10-11 18:17:37,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:37,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:17:37,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:37,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:17:37,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:17:37,956 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:38,018 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2024-10-11 18:17:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:38,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-11 18:17:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:38,021 INFO L225 Difference]: With dead ends: 99 [2024-10-11 18:17:38,021 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 18:17:38,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:17:38,021 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 29 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:38,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 209 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 18:17:38,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2024-10-11 18:17:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 71 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2024-10-11 18:17:38,024 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 38 [2024-10-11 18:17:38,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:38,024 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2024-10-11 18:17:38,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:38,024 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2024-10-11 18:17:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:17:38,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:38,025 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:38,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:38,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 18:17:38,226 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:38,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:38,226 INFO L85 PathProgramCache]: Analyzing trace with hash 75542940, now seen corresponding path program 1 times [2024-10-11 18:17:38,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:38,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511654007] [2024-10-11 18:17:38,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:38,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:17:38,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:38,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511654007] [2024-10-11 18:17:38,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511654007] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:38,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189379575] [2024-10-11 18:17:38,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:38,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:38,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:38,429 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:38,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:17:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 18:17:38,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:38,621 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 8 treesize of output 1 [2024-10-11 18:17:38,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:17:38,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:17:38,751 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 17 treesize of output 9 [2024-10-11 18:17:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 18:17:38,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:38,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189379575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:38,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:38,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2024-10-11 18:17:38,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541099690] [2024-10-11 18:17:38,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:38,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:17:38,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:38,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:17:38,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:17:38,770 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:38,914 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2024-10-11 18:17:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:17:38,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-11 18:17:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:38,915 INFO L225 Difference]: With dead ends: 97 [2024-10-11 18:17:38,915 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 18:17:38,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:17:38,916 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 32 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:38,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 413 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 18:17:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2024-10-11 18:17:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 68 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2024-10-11 18:17:38,918 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 38 [2024-10-11 18:17:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:38,919 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2024-10-11 18:17:38,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-10-11 18:17:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 18:17:38,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:38,919 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:38,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 18:17:39,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:39,120 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:39,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1779017763, now seen corresponding path program 1 times [2024-10-11 18:17:39,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:39,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367676770] [2024-10-11 18:17:39,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:39,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:40,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:40,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:40,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367676770] [2024-10-11 18:17:40,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367676770] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:40,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502070833] [2024-10-11 18:17:40,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:40,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:40,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:40,272 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:40,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:17:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:40,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-10-11 18:17:40,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:40,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:40,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:17:40,834 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:40,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:17:40,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:17:40,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 18:17:41,011 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-11 18:17:41,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-11 18:17:41,205 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:17:41,205 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-11 18:17:41,217 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:17:41,218 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-11 18:17:41,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-11 18:17:41,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 18:17:41,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 18:17:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:17:41,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:42,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502070833] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:42,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:42,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 18:17:42,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108765075] [2024-10-11 18:17:42,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:42,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 18:17:42,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:42,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 18:17:42,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=3039, Unknown=58, NotChecked=0, Total=3306 [2024-10-11 18:17:42,119 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 50 states, 40 states have (on average 1.6) internal successors, (64), 40 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:17:43,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:43,264 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2024-10-11 18:17:43,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 18:17:43,264 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 40 states have (on average 1.6) internal successors, (64), 40 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-10-11 18:17:43,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:43,265 INFO L225 Difference]: With dead ends: 117 [2024-10-11 18:17:43,265 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 18:17:43,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=397, Invalid=5245, Unknown=58, NotChecked=0, Total=5700 [2024-10-11 18:17:43,267 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 52 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:43,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1380 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:17:43,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 18:17:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2024-10-11 18:17:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 88 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:17:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2024-10-11 18:17:43,270 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 40 [2024-10-11 18:17:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:43,271 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2024-10-11 18:17:43,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 40 states have (on average 1.6) internal successors, (64), 40 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:17:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2024-10-11 18:17:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 18:17:43,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:43,271 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:43,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:43,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:43,472 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:43,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:43,473 INFO L85 PathProgramCache]: Analyzing trace with hash 687968893, now seen corresponding path program 1 times [2024-10-11 18:17:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:43,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778098654] [2024-10-11 18:17:43,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:43,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:17:44,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:44,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778098654] [2024-10-11 18:17:44,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778098654] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:44,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441944031] [2024-10-11 18:17:44,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:44,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:44,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:44,017 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:44,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:17:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:44,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-11 18:17:44,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:44,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:44,316 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:44,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:17:44,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:17:44,385 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-11 18:17:44,385 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 70 treesize of output 57 [2024-10-11 18:17:44,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-10-11 18:17:44,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:17:44,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:44,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-10-11 18:17:44,540 INFO L349 Elim1Store]: treesize reduction 84, result has 37.8 percent of original size [2024-10-11 18:17:44,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 65 [2024-10-11 18:17:44,669 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-10-11 18:17:44,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2024-10-11 18:17:44,759 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-11 18:17:44,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 88 [2024-10-11 18:17:44,787 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 5 treesize of output 3 [2024-10-11 18:17:44,889 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 152 treesize of output 104 [2024-10-11 18:17:44,893 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 103 treesize of output 75 [2024-10-11 18:17:44,996 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 79 treesize of output 51 [2024-10-11 18:17:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:17:45,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:45,147 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3020 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3020) (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|))) 1)) is different from false [2024-10-11 18:17:49,185 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3020 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3020) (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|))) 1)) is different from false [2024-10-11 18:17:53,228 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3020 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3020) (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|))) 1)) is different from false [2024-10-11 18:17:53,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441944031] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:53,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:53,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 37 [2024-10-11 18:17:53,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774743493] [2024-10-11 18:17:53,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:53,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 18:17:53,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:53,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 18:17:53,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1367, Unknown=3, NotChecked=228, Total=1722 [2024-10-11 18:17:53,299 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 38 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:17:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:54,541 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2024-10-11 18:17:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-11 18:17:54,541 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2024-10-11 18:17:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:54,542 INFO L225 Difference]: With dead ends: 160 [2024-10-11 18:17:54,542 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 18:17:54,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=360, Invalid=3681, Unknown=3, NotChecked=378, Total=4422 [2024-10-11 18:17:54,544 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 176 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:54,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 992 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:17:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 18:17:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2024-10-11 18:17:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 96 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:17:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-10-11 18:17:54,551 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 41 [2024-10-11 18:17:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:54,551 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-10-11 18:17:54,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:17:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-10-11 18:17:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 18:17:54,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:54,551 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:54,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:54,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 18:17:54,752 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:54,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:54,753 INFO L85 PathProgramCache]: Analyzing trace with hash 687968894, now seen corresponding path program 1 times [2024-10-11 18:17:54,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:54,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640086060] [2024-10-11 18:17:54,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:54,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:17:55,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:55,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640086060] [2024-10-11 18:17:55,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640086060] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:55,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545596899] [2024-10-11 18:17:55,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:55,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:55,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:55,410 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:55,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 18:17:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-10-11 18:17:55,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:55,611 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 8 treesize of output 1 [2024-10-11 18:17:55,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:55,811 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:17:55,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:17:55,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:55,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:17:55,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:17:55,948 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-11 18:17:55,949 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 91 treesize of output 60 [2024-10-11 18:17:55,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-10-11 18:17:56,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-11 18:17:56,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-10-11 18:17:56,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:17:56,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-11 18:17:56,261 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:17:56,261 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-11 18:17:56,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:56,282 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 51 treesize of output 34 [2024-10-11 18:17:56,296 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 18:17:56,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-11 18:17:56,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-11 18:17:56,529 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-10-11 18:17:56,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2024-10-11 18:17:56,540 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2024-10-11 18:17:56,541 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 23 treesize of output 22 [2024-10-11 18:17:56,662 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-11 18:17:56,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 79 [2024-10-11 18:17:56,677 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-11 18:17:56,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 106 [2024-10-11 18:17:56,727 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 5 treesize of output 3 [2024-10-11 18:17:56,763 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 5 treesize of output 3 [2024-10-11 18:17:57,051 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 239 treesize of output 163 [2024-10-11 18:17:57,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:17:57,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 136 [2024-10-11 18:17:57,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:17:57,416 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 104 treesize of output 108 [2024-10-11 18:17:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:17:57,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:57,900 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3221) .cse0) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3220) .cse0) .cse1)))) (forall ((v_ArrVal_3221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3221) .cse0) .cse1) 4))))) is different from false [2024-10-11 18:17:58,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545596899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:58,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:58,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 40 [2024-10-11 18:17:58,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338350617] [2024-10-11 18:17:58,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:58,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 18:17:58,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:58,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 18:17:58,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1988, Unknown=50, NotChecked=90, Total=2256 [2024-10-11 18:17:58,520 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 41 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:18:02,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:13,203 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2024-10-11 18:18:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-11 18:18:13,204 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2024-10-11 18:18:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:13,205 INFO L225 Difference]: With dead ends: 158 [2024-10-11 18:18:13,205 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 18:18:13,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=398, Invalid=5395, Unknown=63, NotChecked=150, Total=6006 [2024-10-11 18:18:13,206 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 172 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:13,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1299 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1513 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2024-10-11 18:18:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 18:18:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 104. [2024-10-11 18:18:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.308641975308642) internal successors, (106), 95 states have internal predecessors, (106), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:18:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2024-10-11 18:18:13,215 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 41 [2024-10-11 18:18:13,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:13,215 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2024-10-11 18:18:13,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:18:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2024-10-11 18:18:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 18:18:13,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:13,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:13,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 18:18:13,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 18:18:13,418 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:18:13,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:13,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1955811521, now seen corresponding path program 1 times [2024-10-11 18:18:13,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:13,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948895482] [2024-10-11 18:18:13,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:13,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:13,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:13,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:13,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:18:13,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:13,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948895482] [2024-10-11 18:18:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948895482] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:13,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636206235] [2024-10-11 18:18:13,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:13,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:13,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:13,605 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:13,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 18:18:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:13,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:18:13,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:13,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 18:18:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:13,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:18:13,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636206235] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:18:13,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:18:13,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 15 [2024-10-11 18:18:13,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165502612] [2024-10-11 18:18:13,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:13,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 18:18:13,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:13,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 18:18:13,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:18:13,946 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:18:17,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:21,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:25,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:29,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:34,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:38,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:38,182 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2024-10-11 18:18:38,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:18:38,183 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-10-11 18:18:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:38,184 INFO L225 Difference]: With dead ends: 98 [2024-10-11 18:18:38,184 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 18:18:38,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-10-11 18:18:38,185 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 62 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:38,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 475 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 6 Unknown, 0 Unchecked, 24.1s Time] [2024-10-11 18:18:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 18:18:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 18:18:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 89 states have internal predecessors, (98), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:18:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2024-10-11 18:18:38,189 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 42 [2024-10-11 18:18:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:38,189 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2024-10-11 18:18:38,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:18:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2024-10-11 18:18:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 18:18:38,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:38,190 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:38,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-11 18:18:38,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 18:18:38,391 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:18:38,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:38,391 INFO L85 PathProgramCache]: Analyzing trace with hash -303472092, now seen corresponding path program 1 times [2024-10-11 18:18:38,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:38,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657772682] [2024-10-11 18:18:38,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:38,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:38,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:38,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 18:18:38,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:38,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657772682] [2024-10-11 18:18:38,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657772682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:38,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:38,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:18:38,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656742773] [2024-10-11 18:18:38,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:38,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:18:38,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:38,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:18:38,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:18:38,478 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:18:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:38,571 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2024-10-11 18:18:38,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:18:38,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-10-11 18:18:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:38,572 INFO L225 Difference]: With dead ends: 115 [2024-10-11 18:18:38,572 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 18:18:38,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:18:38,574 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 34 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:38,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 172 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:38,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 18:18:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2024-10-11 18:18:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 92 states have internal predecessors, (104), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:18:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-10-11 18:18:38,579 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 44 [2024-10-11 18:18:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:38,579 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-10-11 18:18:38,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:18:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-10-11 18:18:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 18:18:38,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:38,579 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:38,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 18:18:38,580 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:18:38,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash -303472091, now seen corresponding path program 1 times [2024-10-11 18:18:38,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:38,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694611536] [2024-10-11 18:18:38,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:38,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:38,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:38,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:18:38,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:38,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694611536] [2024-10-11 18:18:38,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694611536] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:38,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727579060] [2024-10-11 18:18:38,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:38,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:38,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:38,683 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:38,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 18:18:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:38,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:18:38,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 18:18:38,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:18:38,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727579060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:38,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:18:38,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-10-11 18:18:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626986705] [2024-10-11 18:18:38,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:38,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:18:38,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:38,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:18:38,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:18:38,946 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:18:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:38,980 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2024-10-11 18:18:38,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:18:38,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-10-11 18:18:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:38,981 INFO L225 Difference]: With dead ends: 114 [2024-10-11 18:18:38,982 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 18:18:38,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:18:38,982 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 25 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:38,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 196 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:18:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 18:18:38,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2024-10-11 18:18:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.3125) internal successors, (105), 93 states have internal predecessors, (105), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:18:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2024-10-11 18:18:38,985 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 44 [2024-10-11 18:18:38,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:38,985 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2024-10-11 18:18:38,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:18:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2024-10-11 18:18:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 18:18:38,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:38,986 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:39,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-11 18:18:39,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 18:18:39,187 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:18:39,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash -303575466, now seen corresponding path program 1 times [2024-10-11 18:18:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:39,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305218565] [2024-10-11 18:18:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:39,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:39,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:39,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:18:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305218565] [2024-10-11 18:18:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305218565] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906497940] [2024-10-11 18:18:39,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:39,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:39,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:39,656 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:39,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 18:18:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:39,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-11 18:18:39,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:39,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:18:39,976 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:18:39,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:18:40,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:18:40,087 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-11 18:18:40,087 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 54 treesize of output 41 [2024-10-11 18:18:40,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-11 18:18:40,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:18:40,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:40,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-10-11 18:18:40,267 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 18:18:40,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-11 18:18:40,402 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-10-11 18:18:40,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2024-10-11 18:18:40,496 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-11 18:18:40,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2024-10-11 18:18:40,529 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 5 treesize of output 3 [2024-10-11 18:18:40,583 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:18:40,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:18:40,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-10-11 18:18:40,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 18:18:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:40,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:40,651 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3884 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3884) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))) is different from false [2024-10-11 18:18:42,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906497940] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:42,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:18:42,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 38 [2024-10-11 18:18:42,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976541433] [2024-10-11 18:18:42,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:42,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 18:18:42,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:42,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 18:18:42,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1450, Unknown=1, NotChecked=76, Total=1640 [2024-10-11 18:18:42,134 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 38 states, 32 states have (on average 2.0625) internal successors, (66), 30 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:18:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:43,331 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2024-10-11 18:18:43,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-11 18:18:43,331 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 2.0625) internal successors, (66), 30 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2024-10-11 18:18:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:43,332 INFO L225 Difference]: With dead ends: 134 [2024-10-11 18:18:43,332 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 18:18:43,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=344, Invalid=4081, Unknown=1, NotChecked=130, Total=4556 [2024-10-11 18:18:43,334 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 119 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:43,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1117 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:18:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 18:18:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 101. [2024-10-11 18:18:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 92 states have internal predecessors, (103), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:18:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2024-10-11 18:18:43,337 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 44 [2024-10-11 18:18:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:43,338 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2024-10-11 18:18:43,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 2.0625) internal successors, (66), 30 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:18:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2024-10-11 18:18:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 18:18:43,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:43,342 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:43,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-11 18:18:43,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:43,542 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:18:43,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash -789688543, now seen corresponding path program 1 times [2024-10-11 18:18:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:43,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336255772] [2024-10-11 18:18:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:44,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:44,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:44,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:18:44,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:44,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336255772] [2024-10-11 18:18:44,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336255772] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:44,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999001439] [2024-10-11 18:18:44,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:44,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:44,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:44,441 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:44,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-11 18:18:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:44,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-10-11 18:18:44,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:44,941 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-11 18:18:45,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:18:45,056 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:18:45,057 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-11 18:18:45,327 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-11 18:18:45,332 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-11 18:18:45,337 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-11 18:18:45,416 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-11 18:18:45,416 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 119 treesize of output 76 [2024-10-11 18:18:45,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-10-11 18:18:45,424 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 55 treesize of output 19 [2024-10-11 18:18:45,494 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 50 treesize of output 30 [2024-10-11 18:18:45,582 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-11 18:18:45,587 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-11 18:18:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:18:45,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:45,822 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (v_ArrVal_4074 (Array Int Int))) (or (not (= v_ArrVal_4073 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_4073 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4073) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4074) .cse0) .cse1)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4072) .cse0) .cse1) 4)))))) is different from false [2024-10-11 18:18:45,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:45,832 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 61 treesize of output 62 [2024-10-11 18:18:45,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:45,842 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 120 treesize of output 123 [2024-10-11 18:18:45,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:45,848 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 100 treesize of output 92 [2024-10-11 18:18:45,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:45,859 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 170 treesize of output 161 [2024-10-11 18:18:45,866 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 35 treesize of output 29 [2024-10-11 18:18:45,871 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 29 treesize of output 23 [2024-10-11 18:18:47,541 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse20 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse13 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse16 (= .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse10 (not .cse16)) (.cse11 (forall ((v_arrayElimCell_124 Int) (v_arrayElimCell_123 Int) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4073 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse13 v_ArrVal_4071) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4073) v_arrayElimCell_123) (+ v_arrayElimCell_124 4))) (not (= v_ArrVal_4073 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_4073 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) (.cse15 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse6 (< .cse26 0))) (let ((.cse7 (let ((.cse25 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (< .cse25 1) .cse6) (or (< .cse26 (+ .cse25 1)) .cse6)))) (.cse1 (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4073 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| .cse13 v_ArrVal_4071))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse24 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4073) v_arrayElimCell_120) (+ v_arrayElimCell_122 4))) (not (= (store (select .cse24 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_4073 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_4073))))) .cse16)) (.cse3 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_124 Int) (v_arrayElimCell_123 Int) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4073 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#1| .cse13 v_ArrVal_4071))) (or (not (= (store (select .cse23 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_4073 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_4073)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_4073 (+ v_arrayElimCell_122 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse23 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4073) v_arrayElimCell_123) (+ v_arrayElimCell_124 4))))))) (.cse4 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_arrayElimCell_124 Int) (v_arrayElimCell_123 Int) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4073 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| .cse13 v_ArrVal_4071))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4073))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 v_arrayElimCell_120) (+ v_arrayElimCell_122 4))) (not (= (store (select .cse22 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_4073 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_4073)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 v_arrayElimCell_123) (+ v_arrayElimCell_124 4)))))))) (.cse5 (or .cse16 (forall ((v_arrayElimCell_122 Int) (v_DerPreprocessor_6 Int) (v_ArrVal_4071 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse13 v_ArrVal_4071) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_6) (+ v_arrayElimCell_122 4)))))) (.cse0 (= .cse13 .cse20)) (.cse8 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_124 Int) (v_arrayElimCell_123 Int) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4073 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| .cse13 v_ArrVal_4071))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4073))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_120) .cse15)) (not (= (store (select .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_4073 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_4073)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_123) (+ v_arrayElimCell_124 4)))))))) (.cse9 (or .cse16 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4073 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| .cse13 v_ArrVal_4071))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4073) v_arrayElimCell_120) .cse15)) (not (= (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_4073 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_4073))))))) (.cse2 (or .cse10 .cse11))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6) (or .cse7 (and .cse8 .cse9)) (or .cse7 (and .cse1 .cse3 .cse4 (or .cse0 .cse10 .cse11) .cse5)) (or .cse10 .cse6 (forall ((v_arrayElimCell_124 Int) (v_arrayElimCell_123 Int) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4073 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| .cse13 v_ArrVal_4071))) (or (not (= (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_4073 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_4073)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4073) v_arrayElimCell_123) (+ v_arrayElimCell_124 4))))))) (or (forall ((v_arrayElimCell_124 Int) (v_arrayElimCell_123 Int) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4073 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| .cse13 v_ArrVal_4071))) (or (not (= (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_4073 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_4073)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4073) v_arrayElimCell_123) (+ v_arrayElimCell_124 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_4073 .cse15))))) .cse6) (or .cse16 .cse6 (forall ((v_ArrVal_4071 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse13 v_ArrVal_4071) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse15)))) (or .cse0 .cse6 (and .cse8 .cse9 .cse2))))))) is different from false [2024-10-11 18:18:50,149 INFO L349 Elim1Store]: treesize reduction 1615, result has 18.7 percent of original size [2024-10-11 18:18:50,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 211 case distinctions, treesize of input 2762 treesize of output 2951 [2024-10-11 18:18:50,280 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 1848 treesize of output 1844 [2024-10-11 18:18:50,495 INFO L224 Elim1Store]: Index analysis took 124 ms