./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:14:56,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:14:56,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 18:14:56,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:14:56,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:14:56,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:14:56,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:14:56,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:14:56,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:14:56,298 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:14:56,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:14:56,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:14:56,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:14:56,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:14:56,306 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:14:56,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:14:56,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:14:56,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:14:56,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:14:56,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:14:56,307 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:14:56,308 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:14:56,308 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:14:56,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:14:56,308 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:14:56,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:14:56,309 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:14:56,309 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:14:56,309 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:14:56,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:14:56,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:14:56,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:14:56,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:14:56,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:14:56,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:14:56,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:14:56,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:14:56,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:14:56,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:14:56,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:14:56,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:14:56,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:14:56,315 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2024-10-14 18:14:56,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:14:56,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:14:56,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:14:56,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:14:56,638 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:14:56,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-10-14 18:14:58,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:14:58,320 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:14:58,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-10-14 18:14:58,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfa5aa35/c4ccf21fbe864701874fc128103204d0/FLAG86fadb123 [2024-10-14 18:14:58,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfa5aa35/c4ccf21fbe864701874fc128103204d0 [2024-10-14 18:14:58,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:14:58,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:14:58,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:14:58,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:14:58,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:14:58,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54935e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58, skipping insertion in model container [2024-10-14 18:14:58,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:14:58,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:14:58,781 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:14:58,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:14:58,865 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:14:58,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58 WrapperNode [2024-10-14 18:14:58,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:14:58,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:14:58,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:14:58,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:14:58,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,913 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 169 [2024-10-14 18:14:58,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:14:58,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:14:58,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:14:58,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:14:58,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,959 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 10, 16]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 1, 7]. [2024-10-14 18:14:58,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:14:58,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:14:58,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:14:58,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:14:58,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58" (1/1) ... [2024-10-14 18:14:58,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:14:58,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:59,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 18:14:59,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 18:14:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 18:14:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 18:14:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 18:14:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 18:14:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 18:14:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 18:14:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-14 18:14:59,064 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-14 18:14:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:14:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 18:14:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 18:14:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:14:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 18:14:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 18:14:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:14:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 18:14:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 18:14:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:14:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 18:14:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 18:14:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 18:14:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 18:14:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 18:14:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 18:14:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:14:59,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:14:59,215 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:14:59,217 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:14:59,545 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-14 18:14:59,546 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:14:59,603 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:14:59,604 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-14 18:14:59,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:14:59 BoogieIcfgContainer [2024-10-14 18:14:59,608 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:14:59,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:14:59,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:14:59,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:14:59,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:14:58" (1/3) ... [2024-10-14 18:14:59,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f98ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:14:59, skipping insertion in model container [2024-10-14 18:14:59,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:58" (2/3) ... [2024-10-14 18:14:59,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f98ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:14:59, skipping insertion in model container [2024-10-14 18:14:59,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:14:59" (3/3) ... [2024-10-14 18:14:59,617 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2024-10-14 18:14:59,634 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:14:59,634 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-10-14 18:14:59,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:14:59,677 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;@595671cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:14:59,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-10-14 18:14:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 55 states have (on average 2.3636363636363638) internal successors, (130), 113 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:14:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 18:14:59,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:59,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 18:14:59,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:14:59,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:59,690 INFO L85 PathProgramCache]: Analyzing trace with hash 256229600, now seen corresponding path program 1 times [2024-10-14 18:14:59,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:59,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567399814] [2024-10-14 18:14:59,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:59,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:59,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567399814] [2024-10-14 18:14:59,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567399814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:59,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:59,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:14:59,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138432124] [2024-10-14 18:14:59,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:59,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:14:59,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:14:59,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:14:59,880 INFO L87 Difference]: Start difference. First operand has 118 states, 55 states have (on average 2.3636363636363638) internal successors, (130), 113 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:59,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:59,971 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2024-10-14 18:14:59,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:14:59,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 18:14:59,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:59,978 INFO L225 Difference]: With dead ends: 115 [2024-10-14 18:14:59,978 INFO L226 Difference]: Without dead ends: 113 [2024-10-14 18:15:00,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:15:00,012 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:00,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 171 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-14 18:15:00,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-14 18:15:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 53 states have (on average 2.207547169811321) internal successors, (117), 108 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2024-10-14 18:15:00,045 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 5 [2024-10-14 18:15:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:00,046 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2024-10-14 18:15:00,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2024-10-14 18:15:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 18:15:00,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:00,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 18:15:00,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 18:15:00,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:00,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash 256229601, now seen corresponding path program 1 times [2024-10-14 18:15:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:00,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777013401] [2024-10-14 18:15:00,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:00,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:00,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:00,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777013401] [2024-10-14 18:15:00,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777013401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:00,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:00,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:15:00,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904777780] [2024-10-14 18:15:00,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:00,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:15:00,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:00,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:15:00,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:15:00,290 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:00,408 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-10-14 18:15:00,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:15:00,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 18:15:00,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:00,410 INFO L225 Difference]: With dead ends: 111 [2024-10-14 18:15:00,411 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 18:15:00,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:15:00,412 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:00,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 175 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 18:15:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-14 18:15:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 53 states have (on average 2.169811320754717) internal successors, (115), 106 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2024-10-14 18:15:00,433 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 5 [2024-10-14 18:15:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:00,433 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-10-14 18:15:00,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2024-10-14 18:15:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 18:15:00,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:00,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:00,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 18:15:00,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:00,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash -523509657, now seen corresponding path program 1 times [2024-10-14 18:15:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465766625] [2024-10-14 18:15:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:00,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:00,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:00,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:00,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465766625] [2024-10-14 18:15:00,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465766625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:00,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:00,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:15:00,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821092023] [2024-10-14 18:15:00,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:00,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:15:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:00,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:15:00,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:15:00,554 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:15:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:00,668 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-10-14 18:15:00,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:15:00,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-14 18:15:00,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:00,669 INFO L225 Difference]: With dead ends: 112 [2024-10-14 18:15:00,669 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 18:15:00,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:15:00,670 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:00,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 241 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 18:15:00,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-14 18:15:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 54 states have (on average 2.1481481481481484) internal successors, (116), 107 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2024-10-14 18:15:00,677 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 10 [2024-10-14 18:15:00,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:00,678 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2024-10-14 18:15:00,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:15:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2024-10-14 18:15:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 18:15:00,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:00,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:00,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 18:15:00,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:00,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:00,679 INFO L85 PathProgramCache]: Analyzing trace with hash -439189455, now seen corresponding path program 1 times [2024-10-14 18:15:00,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:00,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797530761] [2024-10-14 18:15:00,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:00,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:00,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:00,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:00,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:00,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797530761] [2024-10-14 18:15:00,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797530761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:00,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:00,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:15:00,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147485667] [2024-10-14 18:15:00,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:00,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:15:00,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:00,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:15:00,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:00,809 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:15:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:01,013 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-10-14 18:15:01,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:01,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-14 18:15:01,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:01,015 INFO L225 Difference]: With dead ends: 111 [2024-10-14 18:15:01,016 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 18:15:01,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:01,017 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:01,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 371 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:15:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 18:15:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-14 18:15:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 106 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2024-10-14 18:15:01,027 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 17 [2024-10-14 18:15:01,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:01,028 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-10-14 18:15:01,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:15:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2024-10-14 18:15:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 18:15:01,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:01,028 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:01,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 18:15:01,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:01,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:01,031 INFO L85 PathProgramCache]: Analyzing trace with hash -439189454, now seen corresponding path program 1 times [2024-10-14 18:15:01,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:01,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854916333] [2024-10-14 18:15:01,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:01,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:01,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854916333] [2024-10-14 18:15:01,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854916333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:01,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:01,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:15:01,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043294427] [2024-10-14 18:15:01,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:01,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:15:01,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:01,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:15:01,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:01,272 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:15:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:01,470 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2024-10-14 18:15:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:01,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-14 18:15:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:01,472 INFO L225 Difference]: With dead ends: 110 [2024-10-14 18:15:01,472 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 18:15:01,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:01,474 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:01,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:15:01,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 18:15:01,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-14 18:15:01,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 54 states have (on average 2.111111111111111) internal successors, (114), 105 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2024-10-14 18:15:01,486 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 17 [2024-10-14 18:15:01,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:01,487 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2024-10-14 18:15:01,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:15:01,488 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2024-10-14 18:15:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 18:15:01,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:01,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:01,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 18:15:01,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:01,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:01,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1154053696, now seen corresponding path program 1 times [2024-10-14 18:15:01,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:01,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99529318] [2024-10-14 18:15:01,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:01,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:15:01,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99529318] [2024-10-14 18:15:01,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99529318] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:01,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88373392] [2024-10-14 18:15:01,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:01,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:01,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:01,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:01,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 18:15:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 18:15:01,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:01,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:02,013 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-14 18:15:02,044 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:15:02,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 18:15:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-14 18:15:02,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:02,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88373392] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:02,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:02,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-10-14 18:15:02,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646237032] [2024-10-14 18:15:02,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:02,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 18:15:02,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:02,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 18:15:02,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-10-14 18:15:02,221 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:15:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:02,448 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2024-10-14 18:15:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:02,449 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2024-10-14 18:15:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:02,449 INFO L225 Difference]: With dead ends: 109 [2024-10-14 18:15:02,449 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 18:15:02,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-10-14 18:15:02,451 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:02,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 378 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 320 Invalid, 0 Unknown, 114 Unchecked, 0.2s Time] [2024-10-14 18:15:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 18:15:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-14 18:15:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 104 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2024-10-14 18:15:02,461 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 19 [2024-10-14 18:15:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:02,462 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2024-10-14 18:15:02,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:15:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2024-10-14 18:15:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 18:15:02,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:02,462 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:02,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:02,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 18:15:02,664 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:02,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1154053695, now seen corresponding path program 1 times [2024-10-14 18:15:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:02,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651997783] [2024-10-14 18:15:02,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:02,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:02,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:02,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651997783] [2024-10-14 18:15:03,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651997783] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486209577] [2024-10-14 18:15:03,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:03,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:03,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:03,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:03,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 18:15:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:03,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-14 18:15:03,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:03,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:15:03,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:03,281 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:03,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:15:03,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:15:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:03,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:03,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486209577] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:03,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:03,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2024-10-14 18:15:03,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496447296] [2024-10-14 18:15:03,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:03,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 18:15:03,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:03,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 18:15:03,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-14 18:15:03,416 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 14 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:03,823 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2024-10-14 18:15:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:15:03,823 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-14 18:15:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:03,824 INFO L225 Difference]: With dead ends: 110 [2024-10-14 18:15:03,824 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 18:15:03,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-10-14 18:15:03,825 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:03,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 634 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:15:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 18:15:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2024-10-14 18:15:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 54 states have (on average 2.074074074074074) internal successors, (112), 103 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2024-10-14 18:15:03,838 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 19 [2024-10-14 18:15:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:03,839 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2024-10-14 18:15:03,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2024-10-14 18:15:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 18:15:03,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:03,840 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:03,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:04,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 18:15:04,044 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:04,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:04,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2095856878, now seen corresponding path program 1 times [2024-10-14 18:15:04,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:04,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137714281] [2024-10-14 18:15:04,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:04,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:04,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:04,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:04,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:15:04,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:04,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137714281] [2024-10-14 18:15:04,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137714281] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:04,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650588921] [2024-10-14 18:15:04,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:04,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:04,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:04,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:04,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 18:15:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:04,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 18:15:04,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:04,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:04,527 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:15:04,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-14 18:15:04,573 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:15:04,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-10-14 18:15:04,659 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-14 18:15:04,672 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:15:04,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 18:15:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2024-10-14 18:15:04,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:05,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650588921] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:05,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:05,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 25 [2024-10-14 18:15:05,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116874259] [2024-10-14 18:15:05,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:05,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 18:15:05,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:05,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 18:15:05,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=525, Unknown=1, NotChecked=48, Total=702 [2024-10-14 18:15:05,077 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 27 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-14 18:15:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:05,492 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2024-10-14 18:15:05,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:05,492 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 27 [2024-10-14 18:15:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:05,493 INFO L225 Difference]: With dead ends: 116 [2024-10-14 18:15:05,493 INFO L226 Difference]: Without dead ends: 116 [2024-10-14 18:15:05,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=652, Unknown=1, NotChecked=54, Total=870 [2024-10-14 18:15:05,494 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 190 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:05,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 403 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 624 Invalid, 0 Unknown, 122 Unchecked, 0.3s Time] [2024-10-14 18:15:05,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-14 18:15:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2024-10-14 18:15:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 94 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2024-10-14 18:15:05,498 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 27 [2024-10-14 18:15:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:05,498 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2024-10-14 18:15:05,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-14 18:15:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2024-10-14 18:15:05,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 18:15:05,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:05,499 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:05,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:05,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:05,704 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:05,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:05,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2095856877, now seen corresponding path program 1 times [2024-10-14 18:15:05,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:05,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079917009] [2024-10-14 18:15:05,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:05,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:05,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:06,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:06,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:15:06,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:06,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079917009] [2024-10-14 18:15:06,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079917009] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:06,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788651241] [2024-10-14 18:15:06,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:06,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:06,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:06,119 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:06,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 18:15:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:06,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 18:15:06,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:06,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:15:06,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:15:06,259 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-10-14 18:15:06,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:06,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:15:06,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:15:06,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:06,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:15:06,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:15:06,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:06,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:15:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 18:15:06,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:15:06,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788651241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:06,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:15:06,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-14 18:15:06,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838697510] [2024-10-14 18:15:06,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:06,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:15:06,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:06,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:15:06,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=123, Unknown=1, NotChecked=22, Total=182 [2024-10-14 18:15:06,377 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:06,478 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2024-10-14 18:15:06,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:06,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-10-14 18:15:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:06,479 INFO L225 Difference]: With dead ends: 94 [2024-10-14 18:15:06,480 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 18:15:06,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2024-10-14 18:15:06,480 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 20 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:06,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 222 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 125 Unchecked, 0.1s Time] [2024-10-14 18:15:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 18:15:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-14 18:15:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2024-10-14 18:15:06,483 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 27 [2024-10-14 18:15:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:06,484 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2024-10-14 18:15:06,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2024-10-14 18:15:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:15:06,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:06,484 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:06,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:06,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:06,689 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:06,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash 221202259, now seen corresponding path program 1 times [2024-10-14 18:15:06,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:06,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765907544] [2024-10-14 18:15:06,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:06,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:06,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:06,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 18:15:06,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:06,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765907544] [2024-10-14 18:15:06,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765907544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:06,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:06,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:15:06,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255398395] [2024-10-14 18:15:06,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:06,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:15:06,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:06,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:15:06,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:06,790 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:15:06,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:06,927 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2024-10-14 18:15:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:06,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-10-14 18:15:06,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:06,929 INFO L225 Difference]: With dead ends: 92 [2024-10-14 18:15:06,929 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 18:15:06,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:06,929 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 17 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:06,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 300 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 18:15:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-14 18:15:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2024-10-14 18:15:06,933 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 29 [2024-10-14 18:15:06,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:06,933 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2024-10-14 18:15:06,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:15:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2024-10-14 18:15:06,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:15:06,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:06,934 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:06,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 18:15:06,934 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:06,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash 221202260, now seen corresponding path program 1 times [2024-10-14 18:15:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:06,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347058070] [2024-10-14 18:15:06,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:06,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:07,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:07,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:07,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:15:07,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:07,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347058070] [2024-10-14 18:15:07,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347058070] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:07,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761753797] [2024-10-14 18:15:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:07,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:07,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:07,091 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:07,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 18:15:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:07,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 18:15:07,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:07,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:15:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:15:07,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:15:07,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761753797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:07,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:15:07,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-14 18:15:07,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870109542] [2024-10-14 18:15:07,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:07,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:15:07,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:07,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:15:07,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-14 18:15:07,295 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:15:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:07,402 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2024-10-14 18:15:07,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:15:07,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-10-14 18:15:07,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:07,403 INFO L225 Difference]: With dead ends: 90 [2024-10-14 18:15:07,403 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 18:15:07,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-14 18:15:07,404 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 16 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:07,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 275 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 18:15:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-14 18:15:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2024-10-14 18:15:07,408 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 29 [2024-10-14 18:15:07,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:07,409 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2024-10-14 18:15:07,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:15:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2024-10-14 18:15:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 18:15:07,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:07,411 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:07,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 18:15:07,615 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,SelfDestructingSolverStorable10 [2024-10-14 18:15:07,616 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:07,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:07,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1732650497, now seen corresponding path program 1 times [2024-10-14 18:15:07,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:07,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040910027] [2024-10-14 18:15:07,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:07,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:07,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:07,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:07,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:15:07,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:07,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040910027] [2024-10-14 18:15:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040910027] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:07,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724939192] [2024-10-14 18:15:07,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:07,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:07,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:07,875 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:07,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 18:15:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 18:15:08,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:08,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:15:08,157 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-14 18:15:08,182 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-14 18:15:08,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-10-14 18:15:08,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 18:15:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-14 18:15:08,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:08,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724939192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:08,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:08,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2024-10-14 18:15:08,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203276551] [2024-10-14 18:15:08,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:08,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 18:15:08,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:08,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 18:15:08,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=334, Unknown=1, NotChecked=36, Total=420 [2024-10-14 18:15:08,245 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 20 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:15:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:08,700 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2024-10-14 18:15:08,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 18:15:08,701 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2024-10-14 18:15:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:08,701 INFO L225 Difference]: With dead ends: 92 [2024-10-14 18:15:08,701 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 18:15:08,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=663, Unknown=1, NotChecked=52, Total=812 [2024-10-14 18:15:08,702 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 78 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:08,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 692 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 767 Invalid, 0 Unknown, 100 Unchecked, 0.3s Time] [2024-10-14 18:15:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 18:15:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-10-14 18:15:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.709090909090909) internal successors, (94), 84 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2024-10-14 18:15:08,705 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 30 [2024-10-14 18:15:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:08,705 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2024-10-14 18:15:08,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:15:08,705 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2024-10-14 18:15:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 18:15:08,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:08,706 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:08,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 18:15:08,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:08,906 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:08,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:08,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1732650496, now seen corresponding path program 1 times [2024-10-14 18:15:08,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:08,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884842417] [2024-10-14 18:15:08,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:08,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:09,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:09,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:09,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:09,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884842417] [2024-10-14 18:15:09,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884842417] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847911498] [2024-10-14 18:15:09,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:09,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:09,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:09,308 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:09,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 18:15:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:09,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-14 18:15:09,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:09,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:15:09,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:15:09,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:15:09,726 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2024-10-14 18:15:09,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:09,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 18:15:09,766 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:15:09,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:15:09,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 18:15:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-14 18:15:09,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:09,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847911498] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:09,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:09,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2024-10-14 18:15:09,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881237951] [2024-10-14 18:15:09,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:09,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 18:15:09,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:09,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 18:15:09,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=579, Unknown=1, NotChecked=48, Total=702 [2024-10-14 18:15:09,979 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 24 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 20 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:15:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:10,514 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2024-10-14 18:15:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 18:15:10,515 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 20 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2024-10-14 18:15:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:10,516 INFO L225 Difference]: With dead ends: 99 [2024-10-14 18:15:10,516 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 18:15:10,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=1123, Unknown=1, NotChecked=68, Total=1332 [2024-10-14 18:15:10,517 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 102 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:10,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 586 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 711 Invalid, 0 Unknown, 106 Unchecked, 0.3s Time] [2024-10-14 18:15:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 18:15:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-14 18:15:10,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.619047619047619) internal successors, (102), 92 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2024-10-14 18:15:10,520 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 30 [2024-10-14 18:15:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:10,520 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2024-10-14 18:15:10,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 20 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:15:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2024-10-14 18:15:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 18:15:10,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:10,521 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:10,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:10,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:10,722 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:10,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:10,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1356677081, now seen corresponding path program 1 times [2024-10-14 18:15:10,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:10,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222274638] [2024-10-14 18:15:10,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:10,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:10,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:10,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:10,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:15:10,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:10,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222274638] [2024-10-14 18:15:10,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222274638] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:10,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812171481] [2024-10-14 18:15:10,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:10,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:10,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:10,950 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:10,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 18:15:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:11,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 18:15:11,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:11,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:15:11,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:11,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:15:11,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:15:11,187 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:11,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:15:11,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:15:11,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:15:11,278 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-10-14 18:15:11,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:11,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:15:11,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:15:11,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:11,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:15:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2024-10-14 18:15:11,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:11,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812171481] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:11,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:11,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 19 [2024-10-14 18:15:11,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946762558] [2024-10-14 18:15:11,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:11,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 18:15:11,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:11,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 18:15:11,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=328, Unknown=1, NotChecked=36, Total=420 [2024-10-14 18:15:11,452 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 19 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:15:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:11,858 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2024-10-14 18:15:11,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 18:15:11,858 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2024-10-14 18:15:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:11,859 INFO L225 Difference]: With dead ends: 95 [2024-10-14 18:15:11,859 INFO L226 Difference]: Without dead ends: 95 [2024-10-14 18:15:11,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=695, Unknown=1, NotChecked=54, Total=870 [2024-10-14 18:15:11,860 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 93 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:11,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 549 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 614 Invalid, 0 Unknown, 91 Unchecked, 0.3s Time] [2024-10-14 18:15:11,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-14 18:15:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-10-14 18:15:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-10-14 18:15:11,862 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 32 [2024-10-14 18:15:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:11,863 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-10-14 18:15:11,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:15:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-10-14 18:15:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:15:11,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:11,863 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:11,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:12,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 18:15:12,068 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:12,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1808062286, now seen corresponding path program 1 times [2024-10-14 18:15:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:12,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839295337] [2024-10-14 18:15:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:12,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:12,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:12,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:12,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:12,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839295337] [2024-10-14 18:15:12,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839295337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:12,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351425948] [2024-10-14 18:15:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:12,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:12,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:12,752 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:12,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 18:15:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:12,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-14 18:15:12,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:12,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:13,064 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:13,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:15:13,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:15:13,172 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-14 18:15:13,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2024-10-14 18:15:13,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-14 18:15:13,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:15:13,340 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int)) (<= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_65| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_65|) 0) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_65| (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_65| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_65|)) |c_#memory_$Pointer$#2.base|)))) is different from true [2024-10-14 18:15:13,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:13,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-10-14 18:15:13,369 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-10-14 18:15:13,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-10-14 18:15:13,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:15:13,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2024-10-14 18:15:13,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:15:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:15:13,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:13,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351425948] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:13,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:13,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2024-10-14 18:15:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335543059] [2024-10-14 18:15:13,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:13,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-14 18:15:13,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:13,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-14 18:15:13,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1435, Unknown=1, NotChecked=76, Total=1640 [2024-10-14 18:15:13,756 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 38 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:15:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:14,768 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2024-10-14 18:15:14,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 18:15:14,769 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-10-14 18:15:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:14,770 INFO L225 Difference]: With dead ends: 125 [2024-10-14 18:15:14,770 INFO L226 Difference]: Without dead ends: 125 [2024-10-14 18:15:14,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=267, Invalid=2706, Unknown=1, NotChecked=106, Total=3080 [2024-10-14 18:15:14,771 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 151 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:14,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1063 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1253 Invalid, 0 Unknown, 129 Unchecked, 0.6s Time] [2024-10-14 18:15:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-14 18:15:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2024-10-14 18:15:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 103 states have internal predecessors, (115), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2024-10-14 18:15:14,774 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 34 [2024-10-14 18:15:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:14,774 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2024-10-14 18:15:14,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:15:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2024-10-14 18:15:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:15:14,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:14,775 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:14,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 18:15:14,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 18:15:14,980 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:14,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1808062285, now seen corresponding path program 1 times [2024-10-14 18:15:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:14,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846207779] [2024-10-14 18:15:14,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:14,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:15,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:15,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:15,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:16,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:16,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846207779] [2024-10-14 18:15:16,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846207779] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:16,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381608924] [2024-10-14 18:15:16,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:16,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:16,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:16,440 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:16,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 18:15:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:16,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-10-14 18:15:16,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:16,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:16,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:16,916 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:15:16,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 18:15:16,927 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:16,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:15:17,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:15:17,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:15:17,090 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-14 18:15:17,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 60 [2024-10-14 18:15:17,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-10-14 18:15:17,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-14 18:15:17,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:15:17,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:15:17,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 18:15:17,312 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_7| Int)) (<= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_7|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_74| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_74| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_74|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_74| (select |c_#length| |v_node_create_~temp~0#1.base_74|)) |c_#length|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_74|) 0) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_74| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_74|)))))) is different from true [2024-10-14 18:15:17,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:17,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2024-10-14 18:15:17,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:17,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:17,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-10-14 18:15:17,345 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 18:15:17,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-14 18:15:17,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-14 18:15:17,589 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 57 treesize of output 33 [2024-10-14 18:15:17,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:17,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2024-10-14 18:15:17,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:15:17,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:15:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:15:17,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:18,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381608924] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:18,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:18,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2024-10-14 18:15:18,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450581039] [2024-10-14 18:15:18,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:18,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-14 18:15:18,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:18,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-14 18:15:18,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1746, Unknown=1, NotChecked=84, Total=1980 [2024-10-14 18:15:18,028 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand has 40 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:15:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:19,556 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2024-10-14 18:15:19,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 18:15:19,556 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-10-14 18:15:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:19,557 INFO L225 Difference]: With dead ends: 127 [2024-10-14 18:15:19,557 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 18:15:19,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=284, Invalid=3141, Unknown=1, NotChecked=114, Total=3540 [2024-10-14 18:15:19,558 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 131 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:19,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1056 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1380 Invalid, 0 Unknown, 131 Unchecked, 0.9s Time] [2024-10-14 18:15:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 18:15:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2024-10-14 18:15:19,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 102 states have internal predecessors, (113), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2024-10-14 18:15:19,561 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 34 [2024-10-14 18:15:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:19,561 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2024-10-14 18:15:19,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:15:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2024-10-14 18:15:19,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 18:15:19,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:19,562 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:19,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 18:15:19,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 18:15:19,763 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:19,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:19,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1010820581, now seen corresponding path program 2 times [2024-10-14 18:15:19,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:19,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647289455] [2024-10-14 18:15:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:20,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:20,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:20,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:20,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:20,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647289455] [2024-10-14 18:15:20,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647289455] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:20,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610043888] [2024-10-14 18:15:20,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:15:20,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:20,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:20,636 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:20,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 18:15:20,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 18:15:20,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:15:20,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-10-14 18:15:20,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:20,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:21,015 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:21,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:15:21,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:15:21,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:15:21,163 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-14 18:15:21,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 47 [2024-10-14 18:15:21,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-10-14 18:15:21,222 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 18:15:21,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 24 [2024-10-14 18:15:21,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 18:15:21,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:15:21,367 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_83| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_83| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_83|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_83|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_83| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_83|)) |c_#memory_$Pointer$#2.base|))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_8| Int)) (<= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_8|) 0) 0))) is different from true [2024-10-14 18:15:21,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:21,386 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-14 18:15:21,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 46 [2024-10-14 18:15:21,401 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 18:15:21,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-14 18:15:21,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-14 18:15:21,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:21,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2024-10-14 18:15:21,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 18:15:21,770 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 56 treesize of output 32 [2024-10-14 18:15:21,838 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:15:21,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2024-10-14 18:15:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:15:21,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:21,985 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2024-10-14 18:15:21,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2024-10-14 18:15:22,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610043888] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:22,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:22,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2024-10-14 18:15:22,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304252095] [2024-10-14 18:15:22,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:22,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-14 18:15:22,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:22,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-14 18:15:22,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2393, Unknown=1, NotChecked=98, Total=2652 [2024-10-14 18:15:22,185 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 46 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 39 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:15:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:23,846 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2024-10-14 18:15:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 18:15:23,846 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 39 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2024-10-14 18:15:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:23,847 INFO L225 Difference]: With dead ends: 117 [2024-10-14 18:15:23,847 INFO L226 Difference]: Without dead ends: 117 [2024-10-14 18:15:23,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=372, Invalid=4461, Unknown=1, NotChecked=136, Total=4970 [2024-10-14 18:15:23,848 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 118 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:23,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1440 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1484 Invalid, 0 Unknown, 119 Unchecked, 0.8s Time] [2024-10-14 18:15:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-14 18:15:23,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2024-10-14 18:15:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.45) internal successors, (116), 105 states have internal predecessors, (116), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:23,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2024-10-14 18:15:23,851 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 38 [2024-10-14 18:15:23,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:23,851 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2024-10-14 18:15:23,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 39 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:15:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2024-10-14 18:15:23,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 18:15:23,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:23,852 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:23,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 18:15:24,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 18:15:24,056 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:24,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:24,057 INFO L85 PathProgramCache]: Analyzing trace with hash 807284210, now seen corresponding path program 1 times [2024-10-14 18:15:24,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:24,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318143903] [2024-10-14 18:15:24,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:24,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 18:15:24,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:24,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318143903] [2024-10-14 18:15:24,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318143903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:24,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:24,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 18:15:24,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951525155] [2024-10-14 18:15:24,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:24,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:15:24,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:24,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:15:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:15:24,271 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:24,400 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2024-10-14 18:15:24,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:15:24,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-10-14 18:15:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:24,402 INFO L225 Difference]: With dead ends: 119 [2024-10-14 18:15:24,402 INFO L226 Difference]: Without dead ends: 119 [2024-10-14 18:15:24,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:15:24,402 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 64 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:24,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 291 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-14 18:15:24,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2024-10-14 18:15:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 105 states have internal predecessors, (117), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2024-10-14 18:15:24,406 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 39 [2024-10-14 18:15:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:24,407 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2024-10-14 18:15:24,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2024-10-14 18:15:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 18:15:24,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:24,408 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:24,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 18:15:24,408 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:24,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash 807284211, now seen corresponding path program 1 times [2024-10-14 18:15:24,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:24,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654412077] [2024-10-14 18:15:24,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:24,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:15:24,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:24,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654412077] [2024-10-14 18:15:24,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654412077] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:24,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815655697] [2024-10-14 18:15:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:24,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:24,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:24,685 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:24,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 18:15:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 18:15:24,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:24,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:15:25,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:15:25,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:15:25,049 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_16|) 0))) is different from true [2024-10-14 18:15:25,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:25,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 18:15:25,078 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:15:25,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:15:25,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 18:15:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-14 18:15:25,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815655697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:25,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:25,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2024-10-14 18:15:25,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108136662] [2024-10-14 18:15:25,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:25,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 18:15:25,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:25,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 18:15:25,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=582, Unknown=1, NotChecked=48, Total=702 [2024-10-14 18:15:25,309 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 24 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:15:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:25,946 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2024-10-14 18:15:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 18:15:25,947 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2024-10-14 18:15:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:25,948 INFO L225 Difference]: With dead ends: 130 [2024-10-14 18:15:25,948 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 18:15:25,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=1399, Unknown=1, NotChecked=76, Total=1640 [2024-10-14 18:15:25,949 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 116 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:25,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 796 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 967 Invalid, 0 Unknown, 118 Unchecked, 0.4s Time] [2024-10-14 18:15:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 18:15:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 117. [2024-10-14 18:15:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 108 states have internal predecessors, (120), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2024-10-14 18:15:25,951 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 39 [2024-10-14 18:15:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:25,951 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2024-10-14 18:15:25,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:15:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2024-10-14 18:15:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:15:25,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:25,952 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:25,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-14 18:15:26,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:26,153 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:26,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:26,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2012889794, now seen corresponding path program 1 times [2024-10-14 18:15:26,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:26,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649187340] [2024-10-14 18:15:26,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:26,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:26,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:26,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:26,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 18:15:26,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:26,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649187340] [2024-10-14 18:15:26,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649187340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:26,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:26,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:15:26,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544244130] [2024-10-14 18:15:26,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:26,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:15:26,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:26,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:15:26,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:15:26,231 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:15:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:26,328 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2024-10-14 18:15:26,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:15:26,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-10-14 18:15:26,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:26,329 INFO L225 Difference]: With dead ends: 134 [2024-10-14 18:15:26,330 INFO L226 Difference]: Without dead ends: 134 [2024-10-14 18:15:26,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:15:26,331 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 55 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:26,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 268 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:26,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-14 18:15:26,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 117. [2024-10-14 18:15:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 85 states have (on average 1.423529411764706) internal successors, (121), 108 states have internal predecessors, (121), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2024-10-14 18:15:26,337 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 42 [2024-10-14 18:15:26,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:26,337 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2024-10-14 18:15:26,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:15:26,337 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2024-10-14 18:15:26,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:15:26,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:26,337 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:26,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 18:15:26,337 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:26,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2012889793, now seen corresponding path program 1 times [2024-10-14 18:15:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809269943] [2024-10-14 18:15:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:26,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:26,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:26,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:26,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:26,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809269943] [2024-10-14 18:15:26,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809269943] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:26,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086717614] [2024-10-14 18:15:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:26,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:26,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:26,894 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:26,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 18:15:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:27,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-14 18:15:27,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:27,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:15:27,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:27,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:15:27,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:15:27,255 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_17| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_17|) 0))) is different from true [2024-10-14 18:15:27,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:27,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 18:15:27,279 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:15:27,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:15:27,356 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 18:15:27,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:15:27,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 18:15:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-14 18:15:27,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:27,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086717614] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:27,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:27,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2024-10-14 18:15:27,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860425524] [2024-10-14 18:15:27,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:27,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 18:15:27,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:27,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 18:15:27,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=778, Unknown=1, NotChecked=56, Total=930 [2024-10-14 18:15:27,570 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 28 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 24 states have internal predecessors, (63), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:15:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:28,245 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2024-10-14 18:15:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 18:15:28,246 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 24 states have internal predecessors, (63), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-10-14 18:15:28,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:28,246 INFO L225 Difference]: With dead ends: 131 [2024-10-14 18:15:28,246 INFO L226 Difference]: Without dead ends: 131 [2024-10-14 18:15:28,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=1314, Unknown=1, NotChecked=74, Total=1560 [2024-10-14 18:15:28,248 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 178 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:28,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 645 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 882 Invalid, 0 Unknown, 116 Unchecked, 0.4s Time] [2024-10-14 18:15:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-14 18:15:28,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2024-10-14 18:15:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 110 states have internal predecessors, (123), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2024-10-14 18:15:28,253 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 42 [2024-10-14 18:15:28,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:28,253 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2024-10-14 18:15:28,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 24 states have internal predecessors, (63), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:15:28,254 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2024-10-14 18:15:28,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 18:15:28,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:28,254 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:28,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:28,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-14 18:15:28,455 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:28,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash 675649291, now seen corresponding path program 3 times [2024-10-14 18:15:28,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:28,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667275305] [2024-10-14 18:15:28,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:28,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:28,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:28,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:28,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 18:15:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:28,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 18:15:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 18:15:28,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:28,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667275305] [2024-10-14 18:15:28,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667275305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:28,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:28,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:15:28,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922795751] [2024-10-14 18:15:28,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:28,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:15:28,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:28,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:15:28,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:15:28,538 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:15:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:28,595 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2024-10-14 18:15:28,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:15:28,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2024-10-14 18:15:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:28,596 INFO L225 Difference]: With dead ends: 91 [2024-10-14 18:15:28,597 INFO L226 Difference]: Without dead ends: 91 [2024-10-14 18:15:28,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:15:28,597 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:28,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-14 18:15:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-14 18:15:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-10-14 18:15:28,600 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 43 [2024-10-14 18:15:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:28,600 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-10-14 18:15:28,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:15:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-10-14 18:15:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 18:15:28,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:28,601 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:28,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 18:15:28,601 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:28,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2024931378, now seen corresponding path program 1 times [2024-10-14 18:15:28,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:28,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063518150] [2024-10-14 18:15:28,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:28,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:29,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:29,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:15:29,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:29,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063518150] [2024-10-14 18:15:29,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063518150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:29,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992273749] [2024-10-14 18:15:29,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:29,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:29,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:29,202 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:29,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 18:15:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:29,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-10-14 18:15:29,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:29,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:29,537 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 18:15:29,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 18:15:29,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:15:29,644 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-14 18:15:29,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2024-10-14 18:15:29,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-14 18:15:29,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:15:29,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:29,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-10-14 18:15:29,862 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-10-14 18:15:29,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-10-14 18:15:30,342 INFO L349 Elim1Store]: treesize reduction 67, result has 33.0 percent of original size [2024-10-14 18:15:30,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 57 [2024-10-14 18:15:30,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-10-14 18:15:31,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:31,096 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 103 treesize of output 79 [2024-10-14 18:15:31,147 INFO L349 Elim1Store]: treesize reduction 12, result has 83.6 percent of original size [2024-10-14 18:15:31,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 84 [2024-10-14 18:15:31,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-14 18:15:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:31,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:36,027 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_37| Int) (v_ArrVal_2876 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int) (v_ArrVal_2870 (Array Int Int)) (v_ArrVal_2869 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse2 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_37| v_ArrVal_2876) .cse1)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (< .cse0 0) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_37| 1) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse1 (store .cse2 .cse0 v_ArrVal_2869)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_37| v_ArrVal_2870) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1) (not (= (select .cse2 .cse0) .cse1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_37|) 0)))))) is different from false [2024-10-14 18:15:36,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992273749] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:36,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:36,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27] total 43 [2024-10-14 18:15:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637021576] [2024-10-14 18:15:36,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:36,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-14 18:15:36,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:36,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-14 18:15:36,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2443, Unknown=4, NotChecked=100, Total=2756 [2024-10-14 18:15:36,032 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 44 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 36 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:15:40,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:15:46,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:15:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:46,857 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2024-10-14 18:15:46,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 18:15:46,857 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 36 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2024-10-14 18:15:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:46,858 INFO L225 Difference]: With dead ends: 110 [2024-10-14 18:15:46,858 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 18:15:46,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=375, Invalid=3915, Unknown=4, NotChecked=128, Total=4422 [2024-10-14 18:15:46,859 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 177 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:46,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 851 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1295 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-10-14 18:15:46,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 18:15:46,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2024-10-14 18:15:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-10-14 18:15:46,862 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 43 [2024-10-14 18:15:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:46,862 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-10-14 18:15:46,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 36 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:15:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-10-14 18:15:46,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 18:15:46,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:46,863 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:46,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:47,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:47,067 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:47,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:47,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2018733152, now seen corresponding path program 1 times [2024-10-14 18:15:47,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:47,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138471885] [2024-10-14 18:15:47,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:47,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:49,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:49,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:50,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:50,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:50,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138471885] [2024-10-14 18:15:50,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138471885] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:50,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031391329] [2024-10-14 18:15:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:50,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:50,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:50,425 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:50,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-14 18:15:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:50,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-10-14 18:15:50,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:50,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:50,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:15:51,076 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 18:15:51,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 18:15:51,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:15:51,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:15:51,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:15:51,359 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-14 18:15:51,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 88 [2024-10-14 18:15:51,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2024-10-14 18:15:51,456 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 55 treesize of output 19 [2024-10-14 18:15:51,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2024-10-14 18:15:51,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:15:51,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:15:51,839 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 18:15:51,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2024-10-14 18:15:51,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:15:51,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:51,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 46 [2024-10-14 18:15:51,871 INFO L349 Elim1Store]: treesize reduction 37, result has 47.1 percent of original size [2024-10-14 18:15:51,871 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 1 case distinctions, treesize of input 26 treesize of output 37 [2024-10-14 18:15:51,894 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-14 18:15:51,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-10-14 18:15:52,239 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-10-14 18:15:52,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2024-10-14 18:15:52,255 INFO L349 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2024-10-14 18:15:52,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2024-10-14 18:15:52,467 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-14 18:15:52,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 95 [2024-10-14 18:15:52,486 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-14 18:15:52,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 126 [2024-10-14 18:15:52,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:15:52,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:15:52,790 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 158 treesize of output 110 [2024-10-14 18:15:52,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 82 [2024-10-14 18:15:53,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 51 [2024-10-14 18:15:53,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 7 treesize of output 3 [2024-10-14 18:15:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:53,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:54,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031391329] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:54,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:54,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 22] total 55 [2024-10-14 18:15:54,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548047565] [2024-10-14 18:15:54,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:54,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-14 18:15:54,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:54,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-14 18:15:54,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3646, Unknown=86, NotChecked=0, Total=3906 [2024-10-14 18:15:54,453 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 56 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 47 states have internal predecessors, (79), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:15:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:58,594 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2024-10-14 18:15:58,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 18:15:58,595 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 47 states have internal predecessors, (79), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2024-10-14 18:15:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:58,596 INFO L225 Difference]: With dead ends: 123 [2024-10-14 18:15:58,596 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 18:15:58,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=489, Invalid=6562, Unknown=89, NotChecked=0, Total=7140 [2024-10-14 18:15:58,597 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 305 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 2618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:58,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1632 Invalid, 2618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 18:15:58,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 18:15:58,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 95. [2024-10-14 18:15:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.4) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:58,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2024-10-14 18:15:58,604 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 47 [2024-10-14 18:15:58,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:58,604 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2024-10-14 18:15:58,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 47 states have internal predecessors, (79), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:15:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2024-10-14 18:15:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 18:15:58,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:58,605 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:58,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-14 18:15:58,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:58,806 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-14 18:15:58,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1784666426, now seen corresponding path program 1 times [2024-10-14 18:15:58,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:58,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236180059] [2024-10-14 18:15:58,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:59,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:59,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:59,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:59,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:59,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236180059] [2024-10-14 18:15:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236180059] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:59,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773525881] [2024-10-14 18:15:59,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:59,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:59,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:59,886 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:59,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-14 18:16:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:00,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-10-14 18:16:00,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:00,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:16:00,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 18:16:00,354 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 18:16:00,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 18:16:00,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:16:00,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:16:00,548 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-14 18:16:00,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 77 [2024-10-14 18:16:00,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 21 [2024-10-14 18:16:00,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-10-14 18:16:00,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-10-14 18:16:00,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:16:00,832 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 18:16:00,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-10-14 18:16:00,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 18:16:00,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:16:00,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-10-14 18:16:00,861 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-14 18:16:00,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-10-14 18:16:01,098 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-10-14 18:16:01,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2024-10-14 18:16:01,113 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 18:16:01,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-10-14 18:16:01,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 18:16:01,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 78 [2024-10-14 18:16:01,273 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-14 18:16:01,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 73 [2024-10-14 18:16:01,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:16:01,404 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 35 treesize of output 23 [2024-10-14 18:16:01,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-10-14 18:16:01,507 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 23 treesize of output 11 [2024-10-14 18:16:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:16:01,553 INFO L311 TraceCheckSpWp]: Computing backward predicates...