./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_prepend_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_prepend_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 f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:17:37,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:17:37,691 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:37,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:17:37,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:17:37,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:17:37,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:17:37,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:17:37,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:17:37,732 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:17:37,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:17:37,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:17:37,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:17:37,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:17:37,739 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:17:37,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:17:37,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:17:37,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:17:37,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:17:37,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:17:37,741 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:17:37,743 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:17:37,743 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:17:37,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:17:37,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:17:37,744 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:17:37,744 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:17:37,744 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:17:37,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:17:37,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:17:37,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:17:37,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:17:37,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:17:37,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:17:37,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:17:37,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:17:37,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:17:37,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:17:37,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:17:37,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:17:37,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:17:37,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:17:37,749 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2024-10-11 18:17:37,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:17:38,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:17:38,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:17:38,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:17:38,028 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:17:38,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2024-10-11 18:17:39,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:17:39,789 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:17:39,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2024-10-11 18:17:39,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2600924cc/651f880ca4a941839f07493d751c98ee/FLAG5261e7ca7 [2024-10-11 18:17:40,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2600924cc/651f880ca4a941839f07493d751c98ee [2024-10-11 18:17:40,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:17:40,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:17:40,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:17:40,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:17:40,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:17:40,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:17:40" (1/1) ... [2024-10-11 18:17:40,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3882ed8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:40, skipping insertion in model container [2024-10-11 18:17:40,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:17:40" (1/1) ... [2024-10-11 18:17:40,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:17:40,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:17:40,579 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:17:40,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:17:40,675 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:17:40,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:40 WrapperNode [2024-10-11 18:17:40,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:17:40,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:17:40,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:17:40,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:17:40,685 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:40" (1/1) ... [2024-10-11 18:17:40,706 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:40" (1/1) ... [2024-10-11 18:17:40,739 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 148 [2024-10-11 18:17:40,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:17:40,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:17:40,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:17:40,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:17:40,755 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:40" (1/1) ... [2024-10-11 18:17:40,756 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:40" (1/1) ... [2024-10-11 18:17:40,761 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:40" (1/1) ... [2024-10-11 18:17:40,783 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 10, 13]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 2, 7]. [2024-10-11 18:17:40,784 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:40" (1/1) ... [2024-10-11 18:17:40,784 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:40" (1/1) ... [2024-10-11 18:17:40,793 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:40" (1/1) ... [2024-10-11 18:17:40,798 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:40" (1/1) ... [2024-10-11 18:17:40,803 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:40" (1/1) ... [2024-10-11 18:17:40,805 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:40" (1/1) ... [2024-10-11 18:17:40,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:17:40,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:17:40,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:17:40,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:17:40,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:40" (1/1) ... [2024-10-11 18:17:40,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:17:40,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:40,860 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:40,862 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:40,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:17:40,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:17:40,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 18:17:40,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:17:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:17:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 18:17:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 18:17:40,915 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 18:17:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:17:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:17:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:17:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:17:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:17:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 18:17:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:17:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:17:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:17:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:17:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:17:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:17:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:17:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:17:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:17:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 18:17:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:17:40,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:17:41,038 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:17:41,040 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:17:41,424 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-10-11 18:17:41,425 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:17:41,539 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:17:41,541 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 18:17:41,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:17:41 BoogieIcfgContainer [2024-10-11 18:17:41,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:17:41,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:17:41,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:17:41,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:17:41,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:17:40" (1/3) ... [2024-10-11 18:17:41,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:17:41, skipping insertion in model container [2024-10-11 18:17:41,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:40" (2/3) ... [2024-10-11 18:17:41,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:17:41, skipping insertion in model container [2024-10-11 18:17:41,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:17:41" (3/3) ... [2024-10-11 18:17:41,553 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2024-10-11 18:17:41,570 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:17:41,571 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2024-10-11 18:17:41,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:17:41,633 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;@8522e37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:17:41,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-10-11 18:17:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 50 states have (on average 2.32) internal successors, (116), 102 states have internal predecessors, (116), 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:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:17:41,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:41,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:17:41,648 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:41,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 233264712, now seen corresponding path program 1 times [2024-10-11 18:17:41,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:41,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681292854] [2024-10-11 18:17:41,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:41,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:41,946 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:41,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:41,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681292854] [2024-10-11 18:17:41,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681292854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:41,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:41,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:17:41,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103270811] [2024-10-11 18:17:41,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:41,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:17:41,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:41,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:17:41,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:41,987 INFO L87 Difference]: Start difference. First operand has 107 states, 50 states have (on average 2.32) internal successors, (116), 102 states have internal predecessors, (116), 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:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:42,123 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-10-11 18:17:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:17:42,126 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:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:42,132 INFO L225 Difference]: With dead ends: 104 [2024-10-11 18:17:42,132 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 18:17:42,133 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:42,136 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 152 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:42,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 152 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:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 18:17:42,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-11 18:17:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 97 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:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2024-10-11 18:17:42,172 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 5 [2024-10-11 18:17:42,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:42,172 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2024-10-11 18:17:42,172 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:42,172 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2024-10-11 18:17:42,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:17:42,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:42,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:17:42,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:17:42,174 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:42,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:42,174 INFO L85 PathProgramCache]: Analyzing trace with hash 233264713, now seen corresponding path program 1 times [2024-10-11 18:17:42,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:42,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995519659] [2024-10-11 18:17:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:42,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:42,293 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:42,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:42,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995519659] [2024-10-11 18:17:42,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995519659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:42,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:42,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:17:42,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847749090] [2024-10-11 18:17:42,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:42,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:17:42,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:42,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:17:42,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:42,299 INFO L87 Difference]: Start difference. First operand 102 states and 110 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:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:42,412 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2024-10-11 18:17:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:17:42,413 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:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:42,414 INFO L225 Difference]: With dead ends: 100 [2024-10-11 18:17:42,415 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 18:17:42,415 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:42,416 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 156 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:42,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 156 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:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 18:17:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 18:17:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 2.125) internal successors, (102), 95 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:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2024-10-11 18:17:42,425 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 5 [2024-10-11 18:17:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:42,426 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2024-10-11 18:17:42,426 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:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2024-10-11 18:17:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:17:42,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:42,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:42,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:17:42,427 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:42,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:42,428 INFO L85 PathProgramCache]: Analyzing trace with hash -791732290, now seen corresponding path program 1 times [2024-10-11 18:17:42,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:42,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892783221] [2024-10-11 18:17:42,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:42,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:42,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:42,583 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:42,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:42,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892783221] [2024-10-11 18:17:42,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892783221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:42,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:42,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:17:42,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81533607] [2024-10-11 18:17:42,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:42,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:17:42,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:42,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:17:42,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:17:42,587 INFO L87 Difference]: Start difference. First operand 100 states and 108 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:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:42,724 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2024-10-11 18:17:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:17:42,724 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:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:42,725 INFO L225 Difference]: With dead ends: 101 [2024-10-11 18:17:42,726 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:17:42,726 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:42,727 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:42,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 213 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:17:42,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 18:17:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 96 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:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2024-10-11 18:17:42,739 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 10 [2024-10-11 18:17:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:42,740 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2024-10-11 18:17:42,740 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:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2024-10-11 18:17:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:17:42,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:42,741 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:42,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:17:42,742 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:42,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash 434569947, now seen corresponding path program 1 times [2024-10-11 18:17:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664398895] [2024-10-11 18:17:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:42,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:42,969 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:42,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:42,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664398895] [2024-10-11 18:17:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664398895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:42,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:42,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980217526] [2024-10-11 18:17:42,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:42,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:42,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:42,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:42,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:42,972 INFO L87 Difference]: Start difference. First operand 101 states and 109 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:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:43,252 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2024-10-11 18:17:43,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:43,252 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:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:43,253 INFO L225 Difference]: With dead ends: 100 [2024-10-11 18:17:43,253 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 18:17:43,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:43,254 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 327 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:43,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 327 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:17:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 18:17:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 18:17:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 95 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:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2024-10-11 18:17:43,265 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 17 [2024-10-11 18:17:43,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:43,265 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2024-10-11 18:17:43,265 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:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2024-10-11 18:17:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:17:43,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:43,266 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:43,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:17:43,267 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:43,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash 434569948, now seen corresponding path program 1 times [2024-10-11 18:17:43,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:43,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140526902] [2024-10-11 18:17:43,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:43,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,527 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:43,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140526902] [2024-10-11 18:17:43,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140526902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:43,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:43,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:43,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527406399] [2024-10-11 18:17:43,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:43,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:43,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:43,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:43,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:43,532 INFO L87 Difference]: Start difference. First operand 100 states and 108 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:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:43,733 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2024-10-11 18:17:43,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:43,733 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:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:43,737 INFO L225 Difference]: With dead ends: 99 [2024-10-11 18:17:43,737 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 18:17:43,737 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:43,738 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 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:43,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 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:43,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 18:17:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 18:17:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 49 states have (on average 2.061224489795918) internal successors, (101), 94 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:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2024-10-11 18:17:43,752 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 17 [2024-10-11 18:17:43,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:43,752 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2024-10-11 18:17:43,754 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:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2024-10-11 18:17:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:17:43,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:43,755 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:43,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:17:43,756 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:43,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:43,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1010083920, now seen corresponding path program 1 times [2024-10-11 18:17:43,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:43,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611809949] [2024-10-11 18:17:43,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:43,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:44,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:44,115 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:44,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:44,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611809949] [2024-10-11 18:17:44,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611809949] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:44,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981182029] [2024-10-11 18:17:44,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:44,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:44,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:44,121 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:44,122 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:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:44,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 18:17:44,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:44,288 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,390 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:17:44,391 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:44,446 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:44,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:44,722 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:44,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981182029] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:17:44,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:17:44,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2024-10-11 18:17:44,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374934963] [2024-10-11 18:17:44,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:44,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:17:44,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:44,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:17:44,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:17:44,725 INFO L87 Difference]: Start difference. First operand 99 states and 107 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:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:45,123 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2024-10-11 18:17:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:45,124 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:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:45,125 INFO L225 Difference]: With dead ends: 98 [2024-10-11 18:17:45,125 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 18:17:45,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:17:45,126 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:45,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:17:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 18:17:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 18:17:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 93 states have internal predecessors, (100), 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:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2024-10-11 18:17:45,138 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 19 [2024-10-11 18:17:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:45,138 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2024-10-11 18:17:45,138 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:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2024-10-11 18:17:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:17:45,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:45,139 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:45,159 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:45,344 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:45,345 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:45,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:45,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1010083921, now seen corresponding path program 1 times [2024-10-11 18:17:45,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:45,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276991199] [2024-10-11 18:17:45,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:45,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:45,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:45,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:45,872 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:45,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:45,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276991199] [2024-10-11 18:17:45,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276991199] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:45,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758010620] [2024-10-11 18:17:45,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:45,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:45,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:45,876 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:45,877 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:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:46,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 18:17:46,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:46,022 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:46,028 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:46,188 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:46,188 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:46,194 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:46,231 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:46,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:46,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758010620] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:46,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:46,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-10-11 18:17:46,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324035874] [2024-10-11 18:17:46,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:46,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:17:46,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:46,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:17:46,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:17:46,360 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 16 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:17:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:46,844 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2024-10-11 18:17:46,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:17:46,845 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2024-10-11 18:17:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:46,846 INFO L225 Difference]: With dead ends: 99 [2024-10-11 18:17:46,846 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 18:17:46,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:17:46,847 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:46,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 432 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:17:46,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 18:17:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-10-11 18:17:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 49 states have (on average 2.020408163265306) internal successors, (99), 92 states have internal predecessors, (99), 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:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2024-10-11 18:17:46,858 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 19 [2024-10-11 18:17:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:46,858 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2024-10-11 18:17:46,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:17:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2024-10-11 18:17:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:17:46,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:46,862 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:46,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:47,062 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:47,063 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:47,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:47,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1861334165, now seen corresponding path program 1 times [2024-10-11 18:17:47,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:47,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449241106] [2024-10-11 18:17:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,559 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:47,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:47,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449241106] [2024-10-11 18:17:47,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449241106] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:47,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352692286] [2024-10-11 18:17:47,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:47,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:47,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:47,565 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:47,566 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:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 18:17:47,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:47,719 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:47,741 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:47,761 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:17:47,762 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:47,825 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:17:47,825 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:47,891 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:17:47,891 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:47,902 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:47,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:48,277 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:48,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352692286] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:17:48,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:17:48,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2024-10-11 18:17:48,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741872308] [2024-10-11 18:17:48,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:48,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 18:17:48,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:48,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 18:17:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=303, Unknown=1, NotChecked=36, Total=420 [2024-10-11 18:17:48,280 INFO L87 Difference]: Start difference. First operand 97 states and 105 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:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:48,721 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2024-10-11 18:17:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:48,721 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:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:48,722 INFO L225 Difference]: With dead ends: 105 [2024-10-11 18:17:48,722 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 18:17:48,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=402, Unknown=1, NotChecked=42, Total=552 [2024-10-11 18:17:48,724 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 164 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:48,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 327 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 500 Invalid, 0 Unknown, 109 Unchecked, 0.4s Time] [2024-10-11 18:17:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 18:17:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2024-10-11 18:17:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.836734693877551) internal successors, (90), 83 states have internal predecessors, (90), 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:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-10-11 18:17:48,730 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 27 [2024-10-11 18:17:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:48,730 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-10-11 18:17:48,730 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:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-10-11 18:17:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:17:48,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:48,731 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:48,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:17:48,932 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:48,933 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:48,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1861334164, now seen corresponding path program 1 times [2024-10-11 18:17:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:48,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412891457] [2024-10-11 18:17:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:48,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:49,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:49,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:49,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:17:49,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:49,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412891457] [2024-10-11 18:17:49,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412891457] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:49,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523850942] [2024-10-11 18:17:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:49,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:49,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:49,457 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:49,458 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:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:49,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 18:17:49,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:49,622 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:49,630 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:49,649 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-10-11 18:17:49,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:49,678 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:49,700 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:49,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:49,731 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:49,767 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:49,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:49,799 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:49,805 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:49,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:49,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523850942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:49,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:49,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-10-11 18:17:49,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117475681] [2024-10-11 18:17:49,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:49,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:49,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:49,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-10-11 18:17:49,807 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:49,932 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-10-11 18:17:49,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:49,933 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), 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 27 [2024-10-11 18:17:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:49,933 INFO L225 Difference]: With dead ends: 82 [2024-10-11 18:17:49,934 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 18:17:49,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:17:49,937 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 18 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:49,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 190 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 111 Unchecked, 0.1s Time] [2024-10-11 18:17:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 18:17:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 18:17:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 77 states have internal predecessors, (84), 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:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-10-11 18:17:49,946 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 27 [2024-10-11 18:17:49,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:49,947 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-10-11 18:17:49,947 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), 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:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-10-11 18:17:49,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:17:49,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:49,949 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:49,967 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:50,152 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,SelfDestructingSolverStorable8 [2024-10-11 18:17:50,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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:50,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:50,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1316655134, now seen corresponding path program 1 times [2024-10-11 18:17:50,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:50,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932198607] [2024-10-11 18:17:50,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:50,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:50,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:50,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:50,284 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:50,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:50,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932198607] [2024-10-11 18:17:50,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932198607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:50,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:50,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:50,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012957149] [2024-10-11 18:17:50,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:50,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:50,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:50,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:50,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:50,287 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:50,448 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2024-10-11 18:17:50,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:50,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 30 [2024-10-11 18:17:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:50,449 INFO L225 Difference]: With dead ends: 80 [2024-10-11 18:17:50,449 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 18:17:50,449 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:50,450 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 17 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:50,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 251 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:50,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 18:17:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 18:17:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 75 states have internal predecessors, (82), 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:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2024-10-11 18:17:50,454 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 30 [2024-10-11 18:17:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:50,454 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2024-10-11 18:17:50,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2024-10-11 18:17:50,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:17:50,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:50,460 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:50,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:17:50,460 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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:50,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1316655135, now seen corresponding path program 1 times [2024-10-11 18:17:50,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:50,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888392938] [2024-10-11 18:17:50,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:50,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:50,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:50,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:50,650 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:50,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:50,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888392938] [2024-10-11 18:17:50,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888392938] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:50,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069585458] [2024-10-11 18:17:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:50,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:50,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:50,653 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:50,655 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:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:50,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 18:17:50,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:17:50,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:50,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069585458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:50,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:50,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-11 18:17:50,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655876979] [2024-10-11 18:17:50,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:50,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:17:50,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:50,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:17:50,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:17:50,887 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 6 states, 4 states have (on average 5.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:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:50,998 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2024-10-11 18:17:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:17:50,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.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 30 [2024-10-11 18:17:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:51,000 INFO L225 Difference]: With dead ends: 78 [2024-10-11 18:17:51,000 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 18:17:51,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:17:51,001 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 16 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:51,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 246 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 18:17:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 18:17:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 73 states have internal predecessors, (80), 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:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2024-10-11 18:17:51,005 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 30 [2024-10-11 18:17:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:51,005 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2024-10-11 18:17:51,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.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:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2024-10-11 18:17:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:17:51,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:51,006 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:51,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:51,207 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:51,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:51,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1316668384, now seen corresponding path program 1 times [2024-10-11 18:17:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54561895] [2024-10-11 18:17:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:51,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:51,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:51,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:51,593 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:51,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:51,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54561895] [2024-10-11 18:17:51,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54561895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:51,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668061104] [2024-10-11 18:17:51,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:51,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:51,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:51,596 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:51,598 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:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:51,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 18:17:51,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:51,939 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:51,959 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:51,978 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-11 18:17:51,978 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 16 treesize of output 18 [2024-10-11 18:17:52,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 17 treesize of output 9 [2024-10-11 18:17:52,016 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:52,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:52,147 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:52,165 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:52,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668061104] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:52,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:52,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 11] total 21 [2024-10-11 18:17:52,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617434761] [2024-10-11 18:17:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:52,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:17:52,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:52,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:17:52,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=369, Unknown=1, NotChecked=38, Total=462 [2024-10-11 18:17:52,167 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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:52,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:52,324 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2024-10-11 18:17:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:52,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 30 [2024-10-11 18:17:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:52,326 INFO L225 Difference]: With dead ends: 78 [2024-10-11 18:17:52,326 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 18:17:52,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=407, Unknown=1, NotChecked=40, Total=506 [2024-10-11 18:17:52,327 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 22 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:52,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 212 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 18:17:52,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2024-10-11 18:17:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 72 states have internal predecessors, (80), 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:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2024-10-11 18:17:52,334 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 30 [2024-10-11 18:17:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:52,334 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2024-10-11 18:17:52,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2024-10-11 18:17:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:17:52,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:52,336 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:52,356 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:52,537 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,SelfDestructingSolverStorable11 [2024-10-11 18:17:52,537 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:52,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1316668385, now seen corresponding path program 1 times [2024-10-11 18:17:52,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:52,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128905704] [2024-10-11 18:17:52,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:52,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:52,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:52,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:53,045 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:53,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:53,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128905704] [2024-10-11 18:17:53,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128905704] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:53,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773504574] [2024-10-11 18:17:53,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:53,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:53,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:53,048 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:53,050 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:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:53,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 18:17:53,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:53,378 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:53,383 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:53,608 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:53,613 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:53,656 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0) 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:53,702 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:17:53,703 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:53,711 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:53,793 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:53,798 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:53,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:53,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773504574] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:53,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:53,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2024-10-11 18:17:53,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168517598] [2024-10-11 18:17:53,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:53,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 18:17:53,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:53,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 18:17:53,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=578, Unknown=1, NotChecked=48, Total=702 [2024-10-11 18:17:53,957 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 24 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 20 states have internal predecessors, (44), 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:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:54,637 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-10-11 18:17:54,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:17:54,638 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 20 states have internal predecessors, (44), 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 30 [2024-10-11 18:17:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:54,639 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:17:54,639 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:17:54,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=1056, Unknown=1, NotChecked=66, Total=1260 [2024-10-11 18:17:54,640 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 95 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:54,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 534 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 689 Invalid, 0 Unknown, 95 Unchecked, 0.4s Time] [2024-10-11 18:17:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:17:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-10-11 18:17:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 83 states have internal predecessors, (91), 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:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2024-10-11 18:17:54,647 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2024-10-11 18:17:54,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:54,647 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2024-10-11 18:17:54,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 20 states have internal predecessors, (44), 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:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2024-10-11 18:17:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:17:54,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:54,648 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:54,669 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:54,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:54,849 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:54,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1709766752, now seen corresponding path program 1 times [2024-10-11 18:17:54,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:54,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127909519] [2024-10-11 18:17:54,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:54,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,123 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:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:55,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127909519] [2024-10-11 18:17:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127909519] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:55,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146706555] [2024-10-11 18:17:55,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:55,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:55,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:55,128 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:55,132 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:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 18:17:55,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:55,341 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,370 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:55,388 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-10-11 18:17:55,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:55,415 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,439 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:55,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:55,467 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,499 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:55,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:55,526 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,562 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:55,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:55,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146706555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:55,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:55,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 14 [2024-10-11 18:17:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691406502] [2024-10-11 18:17:55,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:55,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:17:55,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:55,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:17:55,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:17:55,564 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 6 states, 5 states have (on average 3.6) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:55,642 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-10-11 18:17:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:17:55,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-11 18:17:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:55,643 INFO L225 Difference]: With dead ends: 86 [2024-10-11 18:17:55,643 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:17:55,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:17:55,644 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 32 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:55,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 142 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2024-10-11 18:17:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:17:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 18:17:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 80 states have internal predecessors, (88), 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:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2024-10-11 18:17:55,648 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 32 [2024-10-11 18:17:55,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:55,648 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2024-10-11 18:17:55,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2024-10-11 18:17:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:17:55,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:55,649 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:55,668 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:55,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 18:17:55,850 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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:55,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:55,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1463157820, now seen corresponding path program 1 times [2024-10-11 18:17:55,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:55,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631446176] [2024-10-11 18:17:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,095 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:56,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:56,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631446176] [2024-10-11 18:17:56,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631446176] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:56,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845735115] [2024-10-11 18:17:56,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:56,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:56,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:56,099 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:56,100 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:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 18:17:56,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:56,312 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:56,428 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:56,432 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:56,459 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:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:17:56,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:56,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845735115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:56,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:56,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2024-10-11 18:17:56,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304577500] [2024-10-11 18:17:56,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:56,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:17:56,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:56,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:17:56,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:17:56,479 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 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:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:56,656 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2024-10-11 18:17:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:17:56,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 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 33 [2024-10-11 18:17:56,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:56,657 INFO L225 Difference]: With dead ends: 93 [2024-10-11 18:17:56,657 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:17:56,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:17:56,658 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 46 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:56,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 318 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:17:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-10-11 18:17:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.46875) internal successors, (94), 83 states have internal predecessors, (94), 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:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2024-10-11 18:17:56,663 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 33 [2024-10-11 18:17:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:56,664 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2024-10-11 18:17:56,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 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:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2024-10-11 18:17:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:17:56,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:56,668 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:56,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 18:17:56,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:56,870 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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:56,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1463157821, now seen corresponding path program 1 times [2024-10-11 18:17:56,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:56,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298315342] [2024-10-11 18:17:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:56,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:57,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:57,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:57,081 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:57,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:57,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298315342] [2024-10-11 18:17:57,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298315342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:57,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439512883] [2024-10-11 18:17:57,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:57,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:57,084 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:57,086 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:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:57,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:17:57,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:57,326 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:57,358 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:57,371 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:57,371 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:57,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439512883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:57,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:57,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-11 18:17:57,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756114981] [2024-10-11 18:17:57,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:57,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:17:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:57,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:17:57,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:17:57,373 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:57,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:57,470 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2024-10-11 18:17:57,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:57,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 33 [2024-10-11 18:17:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:57,472 INFO L225 Difference]: With dead ends: 115 [2024-10-11 18:17:57,472 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 18:17:57,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:17:57,473 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 44 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:57,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 233 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:57,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 18:17:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 91. [2024-10-11 18:17:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 85 states have internal predecessors, (95), 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:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2024-10-11 18:17:57,478 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 33 [2024-10-11 18:17:57,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:57,478 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2024-10-11 18:17:57,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2024-10-11 18:17:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:17:57,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:57,480 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:57,495 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:57,683 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,SelfDestructingSolverStorable15 [2024-10-11 18:17:57,684 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:17:57,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1237464813, now seen corresponding path program 1 times [2024-10-11 18:17:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687801198] [2024-10-11 18:17:57,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:58,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:58,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:58,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:58,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:58,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687801198] [2024-10-11 18:17:58,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687801198] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:58,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074142998] [2024-10-11 18:17:58,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:58,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:58,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:58,534 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:58,535 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:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:58,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-10-11 18:17:58,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:58,858 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:59,006 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:59,007 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:59,080 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:59,147 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-11 18:17:59,148 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:17:59,194 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:17:59,198 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:59,365 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_72| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_72| 1)) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_72|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_72|) 0))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_9|) 0) 0))) is different from true [2024-10-11 18:17:59,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:59,406 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:17:59,436 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2024-10-11 18:17:59,436 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 34 treesize of output 57 [2024-10-11 18:17:59,723 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 66 treesize of output 38 [2024-10-11 18:17:59,806 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 33 treesize of output 17 [2024-10-11 18:17:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:17:59,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:59,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074142998] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:59,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:59,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2024-10-11 18:17:59,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886057491] [2024-10-11 18:17:59,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:59,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 18:17:59,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:59,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 18:17:59,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1279, Unknown=1, NotChecked=72, Total=1482 [2024-10-11 18:17:59,958 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 38 states, 29 states have (on average 1.896551724137931) internal successors, (55), 31 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:18:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:00,865 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2024-10-11 18:18:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 18:18:00,866 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 1.896551724137931) internal successors, (55), 31 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-10-11 18:18:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:00,867 INFO L225 Difference]: With dead ends: 130 [2024-10-11 18:18:00,867 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 18:18:00,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=263, Invalid=2496, Unknown=1, NotChecked=102, Total=2862 [2024-10-11 18:18:00,869 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 145 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:00,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 714 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 878 Invalid, 0 Unknown, 124 Unchecked, 0.5s Time] [2024-10-11 18:18:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 18:18:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2024-10-11 18:18:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.380952380952381) internal successors, (116), 102 states have internal predecessors, (116), 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:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2024-10-11 18:18:00,874 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 34 [2024-10-11 18:18:00,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:00,874 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2024-10-11 18:18:00,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 1.896551724137931) internal successors, (55), 31 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:18:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2024-10-11 18:18:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:18:00,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:00,875 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:00,894 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:18:01,079 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,SelfDestructingSolverStorable16 [2024-10-11 18:18:01,080 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:18:01,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1237464814, now seen corresponding path program 1 times [2024-10-11 18:18:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:01,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405849664] [2024-10-11 18:18:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:01,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:01,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:02,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:18:02,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:02,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405849664] [2024-10-11 18:18:02,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405849664] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:02,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378115196] [2024-10-11 18:18:02,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:02,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:02,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:02,581 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:18:02,582 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:18:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:02,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-10-11 18:18:02,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:02,941 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:02,946 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:18:03,306 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:18:03,306 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:03,319 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:18:03,434 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:03,440 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:03,522 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-11 18:18:03,522 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:18:03,526 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:03,615 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:18:03,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-11 18:18:03,627 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:18:03,637 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:03,882 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_81| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_81| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_81|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_81| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_81|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_81| (select |c_#length| |v_node_create_~temp~0#1.base_81|)) |c_#length|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_81|) 0)))) is different from true [2024-10-11 18:18:03,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:03,912 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:18:03,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:03,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2024-10-11 18:18:03,939 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 18:18:03,939 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:03,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 18:18:04,152 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 48 treesize of output 28 [2024-10-11 18:18:04,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:18:04,211 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:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:18:04,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:04,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378115196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:04,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:18:04,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2024-10-11 18:18:04,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628798610] [2024-10-11 18:18:04,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:04,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 18:18:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:04,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 18:18:04,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2015, Unknown=1, NotChecked=90, Total=2256 [2024-10-11 18:18:04,606 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand has 43 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 36 states have internal predecessors, (55), 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:18:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:06,587 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2024-10-11 18:18:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 18:18:06,588 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 36 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-10-11 18:18:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:06,589 INFO L225 Difference]: With dead ends: 133 [2024-10-11 18:18:06,589 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 18:18:06,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=333, Invalid=3830, Unknown=1, NotChecked=126, Total=4290 [2024-10-11 18:18:06,591 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 166 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:06,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 948 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1527 Invalid, 0 Unknown, 128 Unchecked, 1.1s Time] [2024-10-11 18:18:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 18:18:06,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2024-10-11 18:18:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 101 states have internal predecessors, (114), 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:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2024-10-11 18:18:06,596 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 34 [2024-10-11 18:18:06,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:06,596 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2024-10-11 18:18:06,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 36 states have internal predecessors, (55), 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:18:06,597 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2024-10-11 18:18:06,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:18:06,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:06,599 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:18:06,618 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:18:06,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:18:06,800 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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:06,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:06,800 INFO L85 PathProgramCache]: Analyzing trace with hash -130952217, now seen corresponding path program 1 times [2024-10-11 18:18:06,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:06,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307059549] [2024-10-11 18:18:06,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:06,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:06,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:07,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:07,018 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:18:07,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:07,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307059549] [2024-10-11 18:18:07,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307059549] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:07,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165932139] [2024-10-11 18:18:07,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:07,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:07,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:07,021 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:18:07,022 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:18:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:07,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:18:07,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:07,329 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:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:07,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:07,380 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:18:07,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165932139] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:18:07,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:18:07,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-10-11 18:18:07,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930703972] [2024-10-11 18:18:07,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:07,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:18:07,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:07,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:18:07,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:18:07,384 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 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:11,400 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:15,408 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:19,421 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:23,431 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:27,453 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:31,569 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:35,579 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:39,655 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:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:39,659 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2024-10-11 18:18:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:18:39,660 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2024-10-11 18:18:39,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:39,660 INFO L225 Difference]: With dead ends: 105 [2024-10-11 18:18:39,660 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 18:18:39,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:18:39,661 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 15 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:39,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 561 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 318 Invalid, 8 Unknown, 0 Unchecked, 32.2s Time] [2024-10-11 18:18:39,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 18:18:39,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-11 18:18:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 96 states have internal predecessors, (107), 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:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2024-10-11 18:18:39,667 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 37 [2024-10-11 18:18:39,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:39,667 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2024-10-11 18:18:39,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 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:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2024-10-11 18:18:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:18:39,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:39,668 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:39,688 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:18:39,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:39,869 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:18:39,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:39,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1630577798, now seen corresponding path program 2 times [2024-10-11 18:18:39,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:39,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587798805] [2024-10-11 18:18:39,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:39,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:40,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:40,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:40,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:18:40,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:40,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587798805] [2024-10-11 18:18:40,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587798805] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:40,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96621239] [2024-10-11 18:18:40,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:18:40,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:40,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:40,927 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:18:40,928 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:18:41,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:18:41,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:18:41,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-10-11 18:18:41,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:41,163 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:41,415 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:18:41,416 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:18:41,489 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:41,493 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:41,566 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-11 18:18:41,566 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 85 treesize of output 47 [2024-10-11 18:18:41,579 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:41,654 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:18:41,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 24 [2024-10-11 18:18:41,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-11 18:18:41,666 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:41,826 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_102| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_102|) 0) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_102| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_102|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_102| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_102|)) |c_#memory_$Pointer$#2.base|))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 0) 0))) is different from true [2024-10-11 18:18:41,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:41,845 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-11 18:18:41,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 46 [2024-10-11 18:18:41,865 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 18:18:41,865 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:41,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 18:18:42,137 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 54 treesize of output 30 [2024-10-11 18:18:42,200 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:18:42,296 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:18:42,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2024-10-11 18:18:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:18:42,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:42,410 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2024-10-11 18:18:42,410 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 24 treesize of output 23 [2024-10-11 18:18:42,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96621239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:42,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:18:42,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2024-10-11 18:18:42,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051999222] [2024-10-11 18:18:42,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:42,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-11 18:18:42,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:42,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-11 18:18:42,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2111, Unknown=1, NotChecked=92, Total=2352 [2024-10-11 18:18:42,618 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 44 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 37 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:18:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:44,397 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2024-10-11 18:18:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 18:18:44,397 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 37 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 38 [2024-10-11 18:18:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:44,398 INFO L225 Difference]: With dead ends: 113 [2024-10-11 18:18:44,398 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 18:18:44,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=348, Invalid=3945, Unknown=1, NotChecked=128, Total=4422 [2024-10-11 18:18:44,399 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 100 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:44,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1276 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1481 Invalid, 0 Unknown, 107 Unchecked, 0.9s Time] [2024-10-11 18:18:44,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 18:18:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2024-10-11 18:18:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 99 states have internal predecessors, (110), 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:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2024-10-11 18:18:44,403 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 38 [2024-10-11 18:18:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:44,404 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2024-10-11 18:18:44,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 37 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:18:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2024-10-11 18:18:44,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:18:44,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:44,405 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] [2024-10-11 18:18:44,423 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:18:44,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:44,606 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:18:44,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1612769320, now seen corresponding path program 1 times [2024-10-11 18:18:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696925200] [2024-10-11 18:18:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:44,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:44,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:44,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:44,839 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:18:44,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696925200] [2024-10-11 18:18:44,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696925200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:44,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:44,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:18:44,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075492286] [2024-10-11 18:18:44,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:44,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:18:44,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:44,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:18:44,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:18:44,842 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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:18:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:45,036 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-10-11 18:18:45,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:18:45,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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 39 [2024-10-11 18:18:45,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:45,038 INFO L225 Difference]: With dead ends: 112 [2024-10-11 18:18:45,038 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 18:18:45,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:18:45,039 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 33 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:45,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 323 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:18:45,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 18:18:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2024-10-11 18:18:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.345679012345679) internal successors, (109), 99 states have internal predecessors, (109), 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:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2024-10-11 18:18:45,047 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 39 [2024-10-11 18:18:45,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:45,048 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2024-10-11 18:18:45,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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:18:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2024-10-11 18:18:45,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:18:45,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:45,049 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:45,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 18:18:45,049 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:18:45,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash 580626815, now seen corresponding path program 3 times [2024-10-11 18:18:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:45,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663125987] [2024-10-11 18:18:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:45,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:45,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:45,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 18:18:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:45,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 18:18:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 18:18:45,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:45,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663125987] [2024-10-11 18:18:45,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663125987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:45,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:45,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:18:45,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244783612] [2024-10-11 18:18:45,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:45,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:18:45,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:45,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:18:45,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:18:45,157 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:18:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:45,225 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-10-11 18:18:45,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:18:45,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2024-10-11 18:18:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:45,228 INFO L225 Difference]: With dead ends: 77 [2024-10-11 18:18:45,228 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 18:18:45,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:18:45,229 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:45,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 18:18:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 18:18:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 71 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:18:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2024-10-11 18:18:45,236 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 43 [2024-10-11 18:18:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:45,236 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2024-10-11 18:18:45,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:18:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2024-10-11 18:18:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:18:45,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:45,237 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] [2024-10-11 18:18:45,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 18:18:45,237 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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:45,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:45,238 INFO L85 PathProgramCache]: Analyzing trace with hash 398591436, now seen corresponding path program 1 times [2024-10-11 18:18:45,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:45,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906195384] [2024-10-11 18:18:45,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:45,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:45,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:46,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:46,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:18:46,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:46,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906195384] [2024-10-11 18:18:46,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906195384] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:46,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872751119] [2024-10-11 18:18:46,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:46,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:46,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:46,273 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:18:46,275 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:18:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:46,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-11 18:18:46,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:46,532 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:46,610 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:18:46,610 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:18:46,661 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:46,704 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-11 18:18:46,705 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 53 treesize of output 46 [2024-10-11 18:18:46,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-10-11 18:18:46,747 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:46,816 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:18:46,817 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 29 treesize of output 32 [2024-10-11 18:18:46,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2024-10-11 18:18:46,832 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:18:46,833 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:46,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-11 18:18:46,944 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:46,972 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:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:18:46,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:47,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872751119] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:47,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:18:47,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 35 [2024-10-11 18:18:47,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792139695] [2024-10-11 18:18:47,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:47,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 18:18:47,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:47,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 18:18:47,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1231, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 18:18:47,115 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 35 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 states have internal predecessors, (58), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:18:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:47,803 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2024-10-11 18:18:47,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:18:47,804 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 states have internal predecessors, (58), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 43 [2024-10-11 18:18:47,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:47,805 INFO L225 Difference]: With dead ends: 77 [2024-10-11 18:18:47,805 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 18:18:47,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=1976, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 18:18:47,806 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 17 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:47,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 957 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:18:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 18:18:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 18:18:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 71 states have internal predecessors, (76), 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:18:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-10-11 18:18:47,809 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 43 [2024-10-11 18:18:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:47,810 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-10-11 18:18:47,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 states have internal predecessors, (58), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:18:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-10-11 18:18:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 18:18:47,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:47,823 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:47,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-11 18:18:48,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:48,024 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:18:48,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash 28356575, now seen corresponding path program 1 times [2024-10-11 18:18:48,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:48,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408274173] [2024-10-11 18:18:48,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:48,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:49,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:49,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:18:49,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:49,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408274173] [2024-10-11 18:18:49,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408274173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:49,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62428600] [2024-10-11 18:18:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:49,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:49,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:49,483 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:49,485 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:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:49,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-11 18:18:49,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:49,744 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:49,857 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:18:49,858 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:18:49,917 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:49,966 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-11 18:18:49,967 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:18:50,022 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:18:50,026 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:50,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 18:18:50,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:50,170 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:18:50,183 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-11 18:18:50,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-10-11 18:18:50,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:18:50,472 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2024-10-11 18:18:50,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 19 [2024-10-11 18:18:50,590 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 25 treesize of output 13 [2024-10-11 18:18:50,618 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:18:50,622 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 13 [2024-10-11 18:18:50,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-11 18:18:50,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-11 18:18:50,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-11 18:18:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:18:50,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:50,935 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3163 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3163) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-10-11 18:18:50,953 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3163 (Array Int Int)) (v_ArrVal_3159 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3159) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3163) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_3159 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_3159)))) is different from false [2024-10-11 18:18:51,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3163 (Array Int Int)) (v_ArrVal_3159 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3159) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_3163) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_3159 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_3159)))) is different from false [2024-10-11 18:18:51,061 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3163 (Array Int Int)) (v_ArrVal_3159 (Array Int Int))) (or (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_3159 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_3159)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3159) (select (select |c_#memory_$Pointer$#2.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3163) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2024-10-11 18:18:51,097 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3163 (Array Int Int)) (v_ArrVal_3159 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3159) (select (select |c_#memory_$Pointer$#2.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3163) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_3159 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) v_ArrVal_3159)))) is different from false [2024-10-11 18:18:51,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:51,170 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 524 treesize of output 514 [2024-10-11 18:18:51,186 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 103 treesize of output 71 [2024-10-11 18:18:51,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-11 18:18:51,252 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 325 treesize of output 277 [2024-10-11 18:18:51,271 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 306 treesize of output 274 [2024-10-11 18:18:51,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62428600] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:51,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:18:51,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 46 [2024-10-11 18:18:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378104976] [2024-10-11 18:18:51,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:51,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-11 18:18:51,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:51,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-11 18:18:51,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2305, Unknown=8, NotChecked=500, Total=2970 [2024-10-11 18:18:51,522 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 46 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:18:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:52,505 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-10-11 18:18:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 18:18:52,506 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2024-10-11 18:18:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:52,506 INFO L225 Difference]: With dead ends: 81 [2024-10-11 18:18:52,507 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 18:18:52,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=257, Invalid=3661, Unknown=8, NotChecked=630, Total=4556 [2024-10-11 18:18:52,508 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 96 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:52,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1161 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:18:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 18:18:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-10-11 18:18:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 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:18:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2024-10-11 18:18:52,511 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 47 [2024-10-11 18:18:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:52,511 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2024-10-11 18:18:52,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:18:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2024-10-11 18:18:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 18:18:52,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:52,512 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:52,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-11 18:18:52,712 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,SelfDestructingSolverStorable23 [2024-10-11 18:18:52,712 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-10-11 18:18:52,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash 882087891, now seen corresponding path program 1 times [2024-10-11 18:18:52,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:52,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911118650] [2024-10-11 18:18:52,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:55,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:55,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:18:55,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:55,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911118650] [2024-10-11 18:18:55,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911118650] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:55,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619217606] [2024-10-11 18:18:55,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:55,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:55,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:55,490 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:55,491 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:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:55,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-10-11 18:18:55,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:55,746 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:55,896 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:18:56,009 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:18:56,009 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:56,138 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:56,212 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-11 18:18:56,212 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:56,282 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:56,285 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:56,288 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:56,581 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:18:56,581 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:18:56,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:56,597 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:56,619 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 18:18:56,619 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:57,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 18:18:57,741 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:18:57,742 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:18:57,750 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-10-11 18:18:57,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 56 [2024-10-11 18:18:57,885 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 86 treesize of output 47 [2024-10-11 18:18:57,921 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-10-11 18:18:57,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-10-11 18:18:58,053 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2024-10-11 18:18:58,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 209 treesize of output 108 [2024-10-11 18:18:58,061 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 56 treesize of output 19 [2024-10-11 18:18:58,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-10-11 18:18:58,146 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 116 treesize of output 80 [2024-10-11 18:18:58,150 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 84 treesize of output 56 [2024-10-11 18:18:58,243 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:18:58,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2024-10-11 18:18:58,250 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:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:18:58,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:58,471 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_3374 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3374) .cse0) .cse1) 4))) (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3374 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3374) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3373) .cse0) .cse1)))))) is different from false [2024-10-11 18:18:58,491 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3374 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3374) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3373) .cse0) .cse1)))) (forall ((v_ArrVal_3374 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3374) .cse0) .cse1)))))) is different from false [2024-10-11 18:18:58,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:58,502 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 85 treesize of output 86 [2024-10-11 18:18:58,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:58,510 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 176 treesize of output 179 [2024-10-11 18:18:58,516 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 76 treesize of output 62 [2024-10-11 18:18:58,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:58,545 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 44 treesize of output 45 [2024-10-11 18:18:58,547 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:18:58,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:58,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30