./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:42:36,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:42:36,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:42:36,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:42:36,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:42:36,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:42:36,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:42:36,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:42:36,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:42:36,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:42:36,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:42:36,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:42:36,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:42:36,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:42:36,753 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:42:36,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:42:36,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:42:36,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:42:36,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:42:36,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:42:36,755 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:42:36,756 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:42:36,756 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:42:36,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:42:36,757 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:42:36,757 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:42:36,758 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:42:36,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:42:36,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:42:36,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:42:36,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:42:36,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:42:36,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:42:36,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:42:36,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:42:36,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:42:36,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:42:36,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:42:36,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:42:36,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:42:36,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:42:36,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:42:36,766 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2024-11-12 13:42:37,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:42:37,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:42:37,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:42:37,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:42:37,053 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:42:37,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2024-11-12 13:42:38,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:42:38,760 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:42:38,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2024-11-12 13:42:38,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f01451b/492bd2d1231a49128996aad0ff0092fb/FLAGc9d202536 [2024-11-12 13:42:38,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f01451b/492bd2d1231a49128996aad0ff0092fb [2024-11-12 13:42:38,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:42:38,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:42:38,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:42:38,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:42:38,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:42:38,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:42:38" (1/1) ... [2024-11-12 13:42:38,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a961b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:38, skipping insertion in model container [2024-11-12 13:42:38,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:42:38" (1/1) ... [2024-11-12 13:42:38,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:42:39,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:42:39,233 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:42:39,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:42:39,322 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:42:39,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39 WrapperNode [2024-11-12 13:42:39,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:42:39,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:42:39,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:42:39,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:42:39,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39" (1/1) ... [2024-11-12 13:42:39,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39" (1/1) ... [2024-11-12 13:42:39,381 INFO L138 Inliner]: procedures = 128, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 156 [2024-11-12 13:42:39,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:42:39,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:42:39,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:42:39,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:42:39,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39" (1/1) ... [2024-11-12 13:42:39,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39" (1/1) ... [2024-11-12 13:42:39,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39" (1/1) ... [2024-11-12 13:42:39,439 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2024-11-12 13:42:39,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39" (1/1) ... [2024-11-12 13:42:39,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39" (1/1) ... [2024-11-12 13:42:39,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39" (1/1) ... [2024-11-12 13:42:39,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39" (1/1) ... [2024-11-12 13:42:39,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39" (1/1) ... [2024-11-12 13:42:39,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39" (1/1) ... [2024-11-12 13:42:39,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:42:39,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:42:39,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:42:39,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:42:39,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39" (1/1) ... [2024-11-12 13:42:39,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:42:39,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:39,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 13:42:39,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 13:42:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 13:42:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 13:42:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 13:42:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:42:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 13:42:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 13:42:39,593 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-12 13:42:39,594 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-12 13:42:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:42:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:42:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 13:42:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:42:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:42:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 13:42:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:42:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:42:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 13:42:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:42:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 13:42:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 13:42:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-12 13:42:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:42:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:42:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 13:42:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:42:39,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:42:39,770 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:42:39,773 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:42:40,188 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-12 13:42:40,189 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:42:40,213 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:42:40,214 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-12 13:42:40,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:42:40 BoogieIcfgContainer [2024-11-12 13:42:40,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:42:40,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:42:40,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:42:40,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:42:40,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:42:38" (1/3) ... [2024-11-12 13:42:40,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4786b7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:42:40, skipping insertion in model container [2024-11-12 13:42:40,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:42:39" (2/3) ... [2024-11-12 13:42:40,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4786b7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:42:40, skipping insertion in model container [2024-11-12 13:42:40,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:42:40" (3/3) ... [2024-11-12 13:42:40,227 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2024-11-12 13:42:40,246 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:42:40,246 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-11-12 13:42:40,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:42:40,313 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;@7624ae0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:42:40,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-11-12 13:42:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 98 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:42:40,331 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:40,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:40,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:40,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1815197689, now seen corresponding path program 1 times [2024-11-12 13:42:40,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:40,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585990690] [2024-11-12 13:42:40,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:40,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:42:40,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:40,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585990690] [2024-11-12 13:42:40,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585990690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:40,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:42:40,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:42:40,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214369806] [2024-11-12 13:42:40,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:40,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:42:40,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:40,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:42:40,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:42:40,690 INFO L87 Difference]: Start difference. First operand has 102 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 98 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:42:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:40,797 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-12 13:42:40,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:42:40,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-11-12 13:42:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:40,808 INFO L225 Difference]: With dead ends: 99 [2024-11-12 13:42:40,809 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 13:42:40,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:42:40,814 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:40,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:42:40,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 13:42:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-12 13:42:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2024-11-12 13:42:40,855 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 7 [2024-11-12 13:42:40,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:40,855 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2024-11-12 13:42:40,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:42:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2024-11-12 13:42:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:42:40,856 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:40,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:40,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:42:40,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:40,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1815197690, now seen corresponding path program 1 times [2024-11-12 13:42:40,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:40,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402856675] [2024-11-12 13:42:40,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:40,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:42:41,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:41,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402856675] [2024-11-12 13:42:41,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402856675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:41,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:42:41,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:42:41,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459533880] [2024-11-12 13:42:41,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:41,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:42:41,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:41,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:42:41,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:42:41,039 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:42:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:41,110 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2024-11-12 13:42:41,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:42:41,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-11-12 13:42:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:41,112 INFO L225 Difference]: With dead ends: 94 [2024-11-12 13:42:41,112 INFO L226 Difference]: Without dead ends: 94 [2024-11-12 13:42:41,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:42:41,114 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:41,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 165 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:42:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-12 13:42:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-12 13:42:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 90 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2024-11-12 13:42:41,125 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 7 [2024-11-12 13:42:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:41,125 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2024-11-12 13:42:41,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:42:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2024-11-12 13:42:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:42:41,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:41,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:41,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:42:41,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:41,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:41,128 INFO L85 PathProgramCache]: Analyzing trace with hash -553922496, now seen corresponding path program 1 times [2024-11-12 13:42:41,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:41,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599520138] [2024-11-12 13:42:41,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:41,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:42:41,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:41,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599520138] [2024-11-12 13:42:41,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599520138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:41,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:42:41,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:42:41,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275949560] [2024-11-12 13:42:41,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:41,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:42:41,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:41,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:42:41,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:42:41,395 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:42:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:41,658 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-11-12 13:42:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:42:41,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-12 13:42:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:41,660 INFO L225 Difference]: With dead ends: 93 [2024-11-12 13:42:41,661 INFO L226 Difference]: Without dead ends: 93 [2024-11-12 13:42:41,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-12 13:42:41,664 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 2 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:41,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 359 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:42:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-12 13:42:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-12 13:42:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.75) internal successors, (98), 89 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-11-12 13:42:41,673 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 13 [2024-11-12 13:42:41,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:41,675 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-11-12 13:42:41,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:42:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-11-12 13:42:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:42:41,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:41,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:41,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:42:41,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:41,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:41,680 INFO L85 PathProgramCache]: Analyzing trace with hash -553922495, now seen corresponding path program 1 times [2024-11-12 13:42:41,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:41,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523532781] [2024-11-12 13:42:41,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:41,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:41,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:42:42,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:42,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523532781] [2024-11-12 13:42:42,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523532781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:42,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:42:42,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:42:42,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185751259] [2024-11-12 13:42:42,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:42,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:42:42,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:42,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:42:42,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:42:42,116 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:42:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:42,306 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-11-12 13:42:42,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:42:42,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-12 13:42:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:42,308 INFO L225 Difference]: With dead ends: 92 [2024-11-12 13:42:42,309 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 13:42:42,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:42:42,311 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:42,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 375 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:42:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 13:42:42,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 13:42:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.7321428571428572) internal successors, (97), 88 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-11-12 13:42:42,324 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 13 [2024-11-12 13:42:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:42,324 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-11-12 13:42:42,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:42:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-11-12 13:42:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:42:42,327 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:42,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:42,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:42:42,328 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:42,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:42,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1116124864, now seen corresponding path program 1 times [2024-11-12 13:42:42,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:42,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772607295] [2024-11-12 13:42:42,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:42,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:42,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 13:42:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:42:42,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:42,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772607295] [2024-11-12 13:42:42,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772607295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:42,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:42:42,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:42:42,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124808619] [2024-11-12 13:42:42,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:42,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:42:42,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:42,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:42:42,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:42:42,438 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:42:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:42,526 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2024-11-12 13:42:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:42:42,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2024-11-12 13:42:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:42,527 INFO L225 Difference]: With dead ends: 98 [2024-11-12 13:42:42,527 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 13:42:42,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-12 13:42:42,528 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 4 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:42,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 238 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:42:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 13:42:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-11-12 13:42:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.719298245614035) internal successors, (98), 89 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-11-12 13:42:42,538 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 15 [2024-11-12 13:42:42,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:42,538 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-11-12 13:42:42,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:42:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-11-12 13:42:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:42:42,540 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:42,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:42,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:42:42,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:42,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:42,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1974832318, now seen corresponding path program 1 times [2024-11-12 13:42:42,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:42,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547834084] [2024-11-12 13:42:42,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:42,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:42,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:42,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 13:42:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 13:42:42,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:42,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547834084] [2024-11-12 13:42:42,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547834084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:42,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780469344] [2024-11-12 13:42:42,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:42,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:42,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:42,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:42:42,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 13:42:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:42,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:42:42,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:42:42,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:42:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 13:42:42,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780469344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:42:42,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:42:42,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-12 13:42:42,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202335436] [2024-11-12 13:42:42,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:42:42,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:42:42,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:42,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:42:42,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:42:42,988 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:42:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:43,081 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-12 13:42:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:42:43,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-12 13:42:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:43,082 INFO L225 Difference]: With dead ends: 99 [2024-11-12 13:42:43,083 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 13:42:43,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:42:43,083 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 4 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:43,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 328 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:42:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 13:42:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-12 13:42:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.6612903225806452) 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-11-12 13:42:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2024-11-12 13:42:43,090 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 28 [2024-11-12 13:42:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:43,091 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2024-11-12 13:42:43,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:42:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2024-11-12 13:42:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:42:43,092 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:43,092 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:43,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 13:42:43,293 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-11-12 13:42:43,293 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:43,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:43,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1500032, now seen corresponding path program 2 times [2024-11-12 13:42:43,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:43,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616425561] [2024-11-12 13:42:43,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:43,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:43,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:43,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:42:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:43,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:42:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:42:44,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:44,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616425561] [2024-11-12 13:42:44,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616425561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:44,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100093287] [2024-11-12 13:42:44,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:42:44,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:44,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:44,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:42:44,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 13:42:44,186 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:42:44,187 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:42:44,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 13:42:44,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:44,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:42:44,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-12 13:42:44,336 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:42:44,336 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-11-12 13:42:44,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-12 13:42:44,480 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:42:44,480 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-11-12 13:42:44,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-12 13:42:44,586 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-12 13:42:44,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:44,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:42:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 12 not checked. [2024-11-12 13:42:44,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:42:44,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100093287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:44,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:42:44,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2024-11-12 13:42:44,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511686568] [2024-11-12 13:42:44,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:42:44,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 13:42:44,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:44,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 13:42:44,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-11-12 13:42:44,735 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 17 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:42:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:45,157 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2024-11-12 13:42:45,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:42:45,157 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2024-11-12 13:42:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:45,158 INFO L225 Difference]: With dead ends: 111 [2024-11-12 13:42:45,158 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 13:42:45,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=308, Unknown=1, NotChecked=36, Total=420 [2024-11-12 13:42:45,160 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 171 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:45,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 405 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 386 Invalid, 0 Unknown, 108 Unchecked, 0.3s Time] [2024-11-12 13:42:45,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 13:42:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2024-11-12 13:42:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.596774193548387) internal successors, (99), 90 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:42:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2024-11-12 13:42:45,169 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 41 [2024-11-12 13:42:45,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:45,169 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2024-11-12 13:42:45,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:42:45,170 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2024-11-12 13:42:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:42:45,174 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:45,174 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:45,191 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-11-12 13:42:45,375 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-11-12 13:42:45,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:45,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1500031, now seen corresponding path program 1 times [2024-11-12 13:42:45,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:45,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92271799] [2024-11-12 13:42:45,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:45,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:42:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:45,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:42:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:42:45,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:46,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92271799] [2024-11-12 13:42:46,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92271799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:46,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219506236] [2024-11-12 13:42:46,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:46,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:46,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:46,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:42:46,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 13:42:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:46,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 13:42:46,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:46,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:42:46,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-12 13:42:46,215 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-11-12 13:42:46,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:46,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:42:46,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-12 13:42:46,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:46,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:42:46,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-12 13:42:46,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:46,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:42:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-12 13:42:46,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:42:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219506236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:46,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:42:46,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2024-11-12 13:42:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514132179] [2024-11-12 13:42:46,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:46,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:42:46,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:42:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=123, Unknown=1, NotChecked=22, Total=182 [2024-11-12 13:42:46,509 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:46,634 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2024-11-12 13:42:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:42:46,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-11-12 13:42:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:46,636 INFO L225 Difference]: With dead ends: 97 [2024-11-12 13:42:46,636 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 13:42:46,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 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-11-12 13:42:46,637 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 17 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:46,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 278 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 123 Unchecked, 0.1s Time] [2024-11-12 13:42:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 13:42:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-11-12 13:42:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.564516129032258) internal successors, (97), 88 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:42:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-11-12 13:42:46,647 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 41 [2024-11-12 13:42:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:46,648 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-11-12 13:42:46,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-11-12 13:42:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:42:46,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:46,649 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:46,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 13:42:46,849 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-11-12 13:42:46,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:46,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:46,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1737780063, now seen corresponding path program 1 times [2024-11-12 13:42:46,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:46,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671828617] [2024-11-12 13:42:46,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:46,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:47,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:47,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:42:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:47,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:42:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 13:42:47,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:47,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671828617] [2024-11-12 13:42:47,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671828617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:47,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063457041] [2024-11-12 13:42:47,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:47,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:47,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:47,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:42:47,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 13:42:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:47,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-12 13:42:47,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:47,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-12 13:42:47,608 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-12 13:42:47,652 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-12 13:42:47,653 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-11-12 13:42:47,662 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-11-12 13:42:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:42:47,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:42:47,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063457041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:47,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:42:47,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2024-11-12 13:42:47,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817734104] [2024-11-12 13:42:47,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:47,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:42:47,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:47,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:42:47,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=333, Unknown=1, NotChecked=36, Total=420 [2024-11-12 13:42:47,670 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:47,855 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2024-11-12 13:42:47,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:42:47,859 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-12 13:42:47,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:47,860 INFO L225 Difference]: With dead ends: 110 [2024-11-12 13:42:47,860 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 13:42:47,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=444, Unknown=1, NotChecked=42, Total=552 [2024-11-12 13:42:47,861 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 41 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:47,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 385 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 177 Unchecked, 0.1s Time] [2024-11-12 13:42:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 13:42:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2024-11-12 13:42:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.578125) internal successors, (101), 90 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:42:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-11-12 13:42:47,865 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 44 [2024-11-12 13:42:47,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:47,866 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-11-12 13:42:47,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-11-12 13:42:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:42:47,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:47,867 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:47,886 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-11-12 13:42:48,071 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-11-12 13:42:48,072 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:48,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:48,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1737780062, now seen corresponding path program 1 times [2024-11-12 13:42:48,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:48,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900076006] [2024-11-12 13:42:48,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:48,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:48,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:48,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:42:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:48,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:42:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 13:42:48,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:48,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900076006] [2024-11-12 13:42:48,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900076006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:48,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331083039] [2024-11-12 13:42:48,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:48,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:48,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:48,582 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:42:48,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 13:42:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:48,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-12 13:42:48,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:48,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:42:49,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-12 13:42:49,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-12 13:42:49,155 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-12 13:42:49,210 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-12 13:42:49,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-12 13:42:49,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-12 13:42:49,284 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-11-12 13:42:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2024-11-12 13:42:49,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:42:49,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331083039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:49,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:42:49,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2024-11-12 13:42:49,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551050657] [2024-11-12 13:42:49,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:42:49,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 13:42:49,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:49,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 13:42:49,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=850, Unknown=1, NotChecked=58, Total=992 [2024-11-12 13:42:49,578 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 28 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 24 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:42:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:50,700 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2024-11-12 13:42:50,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 13:42:50,701 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 24 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2024-11-12 13:42:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:50,704 INFO L225 Difference]: With dead ends: 117 [2024-11-12 13:42:50,704 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 13:42:50,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=2064, Unknown=1, NotChecked=92, Total=2352 [2024-11-12 13:42:50,706 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 145 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:50,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 992 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 993 Invalid, 0 Unknown, 119 Unchecked, 0.6s Time] [2024-11-12 13:42:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 13:42:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2024-11-12 13:42:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 96 states have internal predecessors, (106), 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-11-12 13:42:50,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2024-11-12 13:42:50,714 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 44 [2024-11-12 13:42:50,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:50,715 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2024-11-12 13:42:50,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 24 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:42:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2024-11-12 13:42:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 13:42:50,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:50,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:50,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 13:42:50,918 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,SelfDestructingSolverStorable9 [2024-11-12 13:42:50,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:50,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:50,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1963391272, now seen corresponding path program 1 times [2024-11-12 13:42:50,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:50,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079398849] [2024-11-12 13:42:50,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:50,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:50,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:50,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:42:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:42:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-12 13:42:51,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:51,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079398849] [2024-11-12 13:42:51,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079398849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:51,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:42:51,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:42:51,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979073224] [2024-11-12 13:42:51,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:51,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:42:51,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:51,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:42:51,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:42:51,014 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:42:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:51,085 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2024-11-12 13:42:51,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:42:51,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-12 13:42:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:51,087 INFO L225 Difference]: With dead ends: 103 [2024-11-12 13:42:51,087 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 13:42:51,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-11-12 13:42:51,088 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:51,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:42:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 13:42:51,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-12 13:42:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 97 states have internal predecessors, (107), 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-11-12 13:42:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2024-11-12 13:42:51,092 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 45 [2024-11-12 13:42:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:51,092 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2024-11-12 13:42:51,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:42:51,093 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2024-11-12 13:42:51,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-12 13:42:51,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:51,094 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:51,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:42:51,094 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:51,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:51,095 INFO L85 PathProgramCache]: Analyzing trace with hash 735592277, now seen corresponding path program 1 times [2024-11-12 13:42:51,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:51,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343911334] [2024-11-12 13:42:51,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:51,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:42:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:42:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-12 13:42:51,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:51,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343911334] [2024-11-12 13:42:51,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343911334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:51,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:42:51,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:42:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511729850] [2024-11-12 13:42:51,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:51,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:42:51,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:51,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:42:51,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:42:51,231 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-11-12 13:42:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:51,370 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2024-11-12 13:42:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:42:51,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 46 [2024-11-12 13:42:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:51,371 INFO L225 Difference]: With dead ends: 102 [2024-11-12 13:42:51,371 INFO L226 Difference]: Without dead ends: 102 [2024-11-12 13:42:51,372 INFO L434 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-11-12 13:42:51,372 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 10 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:51,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 329 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:42:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-12 13:42:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-12 13:42:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 96 states have internal predecessors, (106), 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-11-12 13:42:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2024-11-12 13:42:51,376 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 46 [2024-11-12 13:42:51,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:51,377 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2024-11-12 13:42:51,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-11-12 13:42:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2024-11-12 13:42:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-12 13:42:51,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:51,378 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:51,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:42:51,378 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:51,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:51,379 INFO L85 PathProgramCache]: Analyzing trace with hash 735592278, now seen corresponding path program 1 times [2024-11-12 13:42:51,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:51,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254179833] [2024-11-12 13:42:51,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:42:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:42:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-12 13:42:51,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:51,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254179833] [2024-11-12 13:42:51,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254179833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:51,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:42:51,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:42:51,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369424599] [2024-11-12 13:42:51,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:51,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:42:51,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:51,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:42:51,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:42:51,522 INFO L87 Difference]: Start difference. First operand 102 states and 112 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:51,597 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2024-11-12 13:42:51,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:42:51,598 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2024-11-12 13:42:51,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:51,599 INFO L225 Difference]: With dead ends: 105 [2024-11-12 13:42:51,599 INFO L226 Difference]: Without dead ends: 105 [2024-11-12 13:42:51,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:42:51,600 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 61 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:51,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 237 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:42:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-12 13:42:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2024-11-12 13:42:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 95 states have internal predecessors, (104), 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-11-12 13:42:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-12 13:42:51,605 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 46 [2024-11-12 13:42:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:51,605 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-12 13:42:51,605 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-12 13:42:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 13:42:51,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:51,607 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:51,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:42:51,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:51,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:51,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1329941933, now seen corresponding path program 1 times [2024-11-12 13:42:51,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:51,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686152452] [2024-11-12 13:42:51,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:51,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:42:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:42:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-12 13:42:51,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:51,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686152452] [2024-11-12 13:42:51,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686152452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:51,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322774557] [2024-11-12 13:42:51,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:51,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:51,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:51,813 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:42:51,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 13:42:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:51,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 13:42:51,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-12 13:42:52,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:42:52,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322774557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:52,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:42:52,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-12 13:42:52,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169258216] [2024-11-12 13:42:52,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:52,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:42:52,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:52,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:42:52,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:42:52,023 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:52,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:52,050 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2024-11-12 13:42:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:42:52,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2024-11-12 13:42:52,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:52,051 INFO L225 Difference]: With dead ends: 102 [2024-11-12 13:42:52,051 INFO L226 Difference]: Without dead ends: 102 [2024-11-12 13:42:52,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:42:52,052 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 54 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:52,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 199 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:42:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-12 13:42:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-12 13:42:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 92 states have internal predecessors, (100), 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-11-12 13:42:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2024-11-12 13:42:52,055 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 47 [2024-11-12 13:42:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:52,055 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2024-11-12 13:42:52,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2024-11-12 13:42:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:42:52,056 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:52,057 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:52,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 13:42:52,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:52,258 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:52,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:52,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1721474660, now seen corresponding path program 1 times [2024-11-12 13:42:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:52,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142521875] [2024-11-12 13:42:52,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:52,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:52,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:52,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:42:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:52,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:42:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-12 13:42:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:52,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142521875] [2024-11-12 13:42:52,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142521875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:52,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:42:52,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:42:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284614147] [2024-11-12 13:42:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:52,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:42:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:52,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:42:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:42:52,369 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:42:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:52,466 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2024-11-12 13:42:52,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:42:52,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-12 13:42:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:52,467 INFO L225 Difference]: With dead ends: 97 [2024-11-12 13:42:52,467 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 13:42:52,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:42:52,469 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:52,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:42:52,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 13:42:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-12 13:42:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.434782608695652) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:42:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2024-11-12 13:42:52,472 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 48 [2024-11-12 13:42:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:52,473 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2024-11-12 13:42:52,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:42:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2024-11-12 13:42:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:42:52,474 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:52,474 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:52,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:42:52,474 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:52,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1721474659, now seen corresponding path program 1 times [2024-11-12 13:42:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:52,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929426718] [2024-11-12 13:42:52,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:52,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:52,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:42:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:52,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:42:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:42:52,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:52,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929426718] [2024-11-12 13:42:52,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929426718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:52,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739590212] [2024-11-12 13:42:52,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:52,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:52,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:52,815 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:42:52,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 13:42:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:53,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-12 13:42:53,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:53,108 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-11-12 13:42:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-12 13:42:53,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:42:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739590212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:53,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:42:53,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-12 13:42:53,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821992689] [2024-11-12 13:42:53,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:53,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:42:53,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:53,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:42:53,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2024-11-12 13:42:53,166 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:53,275 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2024-11-12 13:42:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:42:53,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2024-11-12 13:42:53,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:53,276 INFO L225 Difference]: With dead ends: 99 [2024-11-12 13:42:53,276 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 13:42:53,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-11-12 13:42:53,277 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 67 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:53,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 299 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:42:53,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 13:42:53,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-11-12 13:42:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:42:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2024-11-12 13:42:53,280 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 48 [2024-11-12 13:42:53,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:53,281 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2024-11-12 13:42:53,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2024-11-12 13:42:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 13:42:53,281 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:53,281 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:53,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 13:42:53,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:53,483 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:53,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1826106878, now seen corresponding path program 1 times [2024-11-12 13:42:53,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:53,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120061982] [2024-11-12 13:42:53,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:53,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:53,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:53,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:42:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:53,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:42:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-12 13:42:53,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:53,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120061982] [2024-11-12 13:42:53,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120061982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:53,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:42:53,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:42:53,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552369553] [2024-11-12 13:42:53,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:53,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:42:53,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:53,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:42:53,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:42:53,712 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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-11-12 13:42:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:53,839 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2024-11-12 13:42:53,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:42:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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 49 [2024-11-12 13:42:53,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:53,840 INFO L225 Difference]: With dead ends: 95 [2024-11-12 13:42:53,841 INFO L226 Difference]: Without dead ends: 95 [2024-11-12 13:42:53,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-11-12 13:42:53,841 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:53,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 329 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:42:53,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-12 13:42:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-12 13:42:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 89 states have internal predecessors, (97), 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-11-12 13:42:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2024-11-12 13:42:53,844 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 49 [2024-11-12 13:42:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:53,845 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2024-11-12 13:42:53,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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-11-12 13:42:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2024-11-12 13:42:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:42:53,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:53,846 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:53,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:42:53,846 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:53,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:53,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1752914403, now seen corresponding path program 1 times [2024-11-12 13:42:53,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:53,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576308994] [2024-11-12 13:42:53,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:54,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:42:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:54,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:42:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-12 13:42:54,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:54,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576308994] [2024-11-12 13:42:54,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576308994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:54,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:42:54,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:42:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752957074] [2024-11-12 13:42:54,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:54,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:42:54,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:54,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:42:54,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:42:54,057 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:54,165 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2024-11-12 13:42:54,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:42:54,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2024-11-12 13:42:54,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:54,166 INFO L225 Difference]: With dead ends: 95 [2024-11-12 13:42:54,167 INFO L226 Difference]: Without dead ends: 95 [2024-11-12 13:42:54,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:42:54,167 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 92 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:54,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 204 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:42:54,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-12 13:42:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-11-12 13:42:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 87 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:42:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2024-11-12 13:42:54,170 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 51 [2024-11-12 13:42:54,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:54,171 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2024-11-12 13:42:54,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:42:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2024-11-12 13:42:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:42:54,171 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:54,171 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:54,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 13:42:54,172 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:42:54,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1434365099, now seen corresponding path program 1 times [2024-11-12 13:42:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:54,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913924839] [2024-11-12 13:42:54,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:54,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:54,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:42:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:54,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:42:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:54,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:42:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-12 13:42:54,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:54,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913924839] [2024-11-12 13:42:54,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913924839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:54,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484343849] [2024-11-12 13:42:54,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:54,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:54,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:54,364 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-11-12 13:42:54,365 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-11-12 13:42:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:54,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 13:42:54,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:54,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-12 13:42:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:42:54,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:42:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:42:55,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484343849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:42:55,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:42:55,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 22 [2024-11-12 13:42:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338289831] [2024-11-12 13:42:55,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:42:55,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 13:42:55,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:55,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 13:42:55,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:42:55,018 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 20 states have internal predecessors, (73), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-12 13:42:59,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:43:03,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:43:07,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:43:11,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:43:15,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:43:19,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:43:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:19,946 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2024-11-12 13:43:19,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-12 13:43:19,946 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 20 states have internal predecessors, (73), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 54 [2024-11-12 13:43:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:19,947 INFO L225 Difference]: With dead ends: 154 [2024-11-12 13:43:19,947 INFO L226 Difference]: Without dead ends: 154 [2024-11-12 13:43:19,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=1313, Unknown=0, NotChecked=0, Total=1482 [2024-11-12 13:43:19,948 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 139 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 9 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:19,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1619 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1108 Invalid, 6 Unknown, 0 Unchecked, 24.6s Time] [2024-11-12 13:43:19,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-12 13:43:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 96. [2024-11-12 13:43:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.32) internal successors, (99), 90 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:43:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2024-11-12 13:43:19,952 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 54 [2024-11-12 13:43:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:19,952 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2024-11-12 13:43:19,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 20 states have internal predecessors, (73), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-12 13:43:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2024-11-12 13:43:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:43:19,954 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:19,954 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:19,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 13:43:20,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:20,159 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:43:20,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1434365051, now seen corresponding path program 1 times [2024-11-12 13:43:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:20,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218529706] [2024-11-12 13:43:20,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:20,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:20,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:43:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:20,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:43:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:20,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:43:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:43:20,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:20,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218529706] [2024-11-12 13:43:20,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218529706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:20,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020721630] [2024-11-12 13:43:20,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:20,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:20,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:20,729 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-11-12 13:43:20,732 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-11-12 13:43:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:20,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-12 13:43:20,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:20,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:43:21,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-11-12 13:43:21,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-12 13:43:21,402 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-12 13:43:21,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-12 13:43:21,423 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-12 13:43:21,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-12 13:43:21,541 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-11-12 13:43:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:43:21,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:21,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020721630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:21,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:43:21,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2024-11-12 13:43:21,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590527844] [2024-11-12 13:43:21,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:21,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-12 13:43:21,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:21,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-12 13:43:21,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 13:43:21,813 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 24 states have internal predecessors, (70), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:43:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:22,956 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2024-11-12 13:43:22,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 13:43:22,957 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 24 states have internal predecessors, (70), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2024-11-12 13:43:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:22,958 INFO L225 Difference]: With dead ends: 127 [2024-11-12 13:43:22,958 INFO L226 Difference]: Without dead ends: 127 [2024-11-12 13:43:22,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=1988, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 13:43:22,959 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 102 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:22,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1537 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 13:43:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-12 13:43:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 98. [2024-11-12 13:43:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 92 states have internal predecessors, (100), 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-11-12 13:43:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2024-11-12 13:43:22,962 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 54 [2024-11-12 13:43:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:22,962 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2024-11-12 13:43:22,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 24 states have internal predecessors, (70), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:43:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2024-11-12 13:43:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:43:22,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:22,963 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:22,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-12 13:43:23,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:23,168 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:43:23,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1167696907, now seen corresponding path program 1 times [2024-11-12 13:43:23,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:23,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414576025] [2024-11-12 13:43:23,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:23,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:23,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:43:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:23,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:43:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:23,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:43:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-12 13:43:23,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:23,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414576025] [2024-11-12 13:43:23,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414576025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:23,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:23,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:43:23,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391577852] [2024-11-12 13:43:23,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:23,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:43:23,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:23,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:43:23,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:43:23,434 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:43:23,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:23,647 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2024-11-12 13:43:23,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:43:23,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2024-11-12 13:43:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:23,649 INFO L225 Difference]: With dead ends: 138 [2024-11-12 13:43:23,649 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 13:43:23,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:43:23,650 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:23,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 439 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:43:23,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 13:43:23,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2024-11-12 13:43:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 95 states have internal predecessors, (106), 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-11-12 13:43:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2024-11-12 13:43:23,654 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 54 [2024-11-12 13:43:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:23,654 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2024-11-12 13:43:23,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:43:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2024-11-12 13:43:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:43:23,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:23,655 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:23,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 13:43:23,655 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:43:23,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:23,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1167696906, now seen corresponding path program 1 times [2024-11-12 13:43:23,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:23,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349149403] [2024-11-12 13:43:23,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:23,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:43:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:23,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:43:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:23,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:43:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:43:23,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:23,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349149403] [2024-11-12 13:43:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349149403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:23,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172112104] [2024-11-12 13:43:23,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:23,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:23,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:23,969 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-11-12 13:43:23,971 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-11-12 13:43:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:24,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 13:43:24,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:24,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:43:24,565 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:43:24,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:24,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:43:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-12 13:43:24,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:24,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-12 13:43:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-12 13:43:25,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172112104] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:25,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:43:25,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13, 13] total 29 [2024-11-12 13:43:25,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793605951] [2024-11-12 13:43:25,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:25,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:43:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:25,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:43:25,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2024-11-12 13:43:25,006 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:43:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:25,364 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2024-11-12 13:43:25,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:43:25,365 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2024-11-12 13:43:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:25,367 INFO L225 Difference]: With dead ends: 114 [2024-11-12 13:43:25,367 INFO L226 Difference]: Without dead ends: 114 [2024-11-12 13:43:25,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=1183, Unknown=0, NotChecked=0, Total=1332 [2024-11-12 13:43:25,368 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 79 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:25,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 636 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:43:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-12 13:43:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2024-11-12 13:43:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 94 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:43:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-12 13:43:25,371 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 54 [2024-11-12 13:43:25,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:25,372 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-12 13:43:25,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:43:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-12 13:43:25,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:43:25,373 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:25,373 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:25,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-12 13:43:25,577 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,SelfDestructingSolverStorable21 [2024-11-12 13:43:25,578 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:43:25,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:25,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1167696859, now seen corresponding path program 1 times [2024-11-12 13:43:25,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:25,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013165921] [2024-11-12 13:43:25,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:25,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:25,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:43:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:43:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:43:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:43:25,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:25,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013165921] [2024-11-12 13:43:25,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013165921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:25,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008458758] [2024-11-12 13:43:25,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:25,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:25,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:25,926 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-11-12 13:43:25,927 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-11-12 13:43:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:26,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 13:43:26,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:26,426 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:43:26,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:26,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:43:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:43:26,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:26,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:26,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-12 13:43:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:43:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008458758] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:43:26,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:43:26,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 28 [2024-11-12 13:43:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926919340] [2024-11-12 13:43:26,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:26,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 13:43:26,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:26,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 13:43:26,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2024-11-12 13:43:26,707 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 24 states have internal predecessors, (79), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-12 13:43:30,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:43:34,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:43:38,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:43:42,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:43:46,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:43:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:47,230 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-12 13:43:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 13:43:47,231 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 24 states have internal predecessors, (79), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 54 [2024-11-12 13:43:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:47,232 INFO L225 Difference]: With dead ends: 93 [2024-11-12 13:43:47,232 INFO L226 Difference]: Without dead ends: 93 [2024-11-12 13:43:47,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2024-11-12 13:43:47,233 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 130 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:47,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1379 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 599 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2024-11-12 13:43:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-12 13:43:47,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-12 13:43:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 87 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-11-12 13:43:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2024-11-12 13:43:47,236 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 54 [2024-11-12 13:43:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:47,237 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2024-11-12 13:43:47,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 24 states have internal predecessors, (79), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-12 13:43:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-11-12 13:43:47,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 13:43:47,238 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:47,238 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-11-12 13:43:47,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-12 13:43:47,439 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,SelfDestructingSolverStorable22 [2024-11-12 13:43:47,439 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:43:47,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:47,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1148380263, now seen corresponding path program 1 times [2024-11-12 13:43:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:47,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071171889] [2024-11-12 13:43:47,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:47,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:48,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:43:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:48,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:43:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:48,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:43:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 13:43:48,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:48,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071171889] [2024-11-12 13:43:48,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071171889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:48,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924677220] [2024-11-12 13:43:48,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:48,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:48,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:48,715 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-11-12 13:43:48,716 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-11-12 13:43:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:49,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-12 13:43:49,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:49,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:43:49,291 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:43:49,292 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-11-12 13:43:49,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 13:43:49,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2024-11-12 13:43:49,592 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-12 13:43:49,592 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 7 [2024-11-12 13:43:49,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:43:49,900 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 28 treesize of output 23 [2024-11-12 13:43:49,930 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2024-11-12 13:43:49,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2024-11-12 13:43:50,222 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-11-12 13:43:50,223 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 51 treesize of output 52 [2024-11-12 13:43:50,385 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-12 13:43:50,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 74 [2024-11-12 13:43:50,414 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 7 treesize of output 3 [2024-11-12 13:43:50,625 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 134 treesize of output 98 [2024-11-12 13:43:50,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:50,636 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 111 treesize of output 91 [2024-11-12 13:43:50,921 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 43 [2024-11-12 13:43:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:43:51,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:56,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924677220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:56,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:43:56,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 54 [2024-11-12 13:43:56,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842273120] [2024-11-12 13:43:56,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:56,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-12 13:43:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:56,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-12 13:43:56,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3851, Unknown=2, NotChecked=0, Total=4032 [2024-11-12 13:43:56,317 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 55 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 47 states have internal predecessors, (102), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:43:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:59,477 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2024-11-12 13:43:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-12 13:43:59,478 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 47 states have internal predecessors, (102), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2024-11-12 13:43:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:59,480 INFO L225 Difference]: With dead ends: 106 [2024-11-12 13:43:59,480 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 13:43:59,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=486, Invalid=7702, Unknown=2, NotChecked=0, Total=8190 [2024-11-12 13:43:59,482 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 220 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 2457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:59,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1552 Invalid, 2457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 13:43:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 13:43:59,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2024-11-12 13:43:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 91 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-11-12 13:43:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-11-12 13:43:59,486 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 59 [2024-11-12 13:43:59,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:59,486 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-11-12 13:43:59,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 47 states have internal predecessors, (102), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:43:59,487 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-11-12 13:43:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 13:43:59,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:59,487 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-11-12 13:43:59,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-12 13:43:59,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-12 13:43:59,692 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-12 13:43:59,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:59,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1148380264, now seen corresponding path program 1 times [2024-11-12 13:43:59,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:59,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805813736] [2024-11-12 13:43:59,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:59,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:44:00,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 13:44:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:44:00,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 13:44:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:44:00,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:44:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:44:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 13:44:00,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:44:00,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805813736] [2024-11-12 13:44:00,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805813736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:44:00,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003734817] [2024-11-12 13:44:00,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:44:00,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:44:00,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:44:00,980 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-11-12 13:44:00,981 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-11-12 13:44:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:44:01,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 131 conjuncts are in the unsatisfiable core [2024-11-12 13:44:01,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:44:01,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:44:01,672 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:44:01,672 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-11-12 13:44:01,696 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 13:44:01,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-12 13:44:01,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:44:01,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:44:02,099 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-11-12 13:44:02,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:44:02,110 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-11-12 13:44:02,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:44:02,425 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-12 13:44:02,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-12 13:44:02,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:44:02,437 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-11-12 13:44:02,465 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-12 13:44:02,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49