./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test05.c -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 fc3b64420d7066ddae343a06976c60db80b11c9064160fc3a579002ff9231727 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:51:41,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:51:41,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:51:41,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:51:41,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:51:41,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:51:41,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:51:41,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:51:41,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:51:41,581 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:51:41,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:51:41,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:51:41,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:51:41,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:51:41,589 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:51:41,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:51:41,590 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:51:41,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:51:41,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:51:41,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:51:41,591 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:51:41,591 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:51:41,592 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:51:41,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:51:41,592 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:51:41,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:51:41,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:51:41,593 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:51:41,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:51:41,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:51:41,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:51:41,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:51:41,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:51:41,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:51:41,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:51:41,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:51:41,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:51:41,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:51:41,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:51:41,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:51:41,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:51:41,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:51:41,599 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 -> fc3b64420d7066ddae343a06976c60db80b11c9064160fc3a579002ff9231727 [2024-10-14 17:51:41,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:51:41,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:51:41,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:51:41,886 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:51:41,886 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:51:41,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test05.c [2024-10-14 17:51:43,344 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:51:43,518 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:51:43,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test05.c [2024-10-14 17:51:43,525 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee174dd6a/1239e36cb51747d5b64de1a3e25f41f6/FLAGfa91176e2 [2024-10-14 17:51:43,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee174dd6a/1239e36cb51747d5b64de1a3e25f41f6 [2024-10-14 17:51:43,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:51:43,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:51:43,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:51:43,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:51:43,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:51:43,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774f2c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43, skipping insertion in model container [2024-10-14 17:51:43,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:51:43,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:51:43,737 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:51:43,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:51:43,779 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:51:43,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43 WrapperNode [2024-10-14 17:51:43,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:51:43,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:51:43,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:51:43,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:51:43,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,831 INFO L138 Inliner]: procedures = 16, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 91 [2024-10-14 17:51:43,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:51:43,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:51:43,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:51:43,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:51:43,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,870 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 9, 3, 3]. 53 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 8 writes are split as follows [0, 5, 2, 1]. [2024-10-14 17:51:43,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:51:43,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:51:43,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:51:43,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:51:43,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43" (1/1) ... [2024-10-14 17:51:43,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:51:43,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:51:43,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:51:43,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:51:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:51:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:51:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:51:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-14 17:51:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:51:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 17:51:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 17:51:44,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 17:51:44,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 17:51:44,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:51:44,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:51:44,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:51:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:51:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-14 17:51:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 17:51:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 17:51:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 17:51:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 17:51:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:51:44,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:51:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 17:51:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 17:51:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 17:51:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 17:51:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:51:44,130 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:51:44,131 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:51:44,419 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-10-14 17:51:44,419 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:51:44,477 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:51:44,478 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 17:51:44,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:51:44 BoogieIcfgContainer [2024-10-14 17:51:44,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:51:44,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:51:44,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:51:44,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:51:44,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:51:43" (1/3) ... [2024-10-14 17:51:44,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2508f548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:51:44, skipping insertion in model container [2024-10-14 17:51:44,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:51:43" (2/3) ... [2024-10-14 17:51:44,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2508f548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:51:44, skipping insertion in model container [2024-10-14 17:51:44,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:51:44" (3/3) ... [2024-10-14 17:51:44,490 INFO L112 eAbstractionObserver]: Analyzing ICFG test05.c [2024-10-14 17:51:44,504 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:51:44,506 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2024-10-14 17:51:44,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:51:44,552 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;@2347d355, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:51:44,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-10-14 17:51:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 17:51:44,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:44,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 17:51:44,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:44,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash 3631, now seen corresponding path program 1 times [2024-10-14 17:51:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:44,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502899050] [2024-10-14 17:51:44,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:44,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:44,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:44,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502899050] [2024-10-14 17:51:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502899050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:44,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:44,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:51:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793507887] [2024-10-14 17:51:44,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:44,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:51:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:44,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:51:44,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:51:44,946 INFO L87 Difference]: Start difference. First operand has 56 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:45,036 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2024-10-14 17:51:45,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:51:45,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 17:51:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:45,046 INFO L225 Difference]: With dead ends: 54 [2024-10-14 17:51:45,047 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 17:51:45,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:51:45,051 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:45,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 22 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 17:51:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-14 17:51:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 23 states have (on average 2.347826086956522) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2024-10-14 17:51:45,085 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 2 [2024-10-14 17:51:45,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:45,086 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2024-10-14 17:51:45,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2024-10-14 17:51:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 17:51:45,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:45,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 17:51:45,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:51:45,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:45,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash 3632, now seen corresponding path program 1 times [2024-10-14 17:51:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067194043] [2024-10-14 17:51:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:45,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:45,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067194043] [2024-10-14 17:51:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067194043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:45,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:45,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:51:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886922777] [2024-10-14 17:51:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:45,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:51:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:45,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:51:45,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:51:45,262 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:45,357 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2024-10-14 17:51:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:51:45,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 17:51:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:45,359 INFO L225 Difference]: With dead ends: 54 [2024-10-14 17:51:45,360 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 17:51:45,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:51:45,362 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:45,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 30 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 17:51:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2024-10-14 17:51:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 23 states have (on average 2.260869565217391) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2024-10-14 17:51:45,371 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 2 [2024-10-14 17:51:45,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:45,371 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-10-14 17:51:45,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2024-10-14 17:51:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 17:51:45,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:45,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 17:51:45,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:51:45,373 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:45,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash 112537, now seen corresponding path program 1 times [2024-10-14 17:51:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:45,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852024847] [2024-10-14 17:51:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:45,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:45,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:45,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852024847] [2024-10-14 17:51:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852024847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:45,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:45,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:51:45,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291865107] [2024-10-14 17:51:45,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:45,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:51:45,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:45,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:51:45,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:51:45,470 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:45,532 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2024-10-14 17:51:45,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:51:45,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 17:51:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:45,534 INFO L225 Difference]: With dead ends: 50 [2024-10-14 17:51:45,534 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 17:51:45,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:51:45,536 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:45,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 21 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 17:51:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-14 17:51:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 23 states have (on average 2.217391304347826) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2024-10-14 17:51:45,542 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 3 [2024-10-14 17:51:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:45,544 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2024-10-14 17:51:45,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,545 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2024-10-14 17:51:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 17:51:45,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:45,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 17:51:45,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:51:45,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:45,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash 112538, now seen corresponding path program 1 times [2024-10-14 17:51:45,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:45,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171169104] [2024-10-14 17:51:45,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:45,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:45,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:45,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171169104] [2024-10-14 17:51:45,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171169104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:45,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:45,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:51:45,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277503952] [2024-10-14 17:51:45,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:45,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:51:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:45,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:51:45,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:51:45,639 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:45,704 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2024-10-14 17:51:45,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:51:45,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 17:51:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:45,705 INFO L225 Difference]: With dead ends: 49 [2024-10-14 17:51:45,707 INFO L226 Difference]: Without dead ends: 49 [2024-10-14 17:51:45,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:51:45,708 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:45,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 49 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-14 17:51:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-14 17:51:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2024-10-14 17:51:45,719 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 3 [2024-10-14 17:51:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:45,719 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2024-10-14 17:51:45,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2024-10-14 17:51:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 17:51:45,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:45,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 17:51:45,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:51:45,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:45,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:45,723 INFO L85 PathProgramCache]: Analyzing trace with hash 3488626, now seen corresponding path program 1 times [2024-10-14 17:51:45,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:45,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934611267] [2024-10-14 17:51:45,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:45,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:45,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:45,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934611267] [2024-10-14 17:51:45,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934611267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:45,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:45,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:51:45,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207397476] [2024-10-14 17:51:45,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:45,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:51:45,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:45,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:51:45,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:51:45,853 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:45,913 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2024-10-14 17:51:45,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:51:45,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 17:51:45,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:45,914 INFO L225 Difference]: With dead ends: 48 [2024-10-14 17:51:45,915 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 17:51:45,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:51:45,916 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:45,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 20 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 17:51:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 17:51:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 2.130434782608696) internal successors, (49), 47 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2024-10-14 17:51:45,921 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 4 [2024-10-14 17:51:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:45,921 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2024-10-14 17:51:45,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-10-14 17:51:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 17:51:45,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:45,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 17:51:45,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:51:45,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:45,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash 3488627, now seen corresponding path program 1 times [2024-10-14 17:51:45,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:45,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001632123] [2024-10-14 17:51:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:45,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:46,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:46,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001632123] [2024-10-14 17:51:46,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001632123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:46,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:46,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:51:46,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687304300] [2024-10-14 17:51:46,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:46,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:51:46,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:46,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:51:46,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:51:46,088 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:46,141 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2024-10-14 17:51:46,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:51:46,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 17:51:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:46,142 INFO L225 Difference]: With dead ends: 47 [2024-10-14 17:51:46,143 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 17:51:46,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:51:46,144 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:46,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:51:46,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 17:51:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-14 17:51:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-10-14 17:51:46,147 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 4 [2024-10-14 17:51:46,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:46,148 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-10-14 17:51:46,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-10-14 17:51:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:51:46,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:46,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:51:46,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:51:46,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:46,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:46,150 INFO L85 PathProgramCache]: Analyzing trace with hash 108147388, now seen corresponding path program 1 times [2024-10-14 17:51:46,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:46,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469124911] [2024-10-14 17:51:46,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:46,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:46,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:46,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469124911] [2024-10-14 17:51:46,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469124911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:46,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:46,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:51:46,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314329358] [2024-10-14 17:51:46,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:46,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:51:46,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:46,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:51:46,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:51:46,255 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:46,310 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-10-14 17:51:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:51:46,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:51:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:46,311 INFO L225 Difference]: With dead ends: 41 [2024-10-14 17:51:46,311 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 17:51:46,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:51:46,312 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:46,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 14 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:46,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 17:51:46,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 17:51:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.826086956521739) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-10-14 17:51:46,315 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 5 [2024-10-14 17:51:46,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:46,316 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-10-14 17:51:46,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-10-14 17:51:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:51:46,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:46,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:51:46,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:51:46,317 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:46,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:46,317 INFO L85 PathProgramCache]: Analyzing trace with hash 108147389, now seen corresponding path program 1 times [2024-10-14 17:51:46,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:46,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80367589] [2024-10-14 17:51:46,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:46,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:46,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:46,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80367589] [2024-10-14 17:51:46,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80367589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:46,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:46,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:51:46,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880619989] [2024-10-14 17:51:46,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:46,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:51:46,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:46,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:51:46,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:51:46,524 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:46,570 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-10-14 17:51:46,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:51:46,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:51:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:46,572 INFO L225 Difference]: With dead ends: 35 [2024-10-14 17:51:46,572 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 17:51:46,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:51:46,573 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:46,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 25 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:51:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 17:51:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-14 17:51:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-10-14 17:51:46,576 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 5 [2024-10-14 17:51:46,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:46,576 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-10-14 17:51:46,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-10-14 17:51:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:51:46,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:46,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:46,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:51:46,578 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:46,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:46,579 INFO L85 PathProgramCache]: Analyzing trace with hash -955385408, now seen corresponding path program 1 times [2024-10-14 17:51:46,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:46,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414383196] [2024-10-14 17:51:46,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:46,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:46,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:46,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414383196] [2024-10-14 17:51:46,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414383196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:46,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:46,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:51:46,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729906805] [2024-10-14 17:51:46,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:46,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:51:46,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:46,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:51:46,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:51:46,727 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:46,807 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-10-14 17:51:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:51:46,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 17:51:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:46,809 INFO L225 Difference]: With dead ends: 34 [2024-10-14 17:51:46,810 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 17:51:46,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-10-14 17:51:46,811 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:46,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:46,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 17:51:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-10-14 17:51:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-10-14 17:51:46,814 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 10 [2024-10-14 17:51:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:46,814 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-10-14 17:51:46,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-10-14 17:51:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:51:46,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:46,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:46,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:51:46,815 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:46,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:46,816 INFO L85 PathProgramCache]: Analyzing trace with hash -955385409, now seen corresponding path program 1 times [2024-10-14 17:51:46,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:46,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438388024] [2024-10-14 17:51:46,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:46,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:46,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:46,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438388024] [2024-10-14 17:51:46,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438388024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:46,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:46,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:51:46,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555085877] [2024-10-14 17:51:46,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:46,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:51:46,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:46,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:51:46,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:51:46,882 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:46,959 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2024-10-14 17:51:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:51:46,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 17:51:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:46,960 INFO L225 Difference]: With dead ends: 32 [2024-10-14 17:51:46,960 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 17:51:46,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:51:46,961 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 29 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-10-14 17:51:46,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 29 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 17:51:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-10-14 17:51:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.391304347826087) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-10-14 17:51:46,964 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 10 [2024-10-14 17:51:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:46,964 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-10-14 17:51:46,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-10-14 17:51:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 17:51:46,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:46,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:46,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:51:46,965 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:46,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash 997674359, now seen corresponding path program 1 times [2024-10-14 17:51:46,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:46,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451791781] [2024-10-14 17:51:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:46,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:47,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:47,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451791781] [2024-10-14 17:51:47,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451791781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:47,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:47,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:51:47,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669725431] [2024-10-14 17:51:47,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:47,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:51:47,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:47,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:51:47,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:51:47,043 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:47,107 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-10-14 17:51:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:51:47,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 17:51:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:47,108 INFO L225 Difference]: With dead ends: 31 [2024-10-14 17:51:47,108 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 17:51:47,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:51:47,109 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:47,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 26 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:47,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 17:51:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-10-14 17:51:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-10-14 17:51:47,121 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 12 [2024-10-14 17:51:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:47,121 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-10-14 17:51:47,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-10-14 17:51:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 17:51:47,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:47,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:47,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:51:47,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:47,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash 997674360, now seen corresponding path program 1 times [2024-10-14 17:51:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:47,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127823043] [2024-10-14 17:51:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:47,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:47,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:47,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127823043] [2024-10-14 17:51:47,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127823043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:47,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:47,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:51:47,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350953521] [2024-10-14 17:51:47,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:47,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:51:47,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:47,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:51:47,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:51:47,266 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:47,339 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2024-10-14 17:51:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:51:47,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 17:51:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:47,340 INFO L225 Difference]: With dead ends: 33 [2024-10-14 17:51:47,340 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 17:51:47,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:51:47,341 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:47,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 45 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:51:47,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 17:51:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-10-14 17:51:47,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-10-14 17:51:47,344 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 12 [2024-10-14 17:51:47,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:47,344 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-10-14 17:51:47,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:47,344 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-10-14 17:51:47,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:51:47,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:47,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:47,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:51:47,345 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:47,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:47,346 INFO L85 PathProgramCache]: Analyzing trace with hash 863135680, now seen corresponding path program 1 times [2024-10-14 17:51:47,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:47,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942847066] [2024-10-14 17:51:47,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:47,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:47,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:47,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942847066] [2024-10-14 17:51:47,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942847066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:47,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:47,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:51:47,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10885448] [2024-10-14 17:51:47,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:47,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:51:47,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:47,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:51:47,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:51:47,486 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:47,586 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2024-10-14 17:51:47,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:51:47,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:51:47,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:47,587 INFO L225 Difference]: With dead ends: 29 [2024-10-14 17:51:47,587 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 17:51:47,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:51:47,588 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:47,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 17:51:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-10-14 17:51:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-10-14 17:51:47,594 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 13 [2024-10-14 17:51:47,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:47,594 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-10-14 17:51:47,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-10-14 17:51:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:51:47,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:47,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:47,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:51:47,595 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:47,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash 863135681, now seen corresponding path program 1 times [2024-10-14 17:51:47,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:47,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818341852] [2024-10-14 17:51:47,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:47,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:47,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818341852] [2024-10-14 17:51:47,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818341852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:47,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:47,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:51:47,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682843986] [2024-10-14 17:51:47,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:47,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:51:47,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:47,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:51:47,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:51:47,868 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:47,953 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-10-14 17:51:47,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:51:47,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:51:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:47,954 INFO L225 Difference]: With dead ends: 28 [2024-10-14 17:51:47,954 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 17:51:47,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:51:47,955 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:47,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 17:51:47,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-10-14 17:51:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-10-14 17:51:47,957 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 13 [2024-10-14 17:51:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:47,957 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-10-14 17:51:47,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-10-14 17:51:47,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:51:47,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:47,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:47,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:51:47,958 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:47,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:47,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1581876990, now seen corresponding path program 1 times [2024-10-14 17:51:47,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:47,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592888347] [2024-10-14 17:51:47,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:47,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:48,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592888347] [2024-10-14 17:51:48,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592888347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:48,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:48,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:51:48,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110254605] [2024-10-14 17:51:48,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:48,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:51:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:48,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:51:48,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:51:48,185 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:48,239 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-10-14 17:51:48,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:51:48,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 17:51:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:48,240 INFO L225 Difference]: With dead ends: 27 [2024-10-14 17:51:48,240 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 17:51:48,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:51:48,241 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:48,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:51:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 17:51:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 17:51:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-10-14 17:51:48,242 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 15 [2024-10-14 17:51:48,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:48,242 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-10-14 17:51:48,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:48,243 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-10-14 17:51:48,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 17:51:48,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:48,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:48,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:51:48,248 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:48,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:48,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1378250370, now seen corresponding path program 1 times [2024-10-14 17:51:48,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:48,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247843064] [2024-10-14 17:51:48,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:48,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:48,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:48,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247843064] [2024-10-14 17:51:48,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247843064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:48,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:48,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:51:48,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890259425] [2024-10-14 17:51:48,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:48,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:51:48,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:48,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:51:48,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:51:48,367 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:48,412 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2024-10-14 17:51:48,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:51:48,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 17:51:48,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:48,413 INFO L225 Difference]: With dead ends: 27 [2024-10-14 17:51:48,413 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 17:51:48,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:51:48,414 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:48,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:51:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 17:51:48,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 17:51:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 26 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2024-10-14 17:51:48,416 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 19 [2024-10-14 17:51:48,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:48,418 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2024-10-14 17:51:48,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2024-10-14 17:51:48,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 17:51:48,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:48,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:48,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:51:48,420 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:48,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1378251911, now seen corresponding path program 1 times [2024-10-14 17:51:48,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:48,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339670422] [2024-10-14 17:51:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:48,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:48,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:48,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339670422] [2024-10-14 17:51:48,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339670422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:48,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:48,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:51:48,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030416657] [2024-10-14 17:51:48,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:48,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:51:48,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:48,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:51:48,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:51:48,670 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:48,750 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2024-10-14 17:51:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:51:48,751 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 17:51:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:48,751 INFO L225 Difference]: With dead ends: 26 [2024-10-14 17:51:48,751 INFO L226 Difference]: Without dead ends: 26 [2024-10-14 17:51:48,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:51:48,752 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:48,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-14 17:51:48,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-14 17:51:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2024-10-14 17:51:48,754 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 19 [2024-10-14 17:51:48,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:48,754 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2024-10-14 17:51:48,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2024-10-14 17:51:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 17:51:48,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:48,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:48,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:51:48,756 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:48,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:48,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1378251912, now seen corresponding path program 1 times [2024-10-14 17:51:48,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908753681] [2024-10-14 17:51:48,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:49,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:49,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908753681] [2024-10-14 17:51:49,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908753681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:49,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:49,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:51:49,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191248801] [2024-10-14 17:51:49,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:49,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 17:51:49,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:49,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 17:51:49,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:51:49,223 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:49,334 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2024-10-14 17:51:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:51:49,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 17:51:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:49,335 INFO L225 Difference]: With dead ends: 25 [2024-10-14 17:51:49,336 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 17:51:49,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:51:49,336 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:49,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 17:51:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-14 17:51:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2024-10-14 17:51:49,338 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 19 [2024-10-14 17:51:49,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:49,339 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2024-10-14 17:51:49,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2024-10-14 17:51:49,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:51:49,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:49,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:49,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:51:49,340 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:49,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1650160654, now seen corresponding path program 1 times [2024-10-14 17:51:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:49,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636495618] [2024-10-14 17:51:49,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:49,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:49,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:49,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636495618] [2024-10-14 17:51:49,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636495618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:49,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:49,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:51:49,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563282285] [2024-10-14 17:51:49,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:49,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:51:49,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:49,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:51:49,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:51:49,684 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:49,725 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2024-10-14 17:51:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:51:49,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 17:51:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:49,726 INFO L225 Difference]: With dead ends: 24 [2024-10-14 17:51:49,726 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 17:51:49,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:51:49,727 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:49,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 12 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:51:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 17:51:49,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-14 17:51:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0) internal successors, (22), 22 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2024-10-14 17:51:49,728 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 21 [2024-10-14 17:51:49,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:49,728 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2024-10-14 17:51:49,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2024-10-14 17:51:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 17:51:49,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:49,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:49,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:51:49,730 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-14 17:51:49,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash -384629311, now seen corresponding path program 1 times [2024-10-14 17:51:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:49,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006720345] [2024-10-14 17:51:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006720345] [2024-10-14 17:51:50,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006720345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:50,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:51:50,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 17:51:50,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926478845] [2024-10-14 17:51:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:50,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:51:50,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:50,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:51:50,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:51:50,251 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:50,446 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2024-10-14 17:51:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 17:51:50,446 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-14 17:51:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:50,447 INFO L225 Difference]: With dead ends: 20 [2024-10-14 17:51:50,447 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 17:51:50,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2024-10-14 17:51:50,448 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:50,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 15 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 17:51:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 17:51:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 17:51:50,449 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-10-14 17:51:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:50,449 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 17:51:50,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:51:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 17:51:50,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 17:51:50,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 32 remaining) [2024-10-14 17:51:50,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2024-10-14 17:51:50,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2024-10-14 17:51:50,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2024-10-14 17:51:50,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2024-10-14 17:51:50,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 32 remaining) [2024-10-14 17:51:50,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2024-10-14 17:51:50,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2024-10-14 17:51:50,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2024-10-14 17:51:50,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2024-10-14 17:51:50,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2024-10-14 17:51:50,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2024-10-14 17:51:50,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2024-10-14 17:51:50,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2024-10-14 17:51:50,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2024-10-14 17:51:50,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2024-10-14 17:51:50,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2024-10-14 17:51:50,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2024-10-14 17:51:50,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2024-10-14 17:51:50,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2024-10-14 17:51:50,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2024-10-14 17:51:50,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2024-10-14 17:51:50,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2024-10-14 17:51:50,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2024-10-14 17:51:50,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2024-10-14 17:51:50,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2024-10-14 17:51:50,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2024-10-14 17:51:50,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2024-10-14 17:51:50,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2024-10-14 17:51:50,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2024-10-14 17:51:50,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (1 of 32 remaining) [2024-10-14 17:51:50,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK (0 of 32 remaining) [2024-10-14 17:51:50,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 17:51:50,462 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:50,465 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:51:50,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:51:50 BoogieIcfgContainer [2024-10-14 17:51:50,468 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:51:50,468 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:51:50,468 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:51:50,469 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:51:50,469 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:51:44" (3/4) ... [2024-10-14 17:51:50,472 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:51:50,481 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2024-10-14 17:51:50,483 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-14 17:51:50,483 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 17:51:50,483 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 17:51:50,572 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:51:50,575 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:51:50,575 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:51:50,575 INFO L158 Benchmark]: Toolchain (without parser) took 7033.79ms. Allocated memory was 161.5MB in the beginning and 314.6MB in the end (delta: 153.1MB). Free memory was 90.3MB in the beginning and 190.3MB in the end (delta: -100.0MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2024-10-14 17:51:50,576 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:51:50,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.47ms. Allocated memory is still 161.5MB. Free memory was 90.1MB in the beginning and 78.8MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 17:51:50,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.05ms. Allocated memory is still 161.5MB. Free memory was 78.8MB in the beginning and 77.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:51:50,576 INFO L158 Benchmark]: Boogie Preprocessor took 67.42ms. Allocated memory is still 161.5MB. Free memory was 77.0MB in the beginning and 74.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:51:50,577 INFO L158 Benchmark]: RCFGBuilder took 578.25ms. Allocated memory was 161.5MB in the beginning and 218.1MB in the end (delta: 56.6MB). Free memory was 74.4MB in the beginning and 170.0MB in the end (delta: -95.6MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-10-14 17:51:50,577 INFO L158 Benchmark]: TraceAbstraction took 5985.39ms. Allocated memory was 218.1MB in the beginning and 314.6MB in the end (delta: 96.5MB). Free memory was 170.0MB in the beginning and 195.5MB in the end (delta: -25.5MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2024-10-14 17:51:50,577 INFO L158 Benchmark]: Witness Printer took 106.42ms. Allocated memory is still 314.6MB. Free memory was 195.5MB in the beginning and 190.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:51:50,579 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.47ms. Allocated memory is still 161.5MB. Free memory was 90.1MB in the beginning and 78.8MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.05ms. Allocated memory is still 161.5MB. Free memory was 78.8MB in the beginning and 77.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.42ms. Allocated memory is still 161.5MB. Free memory was 77.0MB in the beginning and 74.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 578.25ms. Allocated memory was 161.5MB in the beginning and 218.1MB in the end (delta: 56.6MB). Free memory was 74.4MB in the beginning and 170.0MB in the end (delta: -95.6MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5985.39ms. Allocated memory was 218.1MB in the beginning and 314.6MB in the end (delta: 96.5MB). Free memory was 170.0MB in the beginning and 195.5MB in the end (delta: -25.5MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. * Witness Printer took 106.42ms. Allocated memory is still 314.6MB. Free memory was 195.5MB in the beginning and 190.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 22]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 423 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 794 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 461 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1250 IncrementalHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 333 mSDtfsCounter, 1250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 12 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 2129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:51:50,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE