./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_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:17:14,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:17:14,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:17:14,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:17:14,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:17:14,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:17:14,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:17:14,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:17:14,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:17:14,710 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:17:14,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:17:14,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:17:14,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:17:14,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:17:14,711 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:17:14,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:17:14,712 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:17:14,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:17:14,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:17:14,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:17:14,712 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:17:14,717 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:17:14,717 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:17:14,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:17:14,717 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:17:14,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:17:14,717 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:17:14,717 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:17:14,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:17:14,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:17:14,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:17:14,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:17:14,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:17:14,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:17:14,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:17:14,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:17:14,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:17:14,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:17:14,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:17:14,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:17:14,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:17:14,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:17:14,721 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2024-10-11 18:17:14,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:17:15,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:17:15,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:17:15,012 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:17:15,012 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:17:15,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-10-11 18:17:16,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:17:16,613 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:17:16,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-10-11 18:17:16,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3283bb703/c85dfec00b7c4a009ce894656f12c801/FLAGb45a8f6ec [2024-10-11 18:17:16,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3283bb703/c85dfec00b7c4a009ce894656f12c801 [2024-10-11 18:17:16,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:17:16,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:17:16,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:17:16,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:17:16,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:17:16,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:17:16" (1/1) ... [2024-10-11 18:17:16,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e48764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:16, skipping insertion in model container [2024-10-11 18:17:16,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:17:16" (1/1) ... [2024-10-11 18:17:16,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:17:17,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:17:17,254 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:17:17,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:17:17,330 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:17:17,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17 WrapperNode [2024-10-11 18:17:17,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:17:17,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:17:17,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:17:17,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:17:17,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17" (1/1) ... [2024-10-11 18:17:17,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17" (1/1) ... [2024-10-11 18:17:17,377 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 169 [2024-10-11 18:17:17,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:17:17,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:17:17,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:17:17,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:17:17,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17" (1/1) ... [2024-10-11 18:17:17,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17" (1/1) ... [2024-10-11 18:17:17,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17" (1/1) ... [2024-10-11 18:17:17,409 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 16, 10]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2024-10-11 18:17:17,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17" (1/1) ... [2024-10-11 18:17:17,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17" (1/1) ... [2024-10-11 18:17:17,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17" (1/1) ... [2024-10-11 18:17:17,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17" (1/1) ... [2024-10-11 18:17:17,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17" (1/1) ... [2024-10-11 18:17:17,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17" (1/1) ... [2024-10-11 18:17:17,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:17:17,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:17:17,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:17:17,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:17:17,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17" (1/1) ... [2024-10-11 18:17:17,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:17:17,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:17,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:17:17,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:17:17,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:17:17,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:17:17,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 18:17:17,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:17:17,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:17:17,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 18:17:17,528 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 18:17:17,528 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 18:17:17,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:17:17,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:17:17,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:17:17,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:17:17,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:17:17,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 18:17:17,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:17:17,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:17:17,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:17:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:17:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:17:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:17:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:17:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:17:17,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:17:17,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 18:17:17,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:17:17,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:17:17,711 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:17:17,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:17:18,109 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-11 18:17:18,110 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:17:18,168 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:17:18,169 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 18:17:18,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:17:18 BoogieIcfgContainer [2024-10-11 18:17:18,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:17:18,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:17:18,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:17:18,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:17:18,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:17:16" (1/3) ... [2024-10-11 18:17:18,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66746a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:17:18, skipping insertion in model container [2024-10-11 18:17:18,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:17" (2/3) ... [2024-10-11 18:17:18,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66746a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:17:18, skipping insertion in model container [2024-10-11 18:17:18,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:17:18" (3/3) ... [2024-10-11 18:17:18,178 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2024-10-11 18:17:18,193 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:17:18,194 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-10-11 18:17:18,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:17:18,246 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;@3934d8a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:17:18,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-10-11 18:17:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 55 states have (on average 2.3636363636363638) internal successors, (130), 113 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:17:18,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:18,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:17:18,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:18,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:18,265 INFO L85 PathProgramCache]: Analyzing trace with hash 256229600, now seen corresponding path program 1 times [2024-10-11 18:17:18,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:18,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896246538] [2024-10-11 18:17:18,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:18,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:17:18,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896246538] [2024-10-11 18:17:18,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896246538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:18,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:18,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:17:18,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999111255] [2024-10-11 18:17:18,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:18,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:17:18,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:18,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:17:18,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:18,519 INFO L87 Difference]: Start difference. First operand has 118 states, 55 states have (on average 2.3636363636363638) internal successors, (130), 113 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:17:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:18,671 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2024-10-11 18:17:18,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:17:18,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:17:18,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:18,683 INFO L225 Difference]: With dead ends: 115 [2024-10-11 18:17:18,683 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 18:17:18,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:18,691 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:18,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 171 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:18,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 18:17:18,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 18:17:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 53 states have (on average 2.207547169811321) internal successors, (117), 108 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2024-10-11 18:17:18,738 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 5 [2024-10-11 18:17:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:18,738 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2024-10-11 18:17:18,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:17:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2024-10-11 18:17:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:17:18,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:18,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:17:18,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:17:18,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:18,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:18,742 INFO L85 PathProgramCache]: Analyzing trace with hash 256229601, now seen corresponding path program 1 times [2024-10-11 18:17:18,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:18,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407332962] [2024-10-11 18:17:18,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:18,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:17:18,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:18,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407332962] [2024-10-11 18:17:18,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407332962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:18,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:18,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:17:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036429901] [2024-10-11 18:17:18,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:18,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:17:18,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:18,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:17:18,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:18,846 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:17:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:18,932 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-10-11 18:17:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:17:18,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:17:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:18,934 INFO L225 Difference]: With dead ends: 111 [2024-10-11 18:17:18,934 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 18:17:18,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:18,935 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:18,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 175 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:18,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 18:17:18,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 18:17:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 53 states have (on average 2.169811320754717) internal successors, (115), 106 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2024-10-11 18:17:18,950 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 5 [2024-10-11 18:17:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:18,950 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-10-11 18:17:18,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:17:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2024-10-11 18:17:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:17:18,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:18,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:18,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:17:18,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:18,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:18,952 INFO L85 PathProgramCache]: Analyzing trace with hash -523509657, now seen corresponding path program 1 times [2024-10-11 18:17:18,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:18,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359347452] [2024-10-11 18:17:18,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:18,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:19,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:17:19,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:19,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359347452] [2024-10-11 18:17:19,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359347452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:19,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:19,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:17:19,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538799546] [2024-10-11 18:17:19,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:19,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:17:19,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:19,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:17:19,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:17:19,068 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:17:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:19,230 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-10-11 18:17:19,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:17:19,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-11 18:17:19,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:19,233 INFO L225 Difference]: With dead ends: 112 [2024-10-11 18:17:19,234 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 18:17:19,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:17:19,235 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:19,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 241 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 18:17:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 18:17:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 54 states have (on average 2.1481481481481484) internal successors, (116), 107 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2024-10-11 18:17:19,246 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 10 [2024-10-11 18:17:19,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:19,248 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2024-10-11 18:17:19,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:17:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2024-10-11 18:17:19,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:17:19,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:19,249 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:19,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:17:19,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:19,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:19,250 INFO L85 PathProgramCache]: Analyzing trace with hash -439189455, now seen corresponding path program 1 times [2024-10-11 18:17:19,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:19,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106429310] [2024-10-11 18:17:19,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:19,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:19,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:19,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:19,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106429310] [2024-10-11 18:17:19,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106429310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:19,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:19,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:19,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237641780] [2024-10-11 18:17:19,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:19,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:19,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:19,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:19,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:19,456 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:19,667 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-10-11 18:17:19,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:19,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-11 18:17:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:19,668 INFO L225 Difference]: With dead ends: 111 [2024-10-11 18:17:19,670 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 18:17:19,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:19,671 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:19,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 371 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 18:17:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 18:17:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 106 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2024-10-11 18:17:19,682 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 17 [2024-10-11 18:17:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:19,682 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-10-11 18:17:19,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:19,682 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2024-10-11 18:17:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:17:19,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:19,683 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:19,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:17:19,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:19,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:19,683 INFO L85 PathProgramCache]: Analyzing trace with hash -439189454, now seen corresponding path program 1 times [2024-10-11 18:17:19,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:19,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038450604] [2024-10-11 18:17:19,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:19,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:19,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:19,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:17:19,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:19,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038450604] [2024-10-11 18:17:19,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038450604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:19,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:19,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:19,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750535240] [2024-10-11 18:17:19,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:19,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:19,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:19,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:19,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:19,936 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:20,121 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2024-10-11 18:17:20,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:20,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-11 18:17:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:20,122 INFO L225 Difference]: With dead ends: 110 [2024-10-11 18:17:20,122 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 18:17:20,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:20,123 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:20,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 18:17:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 18:17:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 54 states have (on average 2.111111111111111) internal successors, (114), 105 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2024-10-11 18:17:20,131 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 17 [2024-10-11 18:17:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:20,131 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2024-10-11 18:17:20,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2024-10-11 18:17:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:17:20,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:20,136 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:20,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:17:20,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:20,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:20,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1154053696, now seen corresponding path program 1 times [2024-10-11 18:17:20,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:20,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634857518] [2024-10-11 18:17:20,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:20,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:20,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:20,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:20,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:17:20,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:20,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634857518] [2024-10-11 18:17:20,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634857518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:20,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825313700] [2024-10-11 18:17:20,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:20,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:20,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:20,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:20,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:17:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:20,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 18:17:20,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:20,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:20,608 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-11 18:17:20,696 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:17:20,697 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-11 18:17:20,710 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-11 18:17:20,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:20,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825313700] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:20,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:20,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-10-11 18:17:20,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749301969] [2024-10-11 18:17:20,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:20,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:17:20,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:20,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:17:20,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-10-11 18:17:20,798 INFO L87 Difference]: Start difference. First operand 110 states and 120 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-11 18:17:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:21,030 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2024-10-11 18:17:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:21,030 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-11 18:17:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:21,031 INFO L225 Difference]: With dead ends: 109 [2024-10-11 18:17:21,031 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 18:17:21,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:17:21,032 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:21,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 378 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 0 Unknown, 114 Unchecked, 0.2s Time] [2024-10-11 18:17:21,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 18:17:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 18:17:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 104 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2024-10-11 18:17:21,041 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 19 [2024-10-11 18:17:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:21,041 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2024-10-11 18:17:21,041 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-11 18:17:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2024-10-11 18:17:21,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:17:21,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:21,045 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:21,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:17:21,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:21,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:21,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:21,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1154053695, now seen corresponding path program 1 times [2024-10-11 18:17:21,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:21,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957019018] [2024-10-11 18:17:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:21,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:21,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:17:21,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957019018] [2024-10-11 18:17:21,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957019018] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395787815] [2024-10-11 18:17:21,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:21,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:21,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:21,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:21,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:17:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:21,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 18:17:21,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:21,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:21,974 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-11 18:17:21,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:21,999 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 16 treesize of output 11 [2024-10-11 18:17:22,015 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:22,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:17:22,053 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-11 18:17:22,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:22,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395787815] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:22,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:22,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2024-10-11 18:17:22,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512282069] [2024-10-11 18:17:22,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:22,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 18:17:22,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:22,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 18:17:22,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2024-10-11 18:17:22,172 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 18 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:17:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:22,601 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2024-10-11 18:17:22,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:17:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2024-10-11 18:17:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:22,611 INFO L225 Difference]: With dead ends: 115 [2024-10-11 18:17:22,612 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 18:17:22,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=355, Unknown=1, NotChecked=38, Total=462 [2024-10-11 18:17:22,613 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 3 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:22,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 455 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 489 Invalid, 0 Unknown, 124 Unchecked, 0.4s Time] [2024-10-11 18:17:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 18:17:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-10-11 18:17:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 58 states have (on average 2.0344827586206895) internal successors, (118), 108 states have internal predecessors, (118), 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-11 18:17:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2024-10-11 18:17:22,628 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 19 [2024-10-11 18:17:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:22,628 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2024-10-11 18:17:22,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:17:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2024-10-11 18:17:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:17:22,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:22,631 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:22,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:22,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:22,834 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:22,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:22,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2095856878, now seen corresponding path program 1 times [2024-10-11 18:17:22,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:22,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76688214] [2024-10-11 18:17:22,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:22,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:23,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:23,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:23,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:17:23,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76688214] [2024-10-11 18:17:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76688214] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620456397] [2024-10-11 18:17:23,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:23,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:23,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:23,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:23,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:17:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:23,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 18:17:23,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:23,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:23,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:23,427 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|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-10-11 18:17:23,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:23,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:23,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:23,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:23,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:23,502 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-11 18:17:23,514 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:17:23,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:17:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2024-10-11 18:17:23,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:23,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620456397] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:23,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:23,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2024-10-11 18:17:23,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335186701] [2024-10-11 18:17:23,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:23,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:17:23,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:23,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:17:23,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2024-10-11 18:17:23,684 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 18:17:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:24,007 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2024-10-11 18:17:24,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:24,007 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 27 [2024-10-11 18:17:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:24,008 INFO L225 Difference]: With dead ends: 122 [2024-10-11 18:17:24,008 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 18:17:24,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=186, Unknown=2, NotChecked=58, Total=306 [2024-10-11 18:17:24,009 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 107 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:24,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 232 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 342 Invalid, 0 Unknown, 246 Unchecked, 0.2s Time] [2024-10-11 18:17:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 18:17:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2024-10-11 18:17:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 99 states have internal predecessors, (109), 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-11 18:17:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2024-10-11 18:17:24,028 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 27 [2024-10-11 18:17:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:24,029 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2024-10-11 18:17:24,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 18:17:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2024-10-11 18:17:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:17:24,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:24,029 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:24,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:17:24,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:24,231 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:24,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:24,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2095856877, now seen corresponding path program 1 times [2024-10-11 18:17:24,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:24,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197731852] [2024-10-11 18:17:24,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:24,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:24,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:24,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:24,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:17:24,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:24,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197731852] [2024-10-11 18:17:24,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197731852] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:24,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918364234] [2024-10-11 18:17:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:24,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:24,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:24,783 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:24,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:17:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:24,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 18:17:24,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:24,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:17:24,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:24,987 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-10-11 18:17:25,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:25,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:25,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:25,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:25,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:25,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:25,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:25,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:25,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:25,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918364234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:25,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:25,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2024-10-11 18:17:25,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609307036] [2024-10-11 18:17:25,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:25,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:25,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:25,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:25,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:17:25,152 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:25,290 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2024-10-11 18:17:25,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:25,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-10-11 18:17:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:25,291 INFO L225 Difference]: With dead ends: 100 [2024-10-11 18:17:25,291 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 18:17:25,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-10-11 18:17:25,292 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 21 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:25,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 261 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 126 Unchecked, 0.1s Time] [2024-10-11 18:17:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 18:17:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 18:17:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.793103448275862) internal successors, (104), 94 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-11 18:17:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2024-10-11 18:17:25,296 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 27 [2024-10-11 18:17:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:25,296 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2024-10-11 18:17:25,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2024-10-11 18:17:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:17:25,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:25,297 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:25,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:17:25,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 18:17:25,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:25,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:25,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1631736968, now seen corresponding path program 2 times [2024-10-11 18:17:25,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:25,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860792416] [2024-10-11 18:17:25,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:25,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:25,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:25,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:25,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 18:17:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:25,580 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-11 18:17:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:25,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860792416] [2024-10-11 18:17:25,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860792416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:25,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:25,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:17:25,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066916827] [2024-10-11 18:17:25,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:25,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:17:25,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:25,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:17:25,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:17:25,583 INFO L87 Difference]: Start difference. First operand 100 states and 112 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-11 18:17:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:25,671 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2024-10-11 18:17:25,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:17:25,672 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-11 18:17:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:25,673 INFO L225 Difference]: With dead ends: 94 [2024-10-11 18:17:25,673 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 18:17:25,673 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-11 18:17:25,673 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:25,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 18:17:25,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 18:17:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2024-10-11 18:17:25,676 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 28 [2024-10-11 18:17:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:25,677 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2024-10-11 18:17:25,677 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-11 18:17:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2024-10-11 18:17:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:17:25,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:25,678 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:25,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:17:25,678 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:25,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:25,678 INFO L85 PathProgramCache]: Analyzing trace with hash 221202259, now seen corresponding path program 1 times [2024-10-11 18:17:25,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:25,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475730240] [2024-10-11 18:17:25,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:25,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:25,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:25,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 18:17:25,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:25,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475730240] [2024-10-11 18:17:25,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475730240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:25,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:25,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:25,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356038142] [2024-10-11 18:17:25,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:25,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:25,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:25,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:25,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:25,824 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:25,998 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-10-11 18:17:25,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:25,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 29 [2024-10-11 18:17:25,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:25,999 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:17:25,999 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:17:25,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:26,000 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 17 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:26,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 300 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:17:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 18:17:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 87 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-10-11 18:17:26,002 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 29 [2024-10-11 18:17:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:26,003 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-10-11 18:17:26,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-10-11 18:17:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:17:26,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:26,003 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:26,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:17:26,004 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:26,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:26,004 INFO L85 PathProgramCache]: Analyzing trace with hash 221202260, now seen corresponding path program 1 times [2024-10-11 18:17:26,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:26,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644787857] [2024-10-11 18:17:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:26,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:17:26,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:26,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644787857] [2024-10-11 18:17:26,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644787857] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:26,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013014908] [2024-10-11 18:17:26,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:26,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:26,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:26,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:26,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:17:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 18:17:26,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:26,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:17:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:17:26,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013014908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:26,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-11 18:17:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573944652] [2024-10-11 18:17:26,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:26,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:17:26,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:26,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:17:26,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:17:26,341 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:26,455 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-10-11 18:17:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:17:26,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 29 [2024-10-11 18:17:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:26,456 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:17:26,456 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:17:26,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:17:26,457 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 16 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:26,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 275 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:17:26,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 18:17:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2024-10-11 18:17:26,460 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 29 [2024-10-11 18:17:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:26,461 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2024-10-11 18:17:26,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-10-11 18:17:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:17:26,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:26,463 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:26,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:17:26,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 18:17:26,664 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:26,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:26,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1732650497, now seen corresponding path program 1 times [2024-10-11 18:17:26,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:26,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960552347] [2024-10-11 18:17:26,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:26,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:17:26,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:26,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960552347] [2024-10-11 18:17:26,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960552347] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:26,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177379749] [2024-10-11 18:17:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:26,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:26,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:26,985 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:26,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:17:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:27,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 18:17:27,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:27,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:27,285 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-11 18:17:27,310 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-11 18:17:27,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-10-11 18:17:27,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 18:17:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:17:27,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:27,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177379749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:27,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:27,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-10-11 18:17:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023514131] [2024-10-11 18:17:27,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:27,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:17:27,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:17:27,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=205, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:17:27,330 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:27,440 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-10-11 18:17:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:17:27,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-10-11 18:17:27,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:27,441 INFO L225 Difference]: With dead ends: 89 [2024-10-11 18:17:27,441 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 18:17:27,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=261, Unknown=1, NotChecked=32, Total=342 [2024-10-11 18:17:27,442 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 20 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:27,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 260 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 125 Unchecked, 0.1s Time] [2024-10-11 18:17:27,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 18:17:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 18:17:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.690909090909091) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2024-10-11 18:17:27,447 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 30 [2024-10-11 18:17:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:27,447 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2024-10-11 18:17:27,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2024-10-11 18:17:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:17:27,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:27,448 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:27,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:27,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 18:17:27,649 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:27,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:27,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1732650496, now seen corresponding path program 1 times [2024-10-11 18:17:27,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:27,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642552462] [2024-10-11 18:17:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:27,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:27,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:28,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:28,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:28,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642552462] [2024-10-11 18:17:28,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642552462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:28,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515536425] [2024-10-11 18:17:28,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:28,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:28,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:28,152 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:28,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:17:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:28,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-11 18:17:28,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:28,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:28,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:17:28,569 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:28,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:17:28,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:28,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:28,719 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~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-11 18:17:28,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:28,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 18:17:28,767 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:17:28,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 18:17:28,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 18:17:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-10-11 18:17:28,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:28,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515536425] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:28,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:28,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 29 [2024-10-11 18:17:28,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598433730] [2024-10-11 18:17:28,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:28,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 18:17:28,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:28,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 18:17:28,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=902, Unknown=1, NotChecked=60, Total=1056 [2024-10-11 18:17:28,990 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 30 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 24 states have internal predecessors, (48), 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-11 18:17:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:29,947 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2024-10-11 18:17:29,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:17:29,947 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 24 states have internal predecessors, (48), 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) Word has length 30 [2024-10-11 18:17:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:29,948 INFO L225 Difference]: With dead ends: 98 [2024-10-11 18:17:29,948 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 18:17:29,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1633, Unknown=1, NotChecked=82, Total=1892 [2024-10-11 18:17:29,950 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 164 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:29,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 907 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1418 Invalid, 0 Unknown, 103 Unchecked, 0.7s Time] [2024-10-11 18:17:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 18:17:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 18:17:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-10-11 18:17:29,954 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 30 [2024-10-11 18:17:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:29,954 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-10-11 18:17:29,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 24 states have internal predecessors, (48), 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-11 18:17:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-10-11 18:17:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:17:29,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:29,955 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:29,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 18:17:30,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:30,160 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:30,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:30,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1356677081, now seen corresponding path program 1 times [2024-10-11 18:17:30,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:30,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786353067] [2024-10-11 18:17:30,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:30,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:30,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:30,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:30,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:17:30,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:30,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786353067] [2024-10-11 18:17:30,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786353067] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:30,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803806267] [2024-10-11 18:17:30,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:30,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:30,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:30,400 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:30,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:17:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:30,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 18:17:30,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:30,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:30,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:17:30,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:30,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:30,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:30,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:30,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:30,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:30,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:30,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:30,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:30,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:30,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:30,843 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 11 treesize of output 7 [2024-10-11 18:17:30,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:30,919 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-10-11 18:17:30,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:30,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2024-10-11 18:17:30,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:31,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803806267] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:31,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:31,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 22 [2024-10-11 18:17:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770039242] [2024-10-11 18:17:31,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:31,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 18:17:31,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:31,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 18:17:31,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2024-10-11 18:17:31,077 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 22 states, 19 states have (on average 2.526315789473684) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:17:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:31,669 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2024-10-11 18:17:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:17:31,670 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.526315789473684) internal successors, (48), 16 states have internal predecessors, (48), 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 32 [2024-10-11 18:17:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:31,670 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:17:31,670 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:17:31,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=754, Unknown=1, NotChecked=56, Total=930 [2024-10-11 18:17:31,671 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 158 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:31,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 647 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 871 Invalid, 0 Unknown, 86 Unchecked, 0.4s Time] [2024-10-11 18:17:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:17:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 18:17:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.540983606557377) internal successors, (94), 86 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2024-10-11 18:17:31,678 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 32 [2024-10-11 18:17:31,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:31,678 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2024-10-11 18:17:31,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.526315789473684) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:17:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2024-10-11 18:17:31,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:17:31,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:31,679 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:31,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 18:17:31,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 18:17:31,880 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:31,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:31,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1808062286, now seen corresponding path program 1 times [2024-10-11 18:17:31,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:31,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854402810] [2024-10-11 18:17:31,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:31,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:32,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:32,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854402810] [2024-10-11 18:17:32,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854402810] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:32,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579947715] [2024-10-11 18:17:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:32,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:32,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:32,496 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:32,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:17:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-10-11 18:17:32,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:32,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:32,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:32,983 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:32,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:17:33,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:17:33,101 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-11 18:17:33,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2024-10-11 18:17:33,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-11 18:17:33,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:17:33,291 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int)) (<= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_48| Int)) (and (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_48| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_48|)) |c_#memory_$Pointer$#1.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|) 0) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_48| (select |c_#valid| |v_node_create_~temp~0#1.base_48|)))))) is different from true [2024-10-11 18:17:33,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:33,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-10-11 18:17:33,333 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-10-11 18:17:33,333 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 36 treesize of output 52 [2024-10-11 18:17:33,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2024-10-11 18:17:33,425 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-11 18:17:33,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:17:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:17:33,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:33,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579947715] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:33,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:33,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 38 [2024-10-11 18:17:33,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821411271] [2024-10-11 18:17:33,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:33,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 18:17:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:33,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 18:17:33,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1516, Unknown=1, NotChecked=78, Total=1722 [2024-10-11 18:17:33,704 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 39 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:17:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:34,699 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-10-11 18:17:34,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 18:17:34,699 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-10-11 18:17:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:34,700 INFO L225 Difference]: With dead ends: 93 [2024-10-11 18:17:34,700 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:17:34,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=264, Invalid=2709, Unknown=1, NotChecked=106, Total=3080 [2024-10-11 18:17:34,701 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 126 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:34,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1022 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1150 Invalid, 0 Unknown, 101 Unchecked, 0.6s Time] [2024-10-11 18:17:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:17:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 18:17:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-10-11 18:17:34,704 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 34 [2024-10-11 18:17:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:34,704 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-10-11 18:17:34,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:17:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-10-11 18:17:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:17:34,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:34,705 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:34,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 18:17:34,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:34,910 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:34,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1808062285, now seen corresponding path program 1 times [2024-10-11 18:17:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:34,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531820015] [2024-10-11 18:17:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:34,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:35,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:35,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:35,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:36,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:36,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531820015] [2024-10-11 18:17:36,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531820015] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:36,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143319505] [2024-10-11 18:17:36,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:36,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:36,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:36,115 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:36,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:17:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-10-11 18:17:36,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:36,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:36,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:17:36,568 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:17:36,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:17:36,579 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:36,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:17:36,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-11 18:17:36,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-11 18:17:36,746 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-11 18:17:36,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 60 [2024-10-11 18:17:36,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-10-11 18:17:36,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-11 18:17:36,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-11 18:17:36,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-11 18:17:36,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:36,983 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_57| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_57| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_57|))) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_57| (select |c_#length| |v_node_create_~temp~0#1.base_57|)) |c_#length|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_57|) 0) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_57| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_57|))))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_7|) 0) 0))) is different from true [2024-10-11 18:17:36,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:36,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2024-10-11 18:17:37,010 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 18:17:37,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-11 18:17:37,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-11 18:17:37,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 18:17:37,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2024-10-11 18:17:37,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:17:37,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:17:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:17:37,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:37,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143319505] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:37,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:37,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2024-10-11 18:17:37,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761391198] [2024-10-11 18:17:37,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:37,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 18:17:37,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:37,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 18:17:37,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1764, Unknown=1, NotChecked=84, Total=1980 [2024-10-11 18:17:37,571 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 41 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 34 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:17:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:39,122 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2024-10-11 18:17:39,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 18:17:39,122 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 34 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-10-11 18:17:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:39,123 INFO L225 Difference]: With dead ends: 97 [2024-10-11 18:17:39,123 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 18:17:39,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=264, Invalid=3278, Unknown=2, NotChecked=116, Total=3660 [2024-10-11 18:17:39,124 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 106 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:39,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1217 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1613 Invalid, 0 Unknown, 105 Unchecked, 0.9s Time] [2024-10-11 18:17:39,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 18:17:39,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-11 18:17:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.523076923076923) internal successors, (99), 90 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2024-10-11 18:17:39,131 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 34 [2024-10-11 18:17:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:39,131 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2024-10-11 18:17:39,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 34 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:17:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2024-10-11 18:17:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:17:39,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:39,131 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:39,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 18:17:39,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 18:17:39,332 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:39,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:39,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1010820581, now seen corresponding path program 2 times [2024-10-11 18:17:39,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:39,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287698778] [2024-10-11 18:17:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:39,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:39,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:39,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:39,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:40,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:40,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287698778] [2024-10-11 18:17:40,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287698778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:40,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798149839] [2024-10-11 18:17:40,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:17:40,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:40,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:40,164 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:40,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:17:40,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:17:40,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:17:40,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-10-11 18:17:40,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:40,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:40,532 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:40,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:17:40,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:17:40,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:17:40,670 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-11 18:17:40,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 47 [2024-10-11 18:17:40,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-10-11 18:17:40,726 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:17:40,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 24 [2024-10-11 18:17:40,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:17:40,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-11 18:17:40,870 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_8|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_66| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_66| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_66|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_66| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_66|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_66|) 0)))) is different from true [2024-10-11 18:17:40,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:40,886 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-11 18:17:40,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 46 [2024-10-11 18:17:40,904 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 18:17:40,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-11 18:17:40,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 18:17:41,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2024-10-11 18:17:41,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:17:41,278 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:17:41,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2024-10-11 18:17:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:17:41,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:41,325 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2024-10-11 18:17:41,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2024-10-11 18:17:41,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798149839] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:41,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:41,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 42 [2024-10-11 18:17:41,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170493143] [2024-10-11 18:17:41,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:41,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 18:17:41,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:41,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 18:17:41,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1914, Unknown=1, NotChecked=88, Total=2162 [2024-10-11 18:17:41,475 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 43 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 36 states have internal predecessors, (63), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:17:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:42,700 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2024-10-11 18:17:42,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 18:17:42,701 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 36 states have internal predecessors, (63), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2024-10-11 18:17:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:42,701 INFO L225 Difference]: With dead ends: 98 [2024-10-11 18:17:42,701 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 18:17:42,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=308, Invalid=3477, Unknown=1, NotChecked=120, Total=3906 [2024-10-11 18:17:42,703 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 113 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:42,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1134 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1177 Invalid, 0 Unknown, 107 Unchecked, 0.7s Time] [2024-10-11 18:17:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 18:17:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-11 18:17:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 91 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:42,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2024-10-11 18:17:42,706 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 38 [2024-10-11 18:17:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:42,706 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2024-10-11 18:17:42,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 36 states have internal predecessors, (63), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:17:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2024-10-11 18:17:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:17:42,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:42,707 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:42,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:42,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:17:42,908 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:42,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:42,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1010820582, now seen corresponding path program 2 times [2024-10-11 18:17:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:42,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571779980] [2024-10-11 18:17:42,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:42,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:43,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:43,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571779980] [2024-10-11 18:17:43,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571779980] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:43,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066492061] [2024-10-11 18:17:43,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:17:43,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:43,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:43,699 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:43,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:17:43,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:17:43,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:17:43,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-10-11 18:17:43,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:43,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:44,089 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:44,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:17:44,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:17:44,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:17:44,230 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-11 18:17:44,231 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 88 treesize of output 50 [2024-10-11 18:17:44,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-11 18:17:44,289 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:17:44,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2024-10-11 18:17:44,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:17:44,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-11 18:17:44,430 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_75| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_75| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_75|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_75|) 0) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_75| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_75|)) |c_#memory_$Pointer$#1.base|))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) is different from true [2024-10-11 18:17:44,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:44,451 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-11 18:17:44,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 55 [2024-10-11 18:17:44,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:44,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:44,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-10-11 18:17:44,475 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 18:17:44,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-11 18:17:44,877 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:17:44,883 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-10-11 18:17:44,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 35 [2024-10-11 18:17:44,965 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 25 [2024-10-11 18:17:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:17:45,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:45,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066492061] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:45,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:45,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2024-10-11 18:17:45,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316661614] [2024-10-11 18:17:45,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:45,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 18:17:45,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:45,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 18:17:45,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2021, Unknown=1, NotChecked=90, Total=2256 [2024-10-11 18:17:45,404 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 43 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 36 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:17:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:46,762 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2024-10-11 18:17:46,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 18:17:46,762 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 36 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2024-10-11 18:17:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:46,763 INFO L225 Difference]: With dead ends: 87 [2024-10-11 18:17:46,765 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 18:17:46,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=292, Invalid=3617, Unknown=1, NotChecked=122, Total=4032 [2024-10-11 18:17:46,766 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 69 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:46,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1462 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1272 Invalid, 0 Unknown, 93 Unchecked, 0.7s Time] [2024-10-11 18:17:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 18:17:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-10-11 18:17:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 80 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2024-10-11 18:17:46,768 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 38 [2024-10-11 18:17:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:46,768 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2024-10-11 18:17:46,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 36 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:17:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-10-11 18:17:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:17:46,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:46,769 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:46,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 18:17:46,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:46,969 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:46,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash 807284210, now seen corresponding path program 1 times [2024-10-11 18:17:46,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:46,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932651534] [2024-10-11 18:17:46,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:46,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:47,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:47,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932651534] [2024-10-11 18:17:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932651534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:47,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:47,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:17:47,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805597603] [2024-10-11 18:17:47,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:47,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:17:47,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:47,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:17:47,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:17:47,166 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:47,301 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-10-11 18:17:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:17:47,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 39 [2024-10-11 18:17:47,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:47,302 INFO L225 Difference]: With dead ends: 91 [2024-10-11 18:17:47,302 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 18:17:47,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:17:47,302 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 58 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:47,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 284 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 18:17:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2024-10-11 18:17:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 80 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2024-10-11 18:17:47,309 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 39 [2024-10-11 18:17:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:47,309 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2024-10-11 18:17:47,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2024-10-11 18:17:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:17:47,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:47,309 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:47,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 18:17:47,310 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:47,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:47,310 INFO L85 PathProgramCache]: Analyzing trace with hash 807284211, now seen corresponding path program 1 times [2024-10-11 18:17:47,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:47,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500893837] [2024-10-11 18:17:47,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:47,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:17:47,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500893837] [2024-10-11 18:17:47,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500893837] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770307206] [2024-10-11 18:17:47,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:47,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:47,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:47,579 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:47,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:17:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:47,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 18:17:47,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:47,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:17:47,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:47,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:47,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:47,986 WARN L873 $PredicateComparison]: unable to prove that (and (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|)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_18| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_18|) 0))) is different from true [2024-10-11 18:17:48,009 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:17:48,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 18:17:48,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 18:17:48,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 18:17:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-11 18:17:48,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:48,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770307206] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:48,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:48,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2024-10-11 18:17:48,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872002487] [2024-10-11 18:17:48,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:48,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 18:17:48,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:48,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 18:17:48,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=582, Unknown=1, NotChecked=48, Total=702 [2024-10-11 18:17:48,255 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 24 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:17:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:48,832 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2024-10-11 18:17:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:17:48,832 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2024-10-11 18:17:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:48,835 INFO L225 Difference]: With dead ends: 102 [2024-10-11 18:17:48,835 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 18:17:48,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1257, Unknown=1, NotChecked=72, Total=1482 [2024-10-11 18:17:48,836 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 205 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:48,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 610 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 767 Invalid, 0 Unknown, 107 Unchecked, 0.4s Time] [2024-10-11 18:17:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 18:17:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2024-10-11 18:17:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 83 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2024-10-11 18:17:48,843 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 39 [2024-10-11 18:17:48,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:48,843 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2024-10-11 18:17:48,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:17:48,844 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2024-10-11 18:17:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 18:17:48,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:48,844 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:48,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:49,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:49,045 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:49,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:49,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2012889794, now seen corresponding path program 1 times [2024-10-11 18:17:49,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:49,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815569988] [2024-10-11 18:17:49,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:49,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:49,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815569988] [2024-10-11 18:17:49,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815569988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:49,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:49,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:17:49,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124104963] [2024-10-11 18:17:49,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:49,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:17:49,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:49,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:17:49,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:17:49,137 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:49,255 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2024-10-11 18:17:49,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:17:49,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-10-11 18:17:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:49,256 INFO L225 Difference]: With dead ends: 106 [2024-10-11 18:17:49,256 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 18:17:49,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:17:49,257 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 55 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:49,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 253 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 18:17:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2024-10-11 18:17:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.4375) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-10-11 18:17:49,262 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 42 [2024-10-11 18:17:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:49,262 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-10-11 18:17:49,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-10-11 18:17:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 18:17:49,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:49,263 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:49,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 18:17:49,264 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:49,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:49,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2012889793, now seen corresponding path program 1 times [2024-10-11 18:17:49,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:49,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378436750] [2024-10-11 18:17:49,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:49,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:49,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:49,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:49,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:49,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:49,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378436750] [2024-10-11 18:17:49,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378436750] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:49,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073414350] [2024-10-11 18:17:49,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:49,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:49,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:49,901 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:49,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:17:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:50,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 18:17:50,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:50,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:50,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:17:50,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:50,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:50,313 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_19|) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-10-11 18:17:50,335 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:17:50,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 18:17:50,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 18:17:50,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:17:50,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 18:17:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-11 18:17:50,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:50,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073414350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:50,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:50,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 24 [2024-10-11 18:17:50,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563479503] [2024-10-11 18:17:50,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:50,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 18:17:50,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:50,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 18:17:50,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=631, Unknown=1, NotChecked=50, Total=756 [2024-10-11 18:17:50,549 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 25 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 21 states have internal predecessors, (60), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:17:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:51,126 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2024-10-11 18:17:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 18:17:51,127 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 21 states have internal predecessors, (60), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-10-11 18:17:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:51,128 INFO L225 Difference]: With dead ends: 103 [2024-10-11 18:17:51,128 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 18:17:51,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=1398, Unknown=1, NotChecked=76, Total=1640 [2024-10-11 18:17:51,129 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 116 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:51,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 617 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 731 Invalid, 0 Unknown, 107 Unchecked, 0.3s Time] [2024-10-11 18:17:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 18:17:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2024-10-11 18:17:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-10-11 18:17:51,132 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 42 [2024-10-11 18:17:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:51,132 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-10-11 18:17:51,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 21 states have internal predecessors, (60), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:17:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-10-11 18:17:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:17:51,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:51,132 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:51,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 18:17:51,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 18:17:51,333 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:51,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:51,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2024931378, now seen corresponding path program 1 times [2024-10-11 18:17:51,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:51,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70618687] [2024-10-11 18:17:51,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:51,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:17:51,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:51,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70618687] [2024-10-11 18:17:51,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70618687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:51,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991627594] [2024-10-11 18:17:51,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:51,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:51,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:51,951 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:51,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 18:17:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:52,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-11 18:17:52,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:52,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:52,291 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:17:52,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:17:52,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:17:52,400 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-11 18:17:52,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 57 [2024-10-11 18:17:52,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-10-11 18:17:52,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:17:52,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:52,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-10-11 18:17:52,629 INFO L349 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2024-10-11 18:17:52,629 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 40 treesize of output 60 [2024-10-11 18:17:52,808 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-10-11 18:17:52,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2024-10-11 18:17:52,942 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-11 18:17:52,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 93 [2024-10-11 18:17:52,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:53,227 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 236 treesize of output 168 [2024-10-11 18:17:53,230 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 167 treesize of output 127 [2024-10-11 18:17:53,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:17:53,456 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 131 treesize of output 91 [2024-10-11 18:17:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:17:53,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:54,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991627594] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:54,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:54,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 39 [2024-10-11 18:17:54,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960236323] [2024-10-11 18:17:54,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:54,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 18:17:54,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:54,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 18:17:54,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1747, Unknown=1, NotChecked=0, Total=1892 [2024-10-11 18:17:54,004 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 40 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:17:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:55,311 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2024-10-11 18:17:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 18:17:55,311 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2024-10-11 18:17:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:55,312 INFO L225 Difference]: With dead ends: 111 [2024-10-11 18:17:55,312 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 18:17:55,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=275, Invalid=2804, Unknown=1, NotChecked=0, Total=3080 [2024-10-11 18:17:55,313 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 210 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:55,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 919 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:17:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 18:17:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2024-10-11 18:17:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 86 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2024-10-11 18:17:55,316 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 43 [2024-10-11 18:17:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:55,316 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2024-10-11 18:17:55,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:17:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2024-10-11 18:17:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:17:55,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:55,317 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:55,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:55,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 18:17:55,518 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:17:55,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:55,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2024931379, now seen corresponding path program 1 times [2024-10-11 18:17:55,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:55,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900574774] [2024-10-11 18:17:55,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:17:56,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:56,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900574774] [2024-10-11 18:17:56,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900574774] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:56,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795688211] [2024-10-11 18:17:56,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:56,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:56,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:56,352 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:56,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 18:17:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-10-11 18:17:56,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:56,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:56,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:17:56,802 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:17:56,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:17:56,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:56,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:17:56,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:17:56,970 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-11 18:17:56,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 60 [2024-10-11 18:17:56,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-10-11 18:17:57,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-11 18:17:57,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:57,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-11 18:17:57,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:17:57,305 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:17:57,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-10-11 18:17:57,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:57,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2024-10-11 18:17:57,334 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 18:17:57,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-11 18:17:57,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-11 18:17:57,716 INFO L349 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2024-10-11 18:17:57,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-10-11 18:17:57,728 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2024-10-11 18:17:57,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2024-10-11 18:17:57,943 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-11 18:17:57,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 101 [2024-10-11 18:17:57,961 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-11 18:17:57,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 128 [2024-10-11 18:17:58,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:58,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:58,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:58,501 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 287 treesize of output 211 [2024-10-11 18:17:58,920 INFO L349 Elim1Store]: treesize reduction 12, result has 93.4 percent of original size [2024-10-11 18:17:58,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 215 treesize of output 339 [2024-10-11 18:17:59,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:17:59,396 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 166 treesize of output 122 [2024-10-11 18:17:59,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:17:59,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 138 [2024-10-11 18:18:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:18:00,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:00,494 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_3212 (Array Int Int)) (v_ArrVal_3213 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3212) .cse0) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3213) .cse0) .cse1)))) (forall ((v_ArrVal_3212 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3212) .cse0) .cse1))))) is different from false