./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:54:52,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:54:52,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:54:52,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:54:52,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:54:52,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:54:52,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:54:52,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:54:52,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:54:52,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:54:52,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:54:52,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:54:52,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:54:52,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:54:52,424 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:54:52,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:54:52,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:54:52,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:54:52,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:54:52,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:54:52,425 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:54:52,428 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:54:52,428 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:54:52,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:54:52,428 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:54:52,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:54:52,429 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:54:52,429 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:54:52,429 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:54:52,429 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:54:52,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:54:52,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:54:52,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:54:52,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:54:52,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:54:52,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:54:52,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:54:52,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:54:52,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:54:52,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:54:52,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:54:52,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:54:52,433 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2024-11-19 06:54:52,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:54:52,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:54:52,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:54:52,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:54:52,665 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:54:52,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-11-19 06:54:53,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:54:54,110 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:54:54,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-11-19 06:54:54,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a3ca255/68f01ac0686848bc8ba4d73c83bc492d/FLAG0e355e46f [2024-11-19 06:54:54,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a3ca255/68f01ac0686848bc8ba4d73c83bc492d [2024-11-19 06:54:54,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:54:54,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:54:54,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:54:54,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:54:54,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:54:54,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3706f836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54, skipping insertion in model container [2024-11-19 06:54:54,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:54:54,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:54:54,509 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:54:54,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:54:54,563 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:54:54,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54 WrapperNode [2024-11-19 06:54:54,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:54:54,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:54:54,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:54:54,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:54:54,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,605 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2024-11-19 06:54:54,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:54:54,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:54:54,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:54:54,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:54:54,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,645 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 8, 8, 6, 18]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 1, 0]. The 10 writes are split as follows [0, 1, 1, 1, 7]. [2024-11-19 06:54:54,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:54:54,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:54:54,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:54:54,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:54:54,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:54:54,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:54:54,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:54:54,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:54:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-19 06:54:54,742 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-19 06:54:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:54:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:54:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:54:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:54:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:54:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:54:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 06:54:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-19 06:54:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:54:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:54:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:54:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 06:54:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-19 06:54:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-11-19 06:54:54,744 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-11-19 06:54:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:54:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:54:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:54:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 06:54:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-19 06:54:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-19 06:54:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-11-19 06:54:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-11-19 06:54:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:54:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:54:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 06:54:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 06:54:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 06:54:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-11-19 06:54:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-11-19 06:54:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:54:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:54:54,889 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:54:54,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:54:55,343 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2024-11-19 06:54:55,344 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:54:55,368 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:54:55,370 INFO L316 CfgBuilder]: Removed 33 assume(true) statements. [2024-11-19 06:54:55,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:54:55 BoogieIcfgContainer [2024-11-19 06:54:55,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:54:55,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:54:55,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:54:55,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:54:55,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:54:54" (1/3) ... [2024-11-19 06:54:55,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee9b638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:54:55, skipping insertion in model container [2024-11-19 06:54:55,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54" (2/3) ... [2024-11-19 06:54:55,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee9b638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:54:55, skipping insertion in model container [2024-11-19 06:54:55,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:54:55" (3/3) ... [2024-11-19 06:54:55,379 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2024-11-19 06:54:55,393 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:54:55,393 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2024-11-19 06:54:55,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:54:55,449 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;@2cedb330, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:54:55,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2024-11-19 06:54:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 123 states have (on average 2.073170731707317) internal successors, (255), 211 states have internal predecessors, (255), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 06:54:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:54:55,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:55,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:54:55,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:54:55,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:55,466 INFO L85 PathProgramCache]: Analyzing trace with hash 6467046, now seen corresponding path program 1 times [2024-11-19 06:54:55,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010479571] [2024-11-19 06:54:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:55,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:55,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:55,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010479571] [2024-11-19 06:54:55,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010479571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:55,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:55,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:55,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550291702] [2024-11-19 06:54:55,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:55,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:54:55,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:55,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:54:55,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:54:55,644 INFO L87 Difference]: Start difference. First operand has 225 states, 123 states have (on average 2.073170731707317) internal successors, (255), 211 states have internal predecessors, (255), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:55,665 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2024-11-19 06:54:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:54:55,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:54:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:55,674 INFO L225 Difference]: With dead ends: 222 [2024-11-19 06:54:55,674 INFO L226 Difference]: Without dead ends: 220 [2024-11-19 06:54:55,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:54:55,678 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:55,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:54:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-19 06:54:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-11-19 06:54:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 117 states have (on average 1.8376068376068375) internal successors, (215), 206 states have internal predecessors, (215), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:54:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 241 transitions. [2024-11-19 06:54:55,720 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 241 transitions. Word has length 4 [2024-11-19 06:54:55,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:55,721 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 241 transitions. [2024-11-19 06:54:55,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 241 transitions. [2024-11-19 06:54:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:54:55,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:55,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:54:55,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:54:55,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:54:55,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:55,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1928521722, now seen corresponding path program 1 times [2024-11-19 06:54:55,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:55,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469315627] [2024-11-19 06:54:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:55,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:55,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:55,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469315627] [2024-11-19 06:54:55,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469315627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:55,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:55,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:55,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654147528] [2024-11-19 06:54:55,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:55,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:54:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:55,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:54:55,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:54:55,835 INFO L87 Difference]: Start difference. First operand 220 states and 241 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-19 06:54:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:55,977 INFO L93 Difference]: Finished difference Result 218 states and 239 transitions. [2024-11-19 06:54:55,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:54:55,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-19 06:54:55,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:55,980 INFO L225 Difference]: With dead ends: 218 [2024-11-19 06:54:55,981 INFO L226 Difference]: Without dead ends: 218 [2024-11-19 06:54:55,982 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-11-19 06:54:55,983 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:55,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 383 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:55,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-19 06:54:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-19 06:54:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 117 states have (on average 1.8205128205128205) internal successors, (213), 204 states have internal predecessors, (213), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:54:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 239 transitions. [2024-11-19 06:54:56,004 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 239 transitions. Word has length 6 [2024-11-19 06:54:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:56,005 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 239 transitions. [2024-11-19 06:54:56,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-19 06:54:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 239 transitions. [2024-11-19 06:54:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:54:56,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:56,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:54:56,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:54:56,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:54:56,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:56,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1928521723, now seen corresponding path program 1 times [2024-11-19 06:54:56,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:56,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261774243] [2024-11-19 06:54:56,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:56,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:56,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:56,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261774243] [2024-11-19 06:54:56,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261774243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:56,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:56,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:56,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355839600] [2024-11-19 06:54:56,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:56,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:54:56,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:56,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:54:56,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:54:56,112 INFO L87 Difference]: Start difference. First operand 218 states and 239 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-19 06:54:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:56,206 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2024-11-19 06:54:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:54:56,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-19 06:54:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:56,208 INFO L225 Difference]: With dead ends: 216 [2024-11-19 06:54:56,208 INFO L226 Difference]: Without dead ends: 216 [2024-11-19 06:54:56,208 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-11-19 06:54:56,209 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 2 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:56,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 388 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:56,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-19 06:54:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-11-19 06:54:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 117 states have (on average 1.8034188034188035) internal successors, (211), 202 states have internal predecessors, (211), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:54:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 237 transitions. [2024-11-19 06:54:56,219 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 237 transitions. Word has length 6 [2024-11-19 06:54:56,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:56,219 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 237 transitions. [2024-11-19 06:54:56,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-19 06:54:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 237 transitions. [2024-11-19 06:54:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:54:56,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:56,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:56,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:54:56,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:54:56,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1860239838, now seen corresponding path program 1 times [2024-11-19 06:54:56,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:56,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126052643] [2024-11-19 06:54:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:56,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:56,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126052643] [2024-11-19 06:54:56,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126052643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:56,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:56,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:54:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592243577] [2024-11-19 06:54:56,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:56,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:54:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:56,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:54:56,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:54:56,424 INFO L87 Difference]: Start difference. First operand 216 states and 237 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-11-19 06:54:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:56,637 INFO L93 Difference]: Finished difference Result 211 states and 232 transitions. [2024-11-19 06:54:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:54:56,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 10 [2024-11-19 06:54:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:56,639 INFO L225 Difference]: With dead ends: 211 [2024-11-19 06:54:56,639 INFO L226 Difference]: Without dead ends: 211 [2024-11-19 06:54:56,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:54:56,640 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 40 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:56,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 747 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:54:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-19 06:54:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-19 06:54:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 117 states have (on average 1.7606837606837606) internal successors, (206), 197 states have internal predecessors, (206), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:54:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 232 transitions. [2024-11-19 06:54:56,654 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 232 transitions. Word has length 10 [2024-11-19 06:54:56,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:56,654 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 232 transitions. [2024-11-19 06:54:56,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-11-19 06:54:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 232 transitions. [2024-11-19 06:54:56,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:54:56,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:56,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:56,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:54:56,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting chain_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:54:56,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:56,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1860239839, now seen corresponding path program 1 times [2024-11-19 06:54:56,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:56,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360059650] [2024-11-19 06:54:56,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:56,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:56,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:56,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360059650] [2024-11-19 06:54:56,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360059650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:56,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:56,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:54:56,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862612945] [2024-11-19 06:54:56,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:56,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:54:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:56,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:54:56,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:54:56,862 INFO L87 Difference]: Start difference. First operand 211 states and 232 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-11-19 06:54:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:57,104 INFO L93 Difference]: Finished difference Result 206 states and 227 transitions. [2024-11-19 06:54:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:54:57,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2024-11-19 06:54:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:57,105 INFO L225 Difference]: With dead ends: 206 [2024-11-19 06:54:57,105 INFO L226 Difference]: Without dead ends: 206 [2024-11-19 06:54:57,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:54:57,106 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 36 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:57,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 550 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:54:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-19 06:54:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-19 06:54:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 117 states have (on average 1.7179487179487178) internal successors, (201), 192 states have internal predecessors, (201), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:54:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2024-11-19 06:54:57,117 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 10 [2024-11-19 06:54:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:57,117 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2024-11-19 06:54:57,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-11-19 06:54:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2024-11-19 06:54:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:54:57,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:57,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:57,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:54:57,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:54:57,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:57,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1832860119, now seen corresponding path program 1 times [2024-11-19 06:54:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:57,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265746787] [2024-11-19 06:54:57,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:57,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:57,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:57,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265746787] [2024-11-19 06:54:57,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265746787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:57,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:57,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:54:57,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134805406] [2024-11-19 06:54:57,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:57,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:54:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:57,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:54:57,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:54:57,190 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-11-19 06:54:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:57,327 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2024-11-19 06:54:57,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:54:57,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2024-11-19 06:54:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:57,328 INFO L225 Difference]: With dead ends: 205 [2024-11-19 06:54:57,328 INFO L226 Difference]: Without dead ends: 205 [2024-11-19 06:54:57,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:54:57,329 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 3 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:57,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 648 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-19 06:54:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-19 06:54:57,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 117 states have (on average 1.7094017094017093) internal successors, (200), 191 states have internal predecessors, (200), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:54:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 226 transitions. [2024-11-19 06:54:57,334 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 226 transitions. Word has length 11 [2024-11-19 06:54:57,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:57,334 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 226 transitions. [2024-11-19 06:54:57,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-11-19 06:54:57,334 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 226 transitions. [2024-11-19 06:54:57,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:54:57,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:57,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:57,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:54:57,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:54:57,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:57,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1832860120, now seen corresponding path program 1 times [2024-11-19 06:54:57,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:57,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222510095] [2024-11-19 06:54:57,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:57,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:57,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:57,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222510095] [2024-11-19 06:54:57,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222510095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:57,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:57,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:54:57,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312569366] [2024-11-19 06:54:57,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:57,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:54:57,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:54:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:54:57,432 INFO L87 Difference]: Start difference. First operand 205 states and 226 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-11-19 06:54:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:57,536 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2024-11-19 06:54:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:54:57,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 11 [2024-11-19 06:54:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:57,537 INFO L225 Difference]: With dead ends: 204 [2024-11-19 06:54:57,537 INFO L226 Difference]: Without dead ends: 204 [2024-11-19 06:54:57,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:54:57,538 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 4 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:57,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 730 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:57,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-19 06:54:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-19 06:54:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 117 states have (on average 1.7008547008547008) internal successors, (199), 190 states have internal predecessors, (199), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:54:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2024-11-19 06:54:57,542 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 11 [2024-11-19 06:54:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:57,542 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2024-11-19 06:54:57,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-11-19 06:54:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2024-11-19 06:54:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:54:57,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:57,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:57,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:54:57,543 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:54:57,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:57,543 INFO L85 PathProgramCache]: Analyzing trace with hash -502411055, now seen corresponding path program 1 times [2024-11-19 06:54:57,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:57,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707356847] [2024-11-19 06:54:57,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:57,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:57,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:57,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707356847] [2024-11-19 06:54:57,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707356847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:57,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:57,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:54:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182965761] [2024-11-19 06:54:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:57,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:54:57,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:57,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:54:57,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:54:57,728 INFO L87 Difference]: Start difference. First operand 204 states and 225 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-11-19 06:54:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:58,068 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2024-11-19 06:54:58,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:54:58,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 19 [2024-11-19 06:54:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:58,070 INFO L225 Difference]: With dead ends: 203 [2024-11-19 06:54:58,070 INFO L226 Difference]: Without dead ends: 203 [2024-11-19 06:54:58,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:54:58,071 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 146 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:58,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 495 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:54:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-19 06:54:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-19 06:54:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 117 states have (on average 1.6923076923076923) internal successors, (198), 189 states have internal predecessors, (198), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:54:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2024-11-19 06:54:58,081 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 19 [2024-11-19 06:54:58,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:58,083 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2024-11-19 06:54:58,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-11-19 06:54:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2024-11-19 06:54:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:54:58,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:58,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:58,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:54:58,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:54:58,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash -502411054, now seen corresponding path program 1 times [2024-11-19 06:54:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:58,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731241690] [2024-11-19 06:54:58,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:58,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:58,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:58,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731241690] [2024-11-19 06:54:58,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731241690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:58,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:58,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:54:58,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517541324] [2024-11-19 06:54:58,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:58,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:54:58,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:58,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:54:58,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:54:58,343 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-11-19 06:54:58,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:58,689 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2024-11-19 06:54:58,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:54:58,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 19 [2024-11-19 06:54:58,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:58,691 INFO L225 Difference]: With dead ends: 202 [2024-11-19 06:54:58,691 INFO L226 Difference]: Without dead ends: 202 [2024-11-19 06:54:58,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:54:58,691 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 55 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:58,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 593 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:54:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-19 06:54:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-19 06:54:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 117 states have (on average 1.6837606837606838) internal successors, (197), 188 states have internal predecessors, (197), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:54:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2024-11-19 06:54:58,696 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 19 [2024-11-19 06:54:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:58,696 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2024-11-19 06:54:58,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-11-19 06:54:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2024-11-19 06:54:58,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:54:58,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:58,697 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:58,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:54:58,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:54:58,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:58,698 INFO L85 PathProgramCache]: Analyzing trace with hash 45731933, now seen corresponding path program 1 times [2024-11-19 06:54:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:58,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263939971] [2024-11-19 06:54:58,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:58,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:59,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:54:59,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:59,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263939971] [2024-11-19 06:54:59,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263939971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:54:59,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996273910] [2024-11-19 06:54:59,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:59,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:54:59,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:54:59,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:54:59,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:54:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:59,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:54:59,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:54:59,250 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-19 06:54:59,251 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 2 case distinctions, treesize of input 14 treesize of output 19 [2024-11-19 06:54:59,268 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| 1))) is different from true [2024-11-19 06:54:59,316 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-19 06:54:59,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2024-11-19 06:54:59,436 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1))) is different from true [2024-11-19 06:54:59,476 INFO L349 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2024-11-19 06:54:59,477 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 3 case distinctions, treesize of input 22 treesize of output 43 [2024-11-19 06:54:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2024-11-19 06:54:59,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:55:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996273910] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:55:00,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:55:00,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 21 [2024-11-19 06:55:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66841978] [2024-11-19 06:55:00,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:00,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 06:55:00,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 06:55:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=302, Unknown=2, NotChecked=74, Total=462 [2024-11-19 06:55:00,050 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand has 22 states, 20 states have (on average 4.35) internal successors, (87), 21 states have internal predecessors, (87), 3 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 06:55:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:00,759 INFO L93 Difference]: Finished difference Result 201 states and 222 transitions. [2024-11-19 06:55:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:55:00,760 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 4.35) internal successors, (87), 21 states have internal predecessors, (87), 3 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2024-11-19 06:55:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:00,761 INFO L225 Difference]: With dead ends: 201 [2024-11-19 06:55:00,761 INFO L226 Difference]: Without dead ends: 201 [2024-11-19 06:55:00,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=471, Unknown=2, NotChecked=94, Total=702 [2024-11-19 06:55:00,762 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 73 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 429 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:00,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 939 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1112 Invalid, 0 Unknown, 429 Unchecked, 0.6s Time] [2024-11-19 06:55:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-19 06:55:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-19 06:55:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 117 states have (on average 1.6752136752136753) internal successors, (196), 187 states have internal predecessors, (196), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:55:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 222 transitions. [2024-11-19 06:55:00,766 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 222 transitions. Word has length 37 [2024-11-19 06:55:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:00,766 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 222 transitions. [2024-11-19 06:55:00,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 4.35) internal successors, (87), 21 states have internal predecessors, (87), 3 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 06:55:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 222 transitions. [2024-11-19 06:55:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:55:00,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:00,767 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:00,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:55:00,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 06:55:00,968 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:55:00,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:00,969 INFO L85 PathProgramCache]: Analyzing trace with hash 45731934, now seen corresponding path program 1 times [2024-11-19 06:55:00,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:00,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267066854] [2024-11-19 06:55:00,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:01,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:01,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267066854] [2024-11-19 06:55:01,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267066854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:01,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536936193] [2024-11-19 06:55:01,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:01,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:01,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:01,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:01,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:55:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:01,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-19 06:55:01,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:01,752 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 9 treesize of output 5 [2024-11-19 06:55:01,755 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-11-19 06:55:01,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:01,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-19 06:55:01,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-11-19 06:55:01,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2024-11-19 06:55:01,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2024-11-19 06:55:01,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 11 [2024-11-19 06:55:01,815 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:55:01,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 1 case distinctions, treesize of input 9 treesize of output 11 [2024-11-19 06:55:01,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:01,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-19 06:55:01,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:01,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2024-11-19 06:55:01,882 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:55:01,882 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 7 [2024-11-19 06:55:01,885 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-11-19 06:55:01,893 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base|) 0) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#length| |chain_node_alloc_node_~ptr~0#1.base|)) |c_#length|))) is different from true [2024-11-19 06:55:01,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:01,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:01,973 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:55:01,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2024-11-19 06:55:01,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:01,980 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-11-19 06:55:02,049 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:55:02,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:55:02,057 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#length| |chain_node_alloc_node_~ptr~0#1.base|)) |c_#length|))) is different from true [2024-11-19 06:55:02,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:02,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:02,108 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:55:02,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2024-11-19 06:55:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-19 06:55:02,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:02,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536936193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:02,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:55:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2024-11-19 06:55:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794026154] [2024-11-19 06:55:02,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:02,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 06:55:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:02,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 06:55:02,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=208, Unknown=2, NotChecked=62, Total=342 [2024-11-19 06:55:02,227 INFO L87 Difference]: Start difference. First operand 201 states and 222 transitions. Second operand has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:55:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:02,873 INFO L93 Difference]: Finished difference Result 202 states and 225 transitions. [2024-11-19 06:55:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:55:02,874 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 3 states have call successors, (4), 2 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 37 [2024-11-19 06:55:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:02,876 INFO L225 Difference]: With dead ends: 202 [2024-11-19 06:55:02,876 INFO L226 Difference]: Without dead ends: 202 [2024-11-19 06:55:02,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=265, Unknown=2, NotChecked=70, Total=420 [2024-11-19 06:55:02,877 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 155 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:02,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 665 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 840 Invalid, 0 Unknown, 428 Unchecked, 0.6s Time] [2024-11-19 06:55:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-19 06:55:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2024-11-19 06:55:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 117 states have (on average 1.6666666666666667) internal successors, (195), 186 states have internal predecessors, (195), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:55:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2024-11-19 06:55:02,881 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 37 [2024-11-19 06:55:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:02,881 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2024-11-19 06:55:02,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:55:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2024-11-19 06:55:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 06:55:02,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:02,882 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:02,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:55:03,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 06:55:03,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:55:03,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:03,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1491506621, now seen corresponding path program 1 times [2024-11-19 06:55:03,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:03,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487853468] [2024-11-19 06:55:03,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:03,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 06:55:03,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:03,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487853468] [2024-11-19 06:55:03,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487853468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:03,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:03,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:55:03,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95977262] [2024-11-19 06:55:03,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:03,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:55:03,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:03,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:55:03,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:55:03,369 INFO L87 Difference]: Start difference. First operand 200 states and 221 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-11-19 06:55:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:03,679 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2024-11-19 06:55:03,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:55:03,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 58 [2024-11-19 06:55:03,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:03,681 INFO L225 Difference]: With dead ends: 205 [2024-11-19 06:55:03,681 INFO L226 Difference]: Without dead ends: 205 [2024-11-19 06:55:03,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:55:03,681 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 221 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:03,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 309 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:55:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-19 06:55:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2024-11-19 06:55:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 117 states have (on average 1.606837606837607) internal successors, (188), 179 states have internal predecessors, (188), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:55:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 214 transitions. [2024-11-19 06:55:03,685 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 214 transitions. Word has length 58 [2024-11-19 06:55:03,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:03,685 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 214 transitions. [2024-11-19 06:55:03,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-11-19 06:55:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 214 transitions. [2024-11-19 06:55:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 06:55:03,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:03,686 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:03,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:55:03,686 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:55:03,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:03,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1491506620, now seen corresponding path program 1 times [2024-11-19 06:55:03,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:03,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205384670] [2024-11-19 06:55:03,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:03,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 06:55:03,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:03,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205384670] [2024-11-19 06:55:03,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205384670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:03,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:03,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:55:03,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655718425] [2024-11-19 06:55:03,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:03,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:55:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:03,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:55:03,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:55:03,927 INFO L87 Difference]: Start difference. First operand 193 states and 214 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-11-19 06:55:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:04,382 INFO L93 Difference]: Finished difference Result 297 states and 335 transitions. [2024-11-19 06:55:04,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:55:04,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 58 [2024-11-19 06:55:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:04,384 INFO L225 Difference]: With dead ends: 297 [2024-11-19 06:55:04,385 INFO L226 Difference]: Without dead ends: 297 [2024-11-19 06:55:04,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:55:04,386 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 230 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:04,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 418 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:55:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-19 06:55:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 254. [2024-11-19 06:55:04,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 172 states have (on average 1.6337209302325582) internal successors, (281), 234 states have internal predecessors, (281), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 06:55:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 319 transitions. [2024-11-19 06:55:04,394 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 319 transitions. Word has length 58 [2024-11-19 06:55:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:04,396 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 319 transitions. [2024-11-19 06:55:04,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-11-19 06:55:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 319 transitions. [2024-11-19 06:55:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 06:55:04,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:04,397 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:04,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:55:04,398 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:55:04,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:04,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1007935234, now seen corresponding path program 1 times [2024-11-19 06:55:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:04,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180735837] [2024-11-19 06:55:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:04,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 06:55:04,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:04,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180735837] [2024-11-19 06:55:04,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180735837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:04,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:04,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:55:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002334098] [2024-11-19 06:55:04,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:04,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:55:04,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:04,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:55:04,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:55:04,758 INFO L87 Difference]: Start difference. First operand 254 states and 319 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:55:05,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:05,124 INFO L93 Difference]: Finished difference Result 259 states and 319 transitions. [2024-11-19 06:55:05,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:55:05,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-11-19 06:55:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:05,127 INFO L225 Difference]: With dead ends: 259 [2024-11-19 06:55:05,127 INFO L226 Difference]: Without dead ends: 259 [2024-11-19 06:55:05,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:55:05,127 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 205 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:05,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 376 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:55:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-19 06:55:05,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 247. [2024-11-19 06:55:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 172 states have (on average 1.558139534883721) internal successors, (268), 227 states have internal predecessors, (268), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 06:55:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 306 transitions. [2024-11-19 06:55:05,132 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 306 transitions. Word has length 59 [2024-11-19 06:55:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:05,132 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 306 transitions. [2024-11-19 06:55:05,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:55:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 306 transitions. [2024-11-19 06:55:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 06:55:05,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:05,133 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:05,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:55:05,133 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:55:05,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:05,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1007935235, now seen corresponding path program 1 times [2024-11-19 06:55:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:05,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926908494] [2024-11-19 06:55:05,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:05,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:05,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:05,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926908494] [2024-11-19 06:55:05,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926908494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:05,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973770436] [2024-11-19 06:55:05,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:05,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:05,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:05,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:05,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:55:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:05,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 06:55:05,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:05,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-19 06:55:05,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:05,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:05,655 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 20 treesize of output 14 [2024-11-19 06:55:05,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:05,667 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:05,681 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:55:05,681 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 19 treesize of output 18 [2024-11-19 06:55:05,690 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-19 06:55:05,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2024-11-19 06:55:05,702 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-11-19 06:55:05,712 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-19 06:55:05,712 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 1 case distinctions, treesize of input 17 treesize of output 1 [2024-11-19 06:55:05,737 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-11-19 06:55:05,740 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-11-19 06:55:05,770 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (and (= |c_#length| (store |c_old(#length)| |chain_node_~node~0#1.base| (select |c_#length| |chain_node_~node~0#1.base|))) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2024-11-19 06:55:05,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:05,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:55:05,802 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 06:55:05,802 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 16 treesize of output 18 [2024-11-19 06:55:05,829 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-11-19 06:55:05,834 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#length| |chain_node_alloc_node_~ptr~0#1.base|)) |c_#length|))) is different from true [2024-11-19 06:55:05,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:05,873 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-11-19 06:55:05,898 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-11-19 06:55:05,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:05,952 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-11-19 06:55:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2024-11-19 06:55:05,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:06,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973770436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:06,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:55:06,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2024-11-19 06:55:06,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672162921] [2024-11-19 06:55:06,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:06,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:55:06,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:06,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:55:06,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=191, Unknown=2, NotChecked=58, Total=306 [2024-11-19 06:55:06,069 INFO L87 Difference]: Start difference. First operand 247 states and 306 transitions. Second operand has 16 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:55:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:06,626 INFO L93 Difference]: Finished difference Result 242 states and 297 transitions. [2024-11-19 06:55:06,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:55:06,627 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2024-11-19 06:55:06,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:06,628 INFO L225 Difference]: With dead ends: 242 [2024-11-19 06:55:06,628 INFO L226 Difference]: Without dead ends: 242 [2024-11-19 06:55:06,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=337, Unknown=2, NotChecked=78, Total=506 [2024-11-19 06:55:06,628 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 348 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 391 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:06,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 440 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 915 Invalid, 0 Unknown, 391 Unchecked, 0.4s Time] [2024-11-19 06:55:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-19 06:55:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2024-11-19 06:55:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 172 states have (on average 1.4825581395348837) internal successors, (255), 220 states have internal predecessors, (255), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 06:55:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 293 transitions. [2024-11-19 06:55:06,633 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 293 transitions. Word has length 59 [2024-11-19 06:55:06,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:06,633 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 293 transitions. [2024-11-19 06:55:06,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:55:06,633 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 293 transitions. [2024-11-19 06:55:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 06:55:06,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:06,634 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:06,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:55:06,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:06,835 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:55:06,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:06,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1384284051, now seen corresponding path program 1 times [2024-11-19 06:55:06,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:06,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146493456] [2024-11-19 06:55:06,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:06,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 06:55:07,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:07,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146493456] [2024-11-19 06:55:07,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146493456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:07,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277902001] [2024-11-19 06:55:07,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:07,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:07,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:07,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:07,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:55:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:07,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 06:55:07,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:07,511 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-11-19 06:55:07,615 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:07,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:55:07,617 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 16 treesize of output 11 [2024-11-19 06:55:07,641 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-11-19 06:55:07,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:07,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:55:07,784 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 16 treesize of output 11 [2024-11-19 06:55:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:55:07,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:07,816 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 26 [2024-11-19 06:55:07,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-19 06:55:07,922 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 26 treesize of output 24 [2024-11-19 06:55:08,013 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 26 [2024-11-19 06:55:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 06:55:08,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277902001] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:55:08,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:55:08,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 31 [2024-11-19 06:55:08,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041762415] [2024-11-19 06:55:08,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:08,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 06:55:08,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:08,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 06:55:08,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2024-11-19 06:55:08,301 INFO L87 Difference]: Start difference. First operand 240 states and 293 transitions. Second operand has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 30 states have internal predecessors, (108), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-19 06:55:12,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:55:16,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:55:20,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:55:24,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:55:28,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:55:32,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:55:36,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:55:40,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:55:44,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:55:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:45,326 INFO L93 Difference]: Finished difference Result 283 states and 338 transitions. [2024-11-19 06:55:45,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 06:55:45,327 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 30 states have internal predecessors, (108), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 66 [2024-11-19 06:55:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:45,328 INFO L225 Difference]: With dead ends: 283 [2024-11-19 06:55:45,328 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 06:55:45,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=1958, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 06:55:45,329 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 385 mSDsluCounter, 3581 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 25 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 3748 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:45,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 3748 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1357 Invalid, 9 Unknown, 0 Unchecked, 36.7s Time] [2024-11-19 06:55:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 06:55:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 266. [2024-11-19 06:55:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 196 states have (on average 1.4591836734693877) internal successors, (286), 244 states have internal predecessors, (286), 23 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 06:55:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2024-11-19 06:55:45,338 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 66 [2024-11-19 06:55:45,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:45,339 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2024-11-19 06:55:45,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 30 states have internal predecessors, (108), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-19 06:55:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2024-11-19 06:55:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 06:55:45,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:45,341 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:45,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:55:45,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 06:55:45,543 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:55:45,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:45,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1374309996, now seen corresponding path program 1 times [2024-11-19 06:55:45,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:45,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405036711] [2024-11-19 06:55:45,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:45,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:55:46,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:46,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405036711] [2024-11-19 06:55:46,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405036711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:46,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187886179] [2024-11-19 06:55:46,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:46,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:46,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:46,190 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:46,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:55:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:46,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-19 06:55:46,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:46,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:55:46,673 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-19 06:55:46,674 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 25 treesize of output 29 [2024-11-19 06:55:46,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-19 06:55:46,844 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 29 treesize of output 17 [2024-11-19 06:55:46,847 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-11-19 06:55:46,911 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1))) is different from true [2024-11-19 06:55:46,922 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 29 treesize of output 17 [2024-11-19 06:55:46,937 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-19 06:55:46,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 26 [2024-11-19 06:55:47,039 INFO L349 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2024-11-19 06:55:47,039 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 3 case distinctions, treesize of input 28 treesize of output 28 [2024-11-19 06:55:47,103 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:47,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:55:47,105 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 17 treesize of output 12 [2024-11-19 06:55:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2024-11-19 06:55:47,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:47,450 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 32 treesize of output 28 [2024-11-19 06:55:47,483 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 26 [2024-11-19 06:55:47,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187886179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:47,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:55:47,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 36 [2024-11-19 06:55:47,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663701502] [2024-11-19 06:55:47,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:47,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-19 06:55:47,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:47,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-19 06:55:47,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1627, Unknown=1, NotChecked=82, Total=1892 [2024-11-19 06:55:47,669 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand has 37 states, 35 states have (on average 3.142857142857143) internal successors, (110), 35 states have internal predecessors, (110), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:55:48,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:48,906 INFO L93 Difference]: Finished difference Result 272 states and 327 transitions. [2024-11-19 06:55:48,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 06:55:48,907 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 3.142857142857143) internal successors, (110), 35 states have internal predecessors, (110), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2024-11-19 06:55:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:48,908 INFO L225 Difference]: With dead ends: 272 [2024-11-19 06:55:48,908 INFO L226 Difference]: Without dead ends: 272 [2024-11-19 06:55:48,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=320, Invalid=2653, Unknown=1, NotChecked=106, Total=3080 [2024-11-19 06:55:48,909 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 449 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 2372 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:48,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1302 Invalid, 2688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2372 Invalid, 0 Unknown, 221 Unchecked, 1.0s Time] [2024-11-19 06:55:48,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-19 06:55:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2024-11-19 06:55:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 196 states have (on average 1.4540816326530612) internal successors, (285), 244 states have internal predecessors, (285), 23 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 06:55:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 323 transitions. [2024-11-19 06:55:48,915 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 323 transitions. Word has length 66 [2024-11-19 06:55:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:48,915 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 323 transitions. [2024-11-19 06:55:48,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 3.142857142857143) internal successors, (110), 35 states have internal predecessors, (110), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:55:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 323 transitions. [2024-11-19 06:55:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 06:55:48,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:48,916 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:48,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:55:49,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 06:55:49,117 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:55:49,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1374309997, now seen corresponding path program 1 times [2024-11-19 06:55:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:49,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549839037] [2024-11-19 06:55:49,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:49,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:55:49,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:49,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549839037] [2024-11-19 06:55:49,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549839037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:49,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212257314] [2024-11-19 06:55:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:49,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:49,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:49,853 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:49,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:55:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:50,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-19 06:55:50,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:50,096 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-11-19 06:55:50,108 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-11-19 06:55:50,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:55:50,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:55:50,397 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:50,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 06:55:50,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:50,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:55:50,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2024-11-19 06:55:50,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:55:50,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:55:50,507 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-11-19 06:55:50,509 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-11-19 06:55:50,613 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|chain_node_~node~0#1.base| Int)) (and (= |c_#length| (store |c_old(#length)| |chain_node_~node~0#1.base| (select |c_#length| |chain_node_~node~0#1.base|))) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_13| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_13|) 0) 0))) is different from true [2024-11-19 06:55:50,649 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 06:55:50,649 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-11-19 06:55:50,653 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-11-19 06:55:50,768 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:50,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 06:55:50,773 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:50,773 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:50,779 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2024-11-19 06:55:50,779 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 22 treesize of output 13 [2024-11-19 06:55:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-19 06:55:50,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:51,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212257314] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:51,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:55:51,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2024-11-19 06:55:51,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152200037] [2024-11-19 06:55:51,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:51,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 06:55:51,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:51,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 06:55:51,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1163, Unknown=1, NotChecked=68, Total=1332 [2024-11-19 06:55:51,065 INFO L87 Difference]: Start difference. First operand 266 states and 323 transitions. Second operand has 32 states, 31 states have (on average 3.193548387096774) internal successors, (99), 29 states have internal predecessors, (99), 5 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:55:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:53,558 INFO L93 Difference]: Finished difference Result 376 states and 421 transitions. [2024-11-19 06:55:53,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 06:55:53,558 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.193548387096774) internal successors, (99), 29 states have internal predecessors, (99), 5 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 66 [2024-11-19 06:55:53,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:53,560 INFO L225 Difference]: With dead ends: 376 [2024-11-19 06:55:53,560 INFO L226 Difference]: Without dead ends: 376 [2024-11-19 06:55:53,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=249, Invalid=2834, Unknown=1, NotChecked=108, Total=3192 [2024-11-19 06:55:53,561 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 322 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 3624 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 4047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:53,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1646 Invalid, 4047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3624 Invalid, 0 Unknown, 385 Unchecked, 1.8s Time] [2024-11-19 06:55:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-19 06:55:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 321. [2024-11-19 06:55:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 246 states have (on average 1.4471544715447155) internal successors, (356), 295 states have internal predecessors, (356), 24 states have call successors, (24), 10 states have call predecessors, (24), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 06:55:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 396 transitions. [2024-11-19 06:55:53,567 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 396 transitions. Word has length 66 [2024-11-19 06:55:53,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:53,567 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 396 transitions. [2024-11-19 06:55:53,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.193548387096774) internal successors, (99), 29 states have internal predecessors, (99), 5 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:55:53,567 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 396 transitions. [2024-11-19 06:55:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 06:55:53,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:53,568 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:53,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 06:55:53,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 06:55:53,769 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-19 06:55:53,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:53,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2128471491, now seen corresponding path program 1 times [2024-11-19 06:55:53,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:53,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098931840] [2024-11-19 06:55:53,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:53,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 06:55:54,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:54,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098931840] [2024-11-19 06:55:54,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098931840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:54,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083039749] [2024-11-19 06:55:54,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:54,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:54,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:54,090 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:54,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:55:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:54,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 06:55:54,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:54,357 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-11-19 06:55:54,440 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:54,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:55:54,442 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 16 treesize of output 11 [2024-11-19 06:55:54,462 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-11-19 06:55:54,700 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:54,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:55:54,702 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 16 treesize of output 11 [2024-11-19 06:55:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 06:55:54,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:54,741 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 26 [2024-11-19 06:55:54,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-19 06:55:54,837 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 26 treesize of output 24 [2024-11-19 06:55:54,909 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 26 [2024-11-19 06:55:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 06:55:55,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083039749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:55:55,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:55:55,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 31 [2024-11-19 06:55:55,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415344829] [2024-11-19 06:55:55,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:55,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 06:55:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:55,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 06:55:55,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2024-11-19 06:55:55,072 INFO L87 Difference]: Start difference. First operand 321 states and 396 transitions. Second operand has 31 states, 27 states have (on average 3.925925925925926) internal successors, (106), 30 states have internal predecessors, (106), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 06:55:59,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:56:03,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:56:07,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:56:11,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:56:15,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:56:19,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:56:23,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:56:27,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]