./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_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:01:11,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:01:11,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:01:11,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:01:11,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:01:11,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:01:11,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:01:11,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:01:11,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:01:11,811 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:01:11,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:01:11,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:01:11,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:01:11,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:01:11,815 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:01:11,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:01:11,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:01:11,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:01:11,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:01:11,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:01:11,816 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:01:11,817 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:01:11,819 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:01:11,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:01:11,820 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:01:11,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:01:11,820 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:01:11,820 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:01:11,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:01:11,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:01:11,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:01:11,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:01:11,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:01:11,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:01:11,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:01:11,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:01:11,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:01:11,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:01:11,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:01:11,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:01:11,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:01:11,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:01:11,825 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2024-10-13 11:01:12,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:01:12,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:01:12,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:01:12,102 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:01:12,103 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:01:12,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2024-10-13 11:01:13,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:01:13,754 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:01:13,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2024-10-13 11:01:13,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e42400c7/377dc76bf6644da7b2952c99128813cb/FLAGe3125bd7c [2024-10-13 11:01:13,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e42400c7/377dc76bf6644da7b2952c99128813cb [2024-10-13 11:01:13,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:01:13,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:01:13,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:01:13,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:01:13,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:01:13,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:13" (1/1) ... [2024-10-13 11:01:13,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@598b28ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:13, skipping insertion in model container [2024-10-13 11:01:13,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:13" (1/1) ... [2024-10-13 11:01:13,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:01:14,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:01:14,184 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:01:14,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:01:14,272 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:01:14,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14 WrapperNode [2024-10-13 11:01:14,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:01:14,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:01:14,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:01:14,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:01:14,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14" (1/1) ... [2024-10-13 11:01:14,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14" (1/1) ... [2024-10-13 11:01:14,320 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 157 [2024-10-13 11:01:14,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:01:14,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:01:14,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:01:14,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:01:14,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14" (1/1) ... [2024-10-13 11:01:14,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14" (1/1) ... [2024-10-13 11:01:14,337 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14" (1/1) ... [2024-10-13 11:01:14,364 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 15, 10]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 7, 2]. [2024-10-13 11:01:14,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14" (1/1) ... [2024-10-13 11:01:14,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14" (1/1) ... [2024-10-13 11:01:14,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14" (1/1) ... [2024-10-13 11:01:14,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14" (1/1) ... [2024-10-13 11:01:14,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14" (1/1) ... [2024-10-13 11:01:14,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14" (1/1) ... [2024-10-13 11:01:14,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:01:14,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:01:14,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:01:14,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:01:14,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14" (1/1) ... [2024-10-13 11:01:14,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:01:14,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:14,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 11:01:14,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 11:01:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 11:01:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 11:01:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 11:01:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 11:01:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 11:01:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 11:01:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-13 11:01:14,480 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-13 11:01:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:01:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:01:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:01:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:01:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:01:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:01:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:01:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:01:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:01:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:01:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 11:01:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 11:01:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 11:01:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 11:01:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 11:01:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 11:01:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:01:14,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:01:14,637 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:01:14,640 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:01:15,086 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-10-13 11:01:15,087 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:01:15,143 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:01:15,143 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-13 11:01:15,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:15 BoogieIcfgContainer [2024-10-13 11:01:15,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:01:15,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:01:15,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:01:15,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:01:15,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:01:13" (1/3) ... [2024-10-13 11:01:15,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2234231c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:15, skipping insertion in model container [2024-10-13 11:01:15,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:14" (2/3) ... [2024-10-13 11:01:15,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2234231c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:15, skipping insertion in model container [2024-10-13 11:01:15,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:15" (3/3) ... [2024-10-13 11:01:15,154 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2024-10-13 11:01:15,170 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:01:15,170 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2024-10-13 11:01:15,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:01:15,230 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;@3a2b19a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:01:15,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-10-13 11:01:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 53 states have (on average 2.339622641509434) internal successors, (124), 109 states have internal predecessors, (124), 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-13 11:01:15,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 11:01:15,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:15,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 11:01:15,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:15,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash 243792851, now seen corresponding path program 1 times [2024-10-13 11:01:15,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:15,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067399005] [2024-10-13 11:01:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:15,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:15,472 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-13 11:01:15,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067399005] [2024-10-13 11:01:15,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067399005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:15,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:15,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:01:15,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266685066] [2024-10-13 11:01:15,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:15,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:01:15,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:15,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:01:15,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:01:15,517 INFO L87 Difference]: Start difference. First operand has 114 states, 53 states have (on average 2.339622641509434) internal successors, (124), 109 states have internal predecessors, (124), 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-13 11:01:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:15,657 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-10-13 11:01:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:01:15,660 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-13 11:01:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:15,674 INFO L225 Difference]: With dead ends: 111 [2024-10-13 11:01:15,674 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 11:01:15,676 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-13 11:01:15,680 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:15,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:15,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 11:01:15,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-13 11:01:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 51 states have (on average 2.196078431372549) internal successors, (112), 104 states have internal predecessors, (112), 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-13 11:01:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2024-10-13 11:01:15,713 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 5 [2024-10-13 11:01:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:15,714 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2024-10-13 11:01:15,714 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-13 11:01:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2024-10-13 11:01:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 11:01:15,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:15,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 11:01:15,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 11:01:15,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:15,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash 243792852, now seen corresponding path program 1 times [2024-10-13 11:01:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061180664] [2024-10-13 11:01:15,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:15,857 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-13 11:01:15,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:15,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061180664] [2024-10-13 11:01:15,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061180664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:15,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:15,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:01:15,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592613134] [2024-10-13 11:01:15,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:15,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:01:15,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:15,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:01:15,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:01:15,864 INFO L87 Difference]: Start difference. First operand 109 states and 118 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-13 11:01:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:15,976 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2024-10-13 11:01:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:01:15,977 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-13 11:01:15,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:15,979 INFO L225 Difference]: With dead ends: 107 [2024-10-13 11:01:15,979 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 11:01:15,980 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-13 11:01:15,981 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:15,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 167 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 11:01:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-13 11:01:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 51 states have (on average 2.156862745098039) internal successors, (110), 102 states have internal predecessors, (110), 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-13 11:01:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2024-10-13 11:01:16,001 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 5 [2024-10-13 11:01:16,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:16,001 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2024-10-13 11:01:16,001 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-13 11:01:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2024-10-13 11:01:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 11:01:16,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:16,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:16,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 11:01:16,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:16,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1313087724, now seen corresponding path program 1 times [2024-10-13 11:01:16,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:16,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011927756] [2024-10-13 11:01:16,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:16,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:16,136 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-13 11:01:16,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011927756] [2024-10-13 11:01:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011927756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:16,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:16,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:01:16,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066593539] [2024-10-13 11:01:16,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:16,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:01:16,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:16,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:01:16,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:01:16,163 INFO L87 Difference]: Start difference. First operand 107 states and 116 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-13 11:01:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:16,317 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2024-10-13 11:01:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:01:16,318 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-13 11:01:16,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:16,319 INFO L225 Difference]: With dead ends: 108 [2024-10-13 11:01:16,320 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 11:01:16,320 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-13 11:01:16,321 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:16,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 229 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:16,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 11:01:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-13 11:01:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 52 states have (on average 2.1346153846153846) internal successors, (111), 103 states have internal predecessors, (111), 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-13 11:01:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2024-10-13 11:01:16,331 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 10 [2024-10-13 11:01:16,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:16,335 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2024-10-13 11:01:16,335 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-13 11:01:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2024-10-13 11:01:16,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 11:01:16,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:16,336 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:16,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 11:01:16,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:16,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:16,337 INFO L85 PathProgramCache]: Analyzing trace with hash -333664348, now seen corresponding path program 1 times [2024-10-13 11:01:16,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:16,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635825776] [2024-10-13 11:01:16,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:16,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:16,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:16,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:16,560 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-13 11:01:16,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:16,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635825776] [2024-10-13 11:01:16,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635825776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:16,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:16,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:01:16,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023176726] [2024-10-13 11:01:16,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:16,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:01:16,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:16,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:01:16,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:01:16,566 INFO L87 Difference]: Start difference. First operand 108 states and 117 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-13 11:01:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:16,818 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2024-10-13 11:01:16,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:01:16,818 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-13 11:01:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:16,819 INFO L225 Difference]: With dead ends: 107 [2024-10-13 11:01:16,820 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 11:01:16,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:01:16,821 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:16,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 352 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:01:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 11:01:16,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-13 11:01:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 102 states have internal predecessors, (110), 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-13 11:01:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2024-10-13 11:01:16,836 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 17 [2024-10-13 11:01:16,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:16,836 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2024-10-13 11:01:16,836 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-13 11:01:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2024-10-13 11:01:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 11:01:16,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:16,837 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:16,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 11:01:16,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:16,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:16,838 INFO L85 PathProgramCache]: Analyzing trace with hash -333664347, now seen corresponding path program 1 times [2024-10-13 11:01:16,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:16,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137316009] [2024-10-13 11:01:16,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:16,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:17,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:17,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:17,150 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-13 11:01:17,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:17,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137316009] [2024-10-13 11:01:17,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137316009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:17,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:17,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:01:17,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928788814] [2024-10-13 11:01:17,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:17,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:01:17,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:17,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:01:17,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:01:17,154 INFO L87 Difference]: Start difference. First operand 107 states and 116 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-13 11:01:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:17,386 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2024-10-13 11:01:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:01:17,387 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-13 11:01:17,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:17,388 INFO L225 Difference]: With dead ends: 106 [2024-10-13 11:01:17,390 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 11:01:17,391 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-13 11:01:17,391 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:17,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:01:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 11:01:17,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-13 11:01:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 101 states have internal predecessors, (109), 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-13 11:01:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2024-10-13 11:01:17,403 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 17 [2024-10-13 11:01:17,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:17,403 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2024-10-13 11:01:17,403 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-13 11:01:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2024-10-13 11:01:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 11:01:17,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:17,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:17,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 11:01:17,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:17,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1471313830, now seen corresponding path program 1 times [2024-10-13 11:01:17,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:17,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85031953] [2024-10-13 11:01:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:17,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:17,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:17,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:17,777 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-13 11:01:17,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:17,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85031953] [2024-10-13 11:01:17,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85031953] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:17,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124844057] [2024-10-13 11:01:17,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:17,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:17,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:17,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:17,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 11:01:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:17,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 11:01:17,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:17,967 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-13 11:01:18,026 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-13 11:01:18,085 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-13 11:01:18,085 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 19 treesize of output 16 [2024-10-13 11:01:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-13 11:01:18,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:01:18,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124844057] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:18,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:01:18,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-10-13 11:01:18,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015605127] [2024-10-13 11:01:18,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:01:18,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 11:01:18,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:18,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 11:01:18,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-10-13 11:01:18,176 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 11:01:18,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:18,576 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2024-10-13 11:01:18,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:01:18,576 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-13 11:01:18,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:18,577 INFO L225 Difference]: With dead ends: 105 [2024-10-13 11:01:18,578 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 11:01:18,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-10-13 11:01:18,579 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:18,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 462 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 418 Invalid, 0 Unknown, 109 Unchecked, 0.3s Time] [2024-10-13 11:01:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 11:01:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 11:01:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 52 states have (on average 2.076923076923077) internal successors, (108), 100 states have internal predecessors, (108), 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-13 11:01:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2024-10-13 11:01:18,587 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 19 [2024-10-13 11:01:18,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:18,587 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2024-10-13 11:01:18,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 11:01:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2024-10-13 11:01:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 11:01:18,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:18,589 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:18,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 11:01:18,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 11:01:18,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:18,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1471313831, now seen corresponding path program 1 times [2024-10-13 11:01:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:18,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761750789] [2024-10-13 11:01:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:18,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:19,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:19,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:19,382 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-13 11:01:19,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:19,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761750789] [2024-10-13 11:01:19,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761750789] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:19,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473792948] [2024-10-13 11:01:19,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:19,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:19,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:19,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:19,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 11:01:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:19,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 11:01:19,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:19,529 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-13 11:01:19,534 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-13 11:01:19,650 WARN L873 $PredicateComparison]: unable to prove that (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-13 11:01:19,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:01:19,689 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-13 11:01:19,697 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:01:19,697 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-13 11:01:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-13 11:01:19,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:01:19,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473792948] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:19,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:01:19,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2024-10-13 11:01:19,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083496472] [2024-10-13 11:01:19,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:01:19,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 11:01:19,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:19,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 11:01:19,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2024-10-13 11:01:19,861 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 11:01:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:20,297 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2024-10-13 11:01:20,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 11:01:20,298 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-13 11:01:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:20,300 INFO L225 Difference]: With dead ends: 111 [2024-10-13 11:01:20,300 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 11:01:20,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=224, Unknown=1, NotChecked=30, Total=306 [2024-10-13 11:01:20,301 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:20,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 498 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 499 Invalid, 0 Unknown, 119 Unchecked, 0.4s Time] [2024-10-13 11:01:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 11:01:20,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-10-13 11:01:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 56 states have (on average 2.017857142857143) internal successors, (113), 104 states have internal predecessors, (113), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 11:01:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2024-10-13 11:01:20,307 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 19 [2024-10-13 11:01:20,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:20,308 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2024-10-13 11:01:20,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 11:01:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2024-10-13 11:01:20,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 11:01:20,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:20,309 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:20,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 11:01:20,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-13 11:01:20,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:20,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:20,515 INFO L85 PathProgramCache]: Analyzing trace with hash -776117589, now seen corresponding path program 1 times [2024-10-13 11:01:20,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:20,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424248045] [2024-10-13 11:01:20,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:20,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:20,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:20,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:20,969 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-13 11:01:20,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:20,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424248045] [2024-10-13 11:01:20,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424248045] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:20,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790242370] [2024-10-13 11:01:20,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:20,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:20,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:20,972 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:20,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 11:01:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:21,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 11:01:21,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:21,129 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-13 11:01:21,189 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 11:01:21,189 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-13 11:01:21,239 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-13 11:01:21,265 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-13 11:01:21,265 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 22 [2024-10-13 11:01:21,374 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 11:01:21,374 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-13 11:01:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2024-10-13 11:01:21,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:01:21,826 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-13 11:01:21,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790242370] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:01:21,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:01:21,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2024-10-13 11:01:21,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241404107] [2024-10-13 11:01:21,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:01:21,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 11:01:21,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:21,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 11:01:21,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=335, Unknown=1, NotChecked=38, Total=462 [2024-10-13 11:01:21,829 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 22 states, 17 states have (on average 2.823529411764706) internal successors, (48), 18 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-13 11:01:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:22,289 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2024-10-13 11:01:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:01:22,290 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.823529411764706) internal successors, (48), 18 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 27 [2024-10-13 11:01:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:22,291 INFO L225 Difference]: With dead ends: 118 [2024-10-13 11:01:22,291 INFO L226 Difference]: Without dead ends: 118 [2024-10-13 11:01:22,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=438, Unknown=1, NotChecked=44, Total=600 [2024-10-13 11:01:22,292 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 101 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:22,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 352 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 518 Invalid, 0 Unknown, 118 Unchecked, 0.4s Time] [2024-10-13 11:01:22,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-13 11:01:22,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2024-10-13 11:01:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 95 states have internal predecessors, (104), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 11:01:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2024-10-13 11:01:22,302 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 27 [2024-10-13 11:01:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:22,302 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2024-10-13 11:01:22,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.823529411764706) internal successors, (48), 18 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-13 11:01:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2024-10-13 11:01:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 11:01:22,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:22,303 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-13 11:01:22,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 11:01:22,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:22,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:22,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:22,509 INFO L85 PathProgramCache]: Analyzing trace with hash -776117588, now seen corresponding path program 1 times [2024-10-13 11:01:22,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:22,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017097775] [2024-10-13 11:01:22,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:22,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:22,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:22,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:22,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:22,996 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-13 11:01:22,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017097775] [2024-10-13 11:01:22,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017097775] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:22,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081617136] [2024-10-13 11:01:22,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:22,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:22,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:22,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:23,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 11:01:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:23,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 11:01:23,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:23,155 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-13 11:01:23,180 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-13 11:01:23,207 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-13 11:01:23,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:01:23,235 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-13 11:01:23,263 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-13 11:01:23,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:01:23,301 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-13 11:01:23,356 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-13 11:01:23,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:01:23,408 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-13 11:01:23,416 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-13 11:01:23,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:01:23,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081617136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:23,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:01:23,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-13 11:01:23,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659435235] [2024-10-13 11:01:23,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:23,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:01:23,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:23,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:01:23,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2024-10-13 11:01:23,418 INFO L87 Difference]: Start difference. First operand 101 states and 112 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-13 11:01:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:23,591 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2024-10-13 11:01:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:01:23,592 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-13 11:01:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:23,593 INFO L225 Difference]: With dead ends: 95 [2024-10-13 11:01:23,593 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 11:01:23,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=195, Unknown=1, NotChecked=28, Total=272 [2024-10-13 11:01:23,594 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 19 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:23,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 246 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 184 Invalid, 0 Unknown, 120 Unchecked, 0.1s Time] [2024-10-13 11:01:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 11:01:23,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-13 11:01:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.75) internal successors, (98), 89 states have internal predecessors, (98), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 11:01:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-10-13 11:01:23,605 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 27 [2024-10-13 11:01:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:23,606 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-10-13 11:01:23,606 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-13 11:01:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-10-13 11:01:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 11:01:23,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:23,609 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:23,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 11:01:23,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:23,810 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:23,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash -209099947, now seen corresponding path program 2 times [2024-10-13 11:01:23,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:23,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536715874] [2024-10-13 11:01:23,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:23,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:23,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:23,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:23,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 11:01:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 11:01:23,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:23,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536715874] [2024-10-13 11:01:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536715874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:23,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:23,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:01:23,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333324267] [2024-10-13 11:01:23,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:23,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:01:23,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:23,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:01:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:01:23,920 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-13 11:01:24,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:24,016 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2024-10-13 11:01:24,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:01:24,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 28 [2024-10-13 11:01:24,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:24,018 INFO L225 Difference]: With dead ends: 89 [2024-10-13 11:01:24,018 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 11:01:24,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-13 11:01:24,019 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:24,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:24,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 11:01:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 11:01:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.75) internal successors, (91), 84 states have internal predecessors, (91), 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-13 11:01:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2024-10-13 11:01:24,022 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 28 [2024-10-13 11:01:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:24,022 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2024-10-13 11:01:24,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-13 11:01:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2024-10-13 11:01:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 11:01:24,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:24,023 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-13 11:01:24,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 11:01:24,024 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:24,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:24,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1510133538, now seen corresponding path program 1 times [2024-10-13 11:01:24,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:24,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791864107] [2024-10-13 11:01:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:24,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:24,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:24,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:24,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:24,145 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-13 11:01:24,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:24,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791864107] [2024-10-13 11:01:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791864107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:24,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:24,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:01:24,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212418252] [2024-10-13 11:01:24,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:24,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:01:24,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:24,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:01:24,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:01:24,148 INFO L87 Difference]: Start difference. First operand 89 states and 97 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-13 11:01:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:24,324 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2024-10-13 11:01:24,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:01:24,325 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-13 11:01:24,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:24,325 INFO L225 Difference]: With dead ends: 87 [2024-10-13 11:01:24,325 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 11:01:24,326 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-13 11:01:24,326 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 17 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:24,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 276 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:01:24,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 11:01:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 11:01:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 82 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:01:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-10-13 11:01:24,330 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 30 [2024-10-13 11:01:24,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:24,330 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-10-13 11:01:24,330 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-13 11:01:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-10-13 11:01:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 11:01:24,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:24,334 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-13 11:01:24,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 11:01:24,335 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:24,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:24,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1510133537, now seen corresponding path program 1 times [2024-10-13 11:01:24,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:24,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020622800] [2024-10-13 11:01:24,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:24,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:24,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:24,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:24,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:24,552 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-13 11:01:24,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:24,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020622800] [2024-10-13 11:01:24,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020622800] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:24,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716960721] [2024-10-13 11:01:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:24,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:24,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:24,555 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:24,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 11:01:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:24,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 11:01:24,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:24,724 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-13 11:01:24,806 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-13 11:01:24,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:01:24,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716960721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:24,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:01:24,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-13 11:01:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114604698] [2024-10-13 11:01:24,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:24,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:01:24,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:24,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:01:24,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-13 11:01:24,809 INFO L87 Difference]: Start difference. First operand 87 states and 95 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-13 11:01:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:24,938 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-10-13 11:01:24,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:01:24,939 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-13 11:01:24,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:24,940 INFO L225 Difference]: With dead ends: 85 [2024-10-13 11:01:24,940 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 11:01:24,940 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-13 11:01:24,940 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 16 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:24,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 257 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:24,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 11:01:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-13 11:01:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 80 states have internal predecessors, (87), 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-13 11:01:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2024-10-13 11:01:24,944 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 30 [2024-10-13 11:01:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:24,944 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2024-10-13 11:01:24,944 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-13 11:01:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2024-10-13 11:01:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 11:01:24,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:24,945 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-13 11:01:24,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 11:01:25,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 11:01:25,150 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:25,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1510119916, now seen corresponding path program 1 times [2024-10-13 11:01:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955467249] [2024-10-13 11:01:25,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:25,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:25,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:25,472 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-13 11:01:25,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:25,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955467249] [2024-10-13 11:01:25,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955467249] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:25,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474727506] [2024-10-13 11:01:25,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:25,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:25,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:25,475 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:25,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 11:01:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:25,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 11:01:25,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:25,788 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-13 11:01:25,873 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-13 11:01:25,899 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-13 11:01:25,923 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-13 11:01:25,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-10-13 11:01:25,940 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-13 11:01:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-13 11:01:25,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:01:25,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474727506] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:25,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:01:25,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2024-10-13 11:01:25,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170932440] [2024-10-13 11:01:25,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:01:25,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 11:01:25,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:26,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 11:01:26,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=295, Unknown=1, NotChecked=34, Total=380 [2024-10-13 11:01:26,000 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 19 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 11:01:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:26,419 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2024-10-13 11:01:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 11:01:26,419 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2024-10-13 11:01:26,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:26,421 INFO L225 Difference]: With dead ends: 84 [2024-10-13 11:01:26,421 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 11:01:26,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=477, Unknown=1, NotChecked=44, Total=600 [2024-10-13 11:01:26,422 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 70 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:26,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 499 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 570 Invalid, 0 Unknown, 91 Unchecked, 0.3s Time] [2024-10-13 11:01:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 11:01:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 11:01:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 79 states have internal predecessors, (87), 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-13 11:01:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-10-13 11:01:26,427 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 30 [2024-10-13 11:01:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:26,429 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-10-13 11:01:26,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 11:01:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-10-13 11:01:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 11:01:26,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:26,430 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-13 11:01:26,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 11:01:26,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:26,631 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:26,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1510119915, now seen corresponding path program 1 times [2024-10-13 11:01:26,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:26,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738847982] [2024-10-13 11:01:26,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:26,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:26,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:26,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:27,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:27,114 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-13 11:01:27,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:27,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738847982] [2024-10-13 11:01:27,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738847982] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:27,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223092117] [2024-10-13 11:01:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:27,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:27,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:27,117 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:27,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 11:01:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:27,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-13 11:01:27,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:27,357 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-13 11:01:27,561 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-13 11:01:27,565 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-13 11:01:27,605 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) 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-13 11:01:27,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:01:27,640 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-13 11:01:27,650 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-13 11:01:27,650 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-13 11:01:27,711 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-13 11:01:27,729 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-13 11:01:27,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:01:27,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223092117] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:27,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:01:27,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2024-10-13 11:01:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978678869] [2024-10-13 11:01:27,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:01:27,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 11:01:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:27,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 11:01:27,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=631, Unknown=1, NotChecked=50, Total=756 [2024-10-13 11:01:27,893 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 25 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 21 states have internal predecessors, (45), 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-13 11:01:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:28,771 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2024-10-13 11:01:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 11:01:28,771 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 21 states have internal predecessors, (45), 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-13 11:01:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:28,772 INFO L225 Difference]: With dead ends: 96 [2024-10-13 11:01:28,772 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 11:01:28,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=1332, Unknown=1, NotChecked=74, Total=1560 [2024-10-13 11:01:28,773 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 102 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:28,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 791 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 989 Invalid, 0 Unknown, 100 Unchecked, 0.6s Time] [2024-10-13 11:01:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 11:01:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-13 11:01:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 64 states have (on average 1.53125) internal successors, (98), 90 states have internal predecessors, (98), 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-13 11:01:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2024-10-13 11:01:28,777 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 30 [2024-10-13 11:01:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:28,777 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2024-10-13 11:01:28,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 21 states have internal predecessors, (45), 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-13 11:01:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2024-10-13 11:01:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 11:01:28,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:28,778 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-13 11:01:28,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 11:01:28,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:28,982 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:28,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash 460617824, now seen corresponding path program 1 times [2024-10-13 11:01:28,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:28,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541414435] [2024-10-13 11:01:28,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:28,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:29,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:29,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:29,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:29,258 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-13 11:01:29,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:29,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541414435] [2024-10-13 11:01:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541414435] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:29,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447737728] [2024-10-13 11:01:29,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:29,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:29,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:29,261 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:29,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 11:01:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:29,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 11:01:29,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:29,442 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-13 11:01:29,468 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-13 11:01:29,486 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-13 11:01:29,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:01:29,511 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-13 11:01:29,535 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-13 11:01:29,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:01:29,564 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-13 11:01:29,598 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-13 11:01:29,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:01:29,620 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-13 11:01:29,647 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-13 11:01:29,648 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:01:29,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447737728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:29,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:01:29,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 14 [2024-10-13 11:01:29,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047937653] [2024-10-13 11:01:29,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:29,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:01:29,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:29,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:01:29,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2024-10-13 11:01:29,649 INFO L87 Difference]: Start difference. First operand 96 states and 104 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-13 11:01:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:29,703 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-10-13 11:01:29,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:01:29,704 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-13 11:01:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:29,704 INFO L225 Difference]: With dead ends: 93 [2024-10-13 11:01:29,704 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 11:01:29,705 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-13 11:01:29,705 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 40 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:29,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 139 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 102 Unchecked, 0.1s Time] [2024-10-13 11:01:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 11:01:29,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 11:01:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.484375) internal successors, (95), 87 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-13 11:01:29,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2024-10-13 11:01:29,708 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 32 [2024-10-13 11:01:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:29,709 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2024-10-13 11:01:29,709 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-13 11:01:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2024-10-13 11:01:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:01:29,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:29,710 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-13 11:01:29,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-13 11:01:29,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 11:01:29,911 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:29,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1394255026, now seen corresponding path program 1 times [2024-10-13 11:01:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:29,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765683630] [2024-10-13 11:01:29,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:29,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:30,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:30,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:30,127 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-13 11:01:30,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:30,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765683630] [2024-10-13 11:01:30,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765683630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:30,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:30,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 11:01:30,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828601426] [2024-10-13 11:01:30,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:30,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:01:30,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:30,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:01:30,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:01:30,129 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 10 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-13 11:01:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:30,323 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2024-10-13 11:01:30,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:01:30,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-13 11:01:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:30,324 INFO L225 Difference]: With dead ends: 94 [2024-10-13 11:01:30,324 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 11:01:30,324 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-13 11:01:30,325 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 48 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:30,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 310 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:01:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 11:01:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-10-13 11:01:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.4375) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:01:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2024-10-13 11:01:30,329 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 33 [2024-10-13 11:01:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:30,330 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2024-10-13 11:01:30,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-13 11:01:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2024-10-13 11:01:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:01:30,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:30,331 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-13 11:01:30,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 11:01:30,331 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:30,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1394255027, now seen corresponding path program 1 times [2024-10-13 11:01:30,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:30,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062228541] [2024-10-13 11:01:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:30,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:30,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:30,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:30,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:30,566 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-13 11:01:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:30,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062228541] [2024-10-13 11:01:30,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062228541] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:30,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564947661] [2024-10-13 11:01:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:30,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:30,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:30,569 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:30,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 11:01:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:30,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 11:01:30,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:30,788 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-13 11:01:30,899 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-13 11:01:30,905 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-13 11:01:30,935 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-13 11:01:30,955 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-13 11:01:30,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:01:30,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564947661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:30,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:01:30,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2024-10-13 11:01:30,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338100971] [2024-10-13 11:01:30,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:30,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 11:01:30,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:30,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 11:01:30,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-10-13 11:01:30,957 INFO L87 Difference]: Start difference. First operand 90 states and 98 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-13 11:01:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:31,106 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2024-10-13 11:01:31,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 11:01:31,107 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-13 11:01:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:31,107 INFO L225 Difference]: With dead ends: 92 [2024-10-13 11:01:31,107 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 11:01:31,108 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-13 11:01:31,108 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:31,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 298 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:31,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 11:01:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-10-13 11:01:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.40625) internal successors, (90), 82 states have internal predecessors, (90), 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-13 11:01:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-10-13 11:01:31,112 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 33 [2024-10-13 11:01:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:31,112 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-10-13 11:01:31,112 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-13 11:01:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-10-13 11:01:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 11:01:31,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:31,113 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-13 11:01:31,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 11:01:31,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 11:01:31,314 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:31,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash -33513354, now seen corresponding path program 1 times [2024-10-13 11:01:31,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:31,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086825310] [2024-10-13 11:01:31,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:31,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:31,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:31,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:32,062 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-13 11:01:32,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:32,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086825310] [2024-10-13 11:01:32,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086825310] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:32,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804551788] [2024-10-13 11:01:32,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:32,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:32,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:32,065 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:32,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 11:01:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:32,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-13 11:01:32,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:32,451 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-13 11:01:32,584 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:01:32,585 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-13 11:01:32,657 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-13 11:01:32,731 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-13 11:01:32,732 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-13 11:01:32,771 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-13 11:01:32,774 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-13 11:01:32,904 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_53| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_53| 1)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_53| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_53|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_53|) 0))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (<= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) 0) 0))) is different from true [2024-10-13 11:01:32,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:01:32,915 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-13 11:01:32,941 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2024-10-13 11:01:32,941 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-13 11:01:33,079 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-13 11:01:33,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:01:33,226 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 22 treesize of output 18 [2024-10-13 11:01:33,308 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-13 11:01:33,354 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-13 11:01:33,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:01:33,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804551788] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:33,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:01:33,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2024-10-13 11:01:33,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779521812] [2024-10-13 11:01:33,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:01:33,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-13 11:01:33,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:33,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-13 11:01:33,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1506, Unknown=1, NotChecked=78, Total=1722 [2024-10-13 11:01:33,534 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 39 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 32 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-13 11:01:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:34,621 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-10-13 11:01:34,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 11:01:34,622 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 32 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-13 11:01:34,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:34,623 INFO L225 Difference]: With dead ends: 89 [2024-10-13 11:01:34,623 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 11:01:34,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=293, Invalid=2902, Unknown=1, NotChecked=110, Total=3306 [2024-10-13 11:01:34,624 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 154 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:34,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 894 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1070 Invalid, 0 Unknown, 95 Unchecked, 0.6s Time] [2024-10-13 11:01:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 11:01:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 11:01:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:01:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-10-13 11:01:34,632 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 34 [2024-10-13 11:01:34,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:34,632 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-10-13 11:01:34,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 32 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-13 11:01:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-10-13 11:01:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 11:01:34,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:34,633 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-13 11:01:34,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 11:01:34,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 11:01:34,833 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:34,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash -33513353, now seen corresponding path program 1 times [2024-10-13 11:01:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983845061] [2024-10-13 11:01:34,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:34,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:35,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:35,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:36,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:36,355 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-13 11:01:36,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:36,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983845061] [2024-10-13 11:01:36,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983845061] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:36,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331573831] [2024-10-13 11:01:36,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:36,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:36,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:36,357 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:36,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 11:01:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:36,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-10-13 11:01:36,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:36,725 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-13 11:01:36,730 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-13 11:01:36,986 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:01:36,986 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-13 11:01:36,996 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-13 11:01:37,086 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-13 11:01:37,094 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-13 11:01:37,188 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-13 11:01:37,189 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-13 11:01:37,196 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-13 11:01:37,267 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-13 11:01:37,271 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-13 11:01:37,275 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-13 11:01:37,284 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-13 11:01:37,505 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#res#1.base| Int)) (and (= (select |c_old(#valid)| |node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_#res#1.base|))) (= (store |c_old(#length)| |node_create_#res#1.base| (select |c_#length| |node_create_#res#1.base|)) |c_#length|))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8|) 0) 0))) is different from true [2024-10-13 11:01:37,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:01:37,521 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-13 11:01:37,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:01:37,527 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-13 11:01:37,551 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-13 11:01:37,552 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-13 11:01:37,557 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-13 11:01:37,651 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-13 11:01:37,780 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-13 11:01:37,783 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-13 11:01:37,829 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-13 11:01:37,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:01:38,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331573831] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:38,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:01:38,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2024-10-13 11:01:38,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536267773] [2024-10-13 11:01:38,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:01:38,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-13 11:01:38,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:38,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-13 11:01:38,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1938, Unknown=1, NotChecked=88, Total=2162 [2024-10-13 11:01:38,192 INFO L87 Difference]: Start difference. First operand 89 states and 98 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-13 11:01:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:40,161 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2024-10-13 11:01:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 11:01:40,162 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-13 11:01:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:40,163 INFO L225 Difference]: With dead ends: 96 [2024-10-13 11:01:40,163 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 11:01:40,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=302, Invalid=3861, Unknown=1, NotChecked=126, Total=4290 [2024-10-13 11:01:40,165 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 128 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:40,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1093 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1704 Invalid, 0 Unknown, 102 Unchecked, 1.0s Time] [2024-10-13 11:01:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 11:01:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-10-13 11:01:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 86 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-13 11:01:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-10-13 11:01:40,172 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 34 [2024-10-13 11:01:40,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:40,172 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-10-13 11:01:40,173 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-13 11:01:40,173 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-10-13 11:01:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 11:01:40,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:40,175 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:40,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-13 11:01:40,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:40,375 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:40,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash -377168736, now seen corresponding path program 1 times [2024-10-13 11:01:40,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:40,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991280071] [2024-10-13 11:01:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:40,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:40,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:40,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:40,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:40,714 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-13 11:01:40,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:40,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991280071] [2024-10-13 11:01:40,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991280071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:40,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:40,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 11:01:40,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120898475] [2024-10-13 11:01:40,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:40,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 11:01:40,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:40,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 11:01:40,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-13 11:01:40,717 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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-13 11:01:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:40,976 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2024-10-13 11:01:40,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 11:01:40,976 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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 36 [2024-10-13 11:01:40,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:40,977 INFO L225 Difference]: With dead ends: 124 [2024-10-13 11:01:40,977 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 11:01:40,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-13 11:01:40,978 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 64 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:40,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 428 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:01:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 11:01:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 98. [2024-10-13 11:01:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 92 states have internal predecessors, (103), 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-13 11:01:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2024-10-13 11:01:40,981 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 36 [2024-10-13 11:01:40,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:40,982 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2024-10-13 11:01:40,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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-13 11:01:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2024-10-13 11:01:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 11:01:40,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:40,982 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:40,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 11:01:40,983 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:40,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash -377168735, now seen corresponding path program 1 times [2024-10-13 11:01:40,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:40,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965016295] [2024-10-13 11:01:40,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:40,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:41,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:41,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:41,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:41,210 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-13 11:01:41,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:41,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965016295] [2024-10-13 11:01:41,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965016295] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:41,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943773106] [2024-10-13 11:01:41,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:41,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:41,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:41,213 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:41,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-13 11:01:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:41,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 11:01:41,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:41,443 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-13 11:01:41,533 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-13 11:01:41,540 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-13 11:01:41,572 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 23 treesize of output 15 [2024-10-13 11:01:41,582 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 19 treesize of output 11 [2024-10-13 11:01:41,617 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 23 [2024-10-13 11:01:41,657 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 15 treesize of output 7 [2024-10-13 11:01:41,661 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-13 11:01:41,683 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-13 11:01:41,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:01:41,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943773106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:41,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:01:41,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2024-10-13 11:01:41,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463792336] [2024-10-13 11:01:41,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:41,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 11:01:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 11:01:41,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2024-10-13 11:01:41,685 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 11 states, 8 states have (on average 3.25) internal successors, (26), 10 states have internal predecessors, (26), 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-13 11:01:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:41,850 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2024-10-13 11:01:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:01:41,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.25) internal successors, (26), 10 states have internal predecessors, (26), 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 36 [2024-10-13 11:01:41,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:41,851 INFO L225 Difference]: With dead ends: 114 [2024-10-13 11:01:41,851 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 11:01:41,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2024-10-13 11:01:41,852 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 52 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:41,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 345 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 11:01:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2024-10-13 11:01:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 97 states have internal predecessors, (110), 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-13 11:01:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-10-13 11:01:41,855 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 36 [2024-10-13 11:01:41,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:41,856 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-10-13 11:01:41,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.25) internal successors, (26), 10 states have internal predecessors, (26), 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-13 11:01:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-10-13 11:01:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 11:01:41,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:41,857 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-13 11:01:41,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-13 11:01:42,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-13 11:01:42,057 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:42,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:42,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1192574661, now seen corresponding path program 1 times [2024-10-13 11:01:42,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:42,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34725651] [2024-10-13 11:01:42,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:42,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:42,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:42,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:42,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:42,269 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-13 11:01:42,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:42,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34725651] [2024-10-13 11:01:42,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34725651] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:42,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621749462] [2024-10-13 11:01:42,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:42,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:42,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:42,272 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:42,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-13 11:01:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:42,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-13 11:01:42,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:42,515 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-13 11:01:42,594 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-13 11:01:42,600 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-13 11:01:42,627 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 0 case distinctions, treesize of input 53 treesize of output 21 [2024-10-13 11:01:42,655 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-13 11:01:42,658 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-13 11:01:42,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-13 11:01:42,699 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-13 11:01:42,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:01:42,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621749462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:42,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:01:42,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-10-13 11:01:42,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221492575] [2024-10-13 11:01:42,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:42,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 11:01:42,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:42,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 11:01:42,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2024-10-13 11:01:42,701 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 10 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-13 11:01:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:42,913 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2024-10-13 11:01:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 11:01:42,913 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 10 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 37 [2024-10-13 11:01:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:42,914 INFO L225 Difference]: With dead ends: 103 [2024-10-13 11:01:42,914 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 11:01:42,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2024-10-13 11:01:42,915 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:42,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 454 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:01:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 11:01:42,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-13 11:01:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.379746835443038) internal successors, (109), 97 states have internal predecessors, (109), 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-13 11:01:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2024-10-13 11:01:42,918 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 37 [2024-10-13 11:01:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:42,918 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2024-10-13 11:01:42,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 10 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-13 11:01:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2024-10-13 11:01:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 11:01:42,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:42,919 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-13 11:01:42,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-13 11:01:43,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-13 11:01:43,120 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:43,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash -751052328, now seen corresponding path program 2 times [2024-10-13 11:01:43,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:43,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333229559] [2024-10-13 11:01:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:43,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:43,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:43,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:44,064 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-13 11:01:44,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:44,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333229559] [2024-10-13 11:01:44,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333229559] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:44,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023932428] [2024-10-13 11:01:44,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:01:44,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:44,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:44,067 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:44,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-13 11:01:44,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:01:44,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:01:44,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-10-13 11:01:44,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:44,311 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-13 11:01:44,539 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 11:01:44,540 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-13 11:01:44,660 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-13 11:01:44,671 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-13 11:01:44,745 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-13 11:01:44,745 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-13 11:01:44,757 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-13 11:01:44,820 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-13 11:01:44,820 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-13 11:01:44,824 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-13 11:01:44,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-13 11:01:45,043 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_11|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_71| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_71|) 0) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_71| 1)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_71| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_71|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_71| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_71|)))))) is different from true [2024-10-13 11:01:45,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:01:45,067 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-13 11:01:45,067 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-13 11:01:45,092 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2024-10-13 11:01:45,093 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-13 11:01:45,098 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-13 11:01:45,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 56 [2024-10-13 11:01:45,449 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-13 11:01:45,603 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 11:01:45,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2024-10-13 11:01:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 11:01:45,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:01:45,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023932428] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:45,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:01:45,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2024-10-13 11:01:45,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250200535] [2024-10-13 11:01:45,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:01:45,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-13 11:01:45,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:45,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-13 11:01:45,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2090, Unknown=1, NotChecked=92, Total=2352 [2024-10-13 11:01:45,994 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 43 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 36 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-13 11:01:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:47,288 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2024-10-13 11:01:47,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 11:01:47,289 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 36 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-13 11:01:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:47,289 INFO L225 Difference]: With dead ends: 92 [2024-10-13 11:01:47,289 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 11:01:47,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=349, Invalid=3436, Unknown=1, NotChecked=120, Total=3906 [2024-10-13 11:01:47,291 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 107 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:47,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 854 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 961 Invalid, 0 Unknown, 87 Unchecked, 0.5s Time] [2024-10-13 11:01:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 11:01:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-10-13 11:01:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 84 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-13 11:01:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2024-10-13 11:01:47,295 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 38 [2024-10-13 11:01:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:47,295 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2024-10-13 11:01:47,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 36 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-13 11:01:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2024-10-13 11:01:47,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 11:01:47,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:47,296 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:47,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-13 11:01:47,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:47,497 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:01:47,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1397972668, now seen corresponding path program 1 times [2024-10-13 11:01:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:47,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069979540] [2024-10-13 11:01:47,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:47,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:47,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:47,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:47,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:01:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:47,706 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-13 11:01:47,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:47,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069979540] [2024-10-13 11:01:47,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069979540] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:47,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525342191] [2024-10-13 11:01:47,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:47,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:47,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:47,707 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:47,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-13 11:01:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:47,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 11:01:47,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:47,975 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-13 11:01:47,988 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-13 11:01:47,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:01:48,015 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-13 11:01:48,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525342191] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:01:48,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:01:48,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-10-13 11:01:48,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143047747] [2024-10-13 11:01:48,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:01:48,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 11:01:48,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:48,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 11:01:48,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-13 11:01:48,016 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 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-13 11:01:52,024 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-13 11:01:56,034 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-13 11:02:00,048 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-13 11:02:04,056 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-13 11:02:08,082 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-13 11:02:12,187 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-13 11:02:16,195 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-13 11:02:16,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:16,255 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-10-13 11:02:16,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 11:02:16,255 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 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 40 [2024-10-13 11:02:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:16,256 INFO L225 Difference]: With dead ends: 77 [2024-10-13 11:02:16,256 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 11:02:16,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-10-13 11:02:16,257 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 10 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:16,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 575 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 317 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2024-10-13 11:02:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 11:02:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 11:02:16,259 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-13 11:02:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2024-10-13 11:02:16,260 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 40 [2024-10-13 11:02:16,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:16,260 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2024-10-13 11:02:16,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 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-13 11:02:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2024-10-13 11:02:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 11:02:16,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:16,261 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:16,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-13 11:02:16,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:16,462 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:02:16,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2024189148, now seen corresponding path program 1 times [2024-10-13 11:02:16,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:16,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493164513] [2024-10-13 11:02:16,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:16,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:17,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:17,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:17,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:02:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:17,177 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-13 11:02:17,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:17,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493164513] [2024-10-13 11:02:17,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493164513] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:17,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094956720] [2024-10-13 11:02:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:17,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:17,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:17,180 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:17,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-13 11:02:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:17,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-13 11:02:17,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:17,441 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-13 11:02:17,467 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-13 11:02:17,467 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-13 11:02:17,597 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-13 11:02:17,665 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-13 11:02:17,671 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 42 treesize of output 19 [2024-10-13 11:02:17,711 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-13 11:02:17,711 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-13 11:02:17,758 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 45 treesize of output 29 [2024-10-13 11:02:17,761 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 33 treesize of output 21 [2024-10-13 11:02:17,801 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-13 11:02:17,803 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-13 11:02:17,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:02:17,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094956720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:17,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:02:17,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [20] total 26 [2024-10-13 11:02:17,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474060297] [2024-10-13 11:02:17,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:17,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 11:02:17,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:17,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 11:02:17,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2024-10-13 11:02:17,805 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 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-13 11:02:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:18,106 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2024-10-13 11:02:18,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 11:02:18,106 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 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 42 [2024-10-13 11:02:18,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:18,107 INFO L225 Difference]: With dead ends: 113 [2024-10-13 11:02:18,107 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 11:02:18,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2024-10-13 11:02:18,108 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 66 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:18,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 445 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:02:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 11:02:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 87. [2024-10-13 11:02:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.328358208955224) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:02:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-10-13 11:02:18,111 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 42 [2024-10-13 11:02:18,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:18,112 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-10-13 11:02:18,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 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-13 11:02:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-10-13 11:02:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 11:02:18,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:18,113 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:18,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-13 11:02:18,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-13 11:02:18,313 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:02:18,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:18,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2024189147, now seen corresponding path program 1 times [2024-10-13 11:02:18,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:18,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637152128] [2024-10-13 11:02:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:18,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:19,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:19,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:02:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:19,414 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-13 11:02:19,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:19,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637152128] [2024-10-13 11:02:19,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637152128] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:19,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266878235] [2024-10-13 11:02:19,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:19,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:19,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:19,417 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:19,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-13 11:02:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:19,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-13 11:02:19,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:19,687 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-13 11:02:19,871 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 11:02:19,871 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-13 11:02:19,948 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-13 11:02:19,997 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-13 11:02:19,998 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-13 11:02:20,050 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-13 11:02:20,055 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-13 11:02:20,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:20,190 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-13 11:02:20,202 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-13 11:02:20,202 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-13 11:02:20,316 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2024-10-13 11:02:20,367 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:02:20,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:20,369 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 40 treesize of output 19 [2024-10-13 11:02:20,475 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-13 11:02:20,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:20,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266878235] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:20,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:02:20,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2024-10-13 11:02:20,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110316982] [2024-10-13 11:02:20,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:20,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-13 11:02:20,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:20,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-13 11:02:20,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1959, Unknown=0, NotChecked=0, Total=2070 [2024-10-13 11:02:20,695 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 41 states, 34 states have (on average 2.088235294117647) internal successors, (71), 33 states have internal predecessors, (71), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 11:02:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:21,702 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2024-10-13 11:02:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 11:02:21,702 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 2.088235294117647) internal successors, (71), 33 states have internal predecessors, (71), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2024-10-13 11:02:21,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:21,703 INFO L225 Difference]: With dead ends: 77 [2024-10-13 11:02:21,703 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 11:02:21,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=222, Invalid=3084, Unknown=0, NotChecked=0, Total=3306 [2024-10-13 11:02:21,704 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 46 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:21,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1155 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:02:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 11:02:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 11:02:21,706 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-13 11:02:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-10-13 11:02:21,707 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 42 [2024-10-13 11:02:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:21,707 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-10-13 11:02:21,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 2.088235294117647) internal successors, (71), 33 states have internal predecessors, (71), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 11:02:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-10-13 11:02:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 11:02:21,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:21,708 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] [2024-10-13 11:02:21,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-13 11:02:21,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-13 11:02:21,909 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-13 11:02:21,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash -260175226, now seen corresponding path program 1 times [2024-10-13 11:02:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:21,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275217604] [2024-10-13 11:02:21,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:23,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 11:02:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 11:02:23,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:23,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275217604] [2024-10-13 11:02:23,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275217604] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:23,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590127133] [2024-10-13 11:02:23,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:23,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:23,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:23,353 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:23,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-13 11:02:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:23,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-10-13 11:02:23,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:23,609 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-13 11:02:23,804 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 11:02:23,804 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-13 11:02:23,887 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-13 11:02:23,941 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-13 11:02:23,941 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-13 11:02:23,990 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-13 11:02:23,993 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-13 11:02:24,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:24,134 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-13 11:02:24,146 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-13 11:02:24,146 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-13 11:02:24,624 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:02:24,629 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-10-13 11:02:24,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 57 [2024-10-13 11:02:24,739 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 0 case distinctions, treesize of input 111 treesize of output 68 [2024-10-13 11:02:24,743 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 0 case distinctions, treesize of input 103 treesize of output 76 [2024-10-13 11:02:24,830 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-10-13 11:02:24,831 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 85 [2024-10-13 11:02:24,924 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 101 treesize of output 69 [2024-10-13 11:02:24,926 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 73 treesize of output 49 [2024-10-13 11:02:25,001 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-13 11:02:25,002 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-13 11:02:25,005 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-13 11:02:25,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:25,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3621 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3621) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-10-13 11:02:25,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3621 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3621) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.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$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.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|))) 1)) is different from false [2024-10-13 11:02:26,001 INFO L349 Elim1Store]: treesize reduction 5, result has 90.9 percent of original size [2024-10-13 11:02:26,001 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 59 treesize of output 58 [2024-10-13 11:02:26,483 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_3621 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_40| Int) (v_ArrVal_3625 (Array Int Int))) (or (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_40| (store v_ArrVal_3625 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse0)) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_40| v_ArrVal_3625) .cse0) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3621) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_40|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |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|))) .cse0))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_40|) 0)))) is different from false [2024-10-13 11:02:26,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590127133] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:26,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:02:26,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2024-10-13 11:02:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925614434] [2024-10-13 11:02:26,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:26,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-13 11:02:26,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:26,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-13 11:02:26,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3255, Unknown=110, NotChecked=354, Total=3906 [2024-10-13 11:02:26,487 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 54 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 45 states have internal predecessors, (78), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 11:02:33,398 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]