./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/strcspn.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/termination-dietlibc/strcspn.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-dietlibc/strcspn.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:19:15,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:19:15,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-07 16:19:15,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:19:15,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:19:15,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:19:15,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:19:15,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:19:15,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:19:15,884 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:19:15,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:19:15,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:19:15,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:19:15,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:19:15,885 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:19:15,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:19:15,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:19:15,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:19:15,886 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:19:15,886 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:19:15,887 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:19:15,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:19:15,887 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:19:15,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:19:15,887 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:19:15,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:19:15,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:19:15,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:19:15,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:19:15,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:19:15,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:19:15,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:19:15,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:19:15,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:19:15,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:19:15,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:19:15,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:19:15,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:19:15,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:19:15,888 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 [2024-11-07 16:19:16,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:19:16,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:19:16,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:19:16,140 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:19:16,140 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:19:16,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strcspn.i [2024-11-07 16:19:17,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:19:17,662 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:19:17,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strcspn.i [2024-11-07 16:19:17,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81188b0b9/225ab4ce3b544fdb9ea156899cba45a6/FLAG9e03c01e9 [2024-11-07 16:19:17,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81188b0b9/225ab4ce3b544fdb9ea156899cba45a6 [2024-11-07 16:19:17,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:19:17,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:19:17,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:19:17,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:19:17,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:19:17,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:19:17" (1/1) ... [2024-11-07 16:19:17,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab825b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:17, skipping insertion in model container [2024-11-07 16:19:17,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:19:17" (1/1) ... [2024-11-07 16:19:18,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:19:18,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:19:18,289 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:19:18,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:19:18,363 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:19:18,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18 WrapperNode [2024-11-07 16:19:18,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:19:18,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:19:18,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:19:18,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:19:18,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,403 INFO L138 Inliner]: procedures = 113, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-11-07 16:19:18,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:19:18,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:19:18,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:19:18,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:19:18,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,430 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-07 16:19:18,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:19:18,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:19:18,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:19:18,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:19:18,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:19:18,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:18,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 16:19:18,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 16:19:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 16:19:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 16:19:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:19:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:19:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:19:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:19:18,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:19:18,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:19:18,584 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:19:18,585 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:19:18,757 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-07 16:19:18,757 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:19:18,765 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:19:18,767 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 16:19:18,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:19:18 BoogieIcfgContainer [2024-11-07 16:19:18,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:19:18,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:19:18,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:19:18,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:19:18,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:19:17" (1/3) ... [2024-11-07 16:19:18,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7400a8bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:19:18, skipping insertion in model container [2024-11-07 16:19:18,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (2/3) ... [2024-11-07 16:19:18,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7400a8bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:19:18, skipping insertion in model container [2024-11-07 16:19:18,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:19:18" (3/3) ... [2024-11-07 16:19:18,777 INFO L112 eAbstractionObserver]: Analyzing ICFG strcspn.i [2024-11-07 16:19:18,790 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:19:18,791 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-07 16:19:18,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:19:18,839 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;@18045054, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:19:18,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-07 16:19:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 35 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-11-07 16:19:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 16:19:18,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:18,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 16:19:18,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:18,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:18,855 INFO L85 PathProgramCache]: Analyzing trace with hash 925667, now seen corresponding path program 1 times [2024-11-07 16:19:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:18,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727222887] [2024-11-07 16:19:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:18,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:18,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727222887] [2024-11-07 16:19:18,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727222887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:18,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:18,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:19:18,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838095903] [2024-11-07 16:19:18,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:18,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:19:18,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:19,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:19:19,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:19:19,027 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 35 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) Second operand has 3 states, 2 states have (on average 2.0) 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-11-07 16:19:19,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:19,077 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-07 16:19:19,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:19:19,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-07 16:19:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:19,085 INFO L225 Difference]: With dead ends: 37 [2024-11-07 16:19:19,085 INFO L226 Difference]: Without dead ends: 34 [2024-11-07 16:19:19,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:19:19,089 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:19,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:19,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-07 16:19:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-07 16:19:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-07 16:19:19,120 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 4 [2024-11-07 16:19:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:19,120 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-07 16:19:19,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-07 16:19:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 16:19:19,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:19,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 16:19:19,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:19:19,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:19,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-07 16:19:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:19,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326240789] [2024-11-07 16:19:19,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:19,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:19,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:19,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326240789] [2024-11-07 16:19:19,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326240789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:19,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:19,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:19:19,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920189867] [2024-11-07 16:19:19,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:19,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:19:19,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:19,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:19:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:19:19,229 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.0) 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-11-07 16:19:19,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:19,269 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-07 16:19:19,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:19:19,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-07 16:19:19,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:19,270 INFO L225 Difference]: With dead ends: 33 [2024-11-07 16:19:19,270 INFO L226 Difference]: Without dead ends: 33 [2024-11-07 16:19:19,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:19:19,271 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:19,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 43 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-07 16:19:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-07 16:19:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 32 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-11-07 16:19:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-07 16:19:19,275 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 4 [2024-11-07 16:19:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:19,275 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-07 16:19:19,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-07 16:19:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 16:19:19,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:19,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 16:19:19,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:19:19,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:19,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:19,277 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2024-11-07 16:19:19,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:19,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864049419] [2024-11-07 16:19:19,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:19,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:19,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864049419] [2024-11-07 16:19:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864049419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:19,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:19:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567799617] [2024-11-07 16:19:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:19,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:19:19,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:19,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:19:19,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:19,491 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) 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-11-07 16:19:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:19,528 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-07 16:19:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:19:19,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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-11-07 16:19:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:19,529 INFO L225 Difference]: With dead ends: 32 [2024-11-07 16:19:19,529 INFO L226 Difference]: Without dead ends: 32 [2024-11-07 16:19:19,529 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-11-07 16:19:19,530 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:19,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-07 16:19:19,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-07 16:19:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-07 16:19:19,536 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 4 [2024-11-07 16:19:19,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:19,536 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-07 16:19:19,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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-11-07 16:19:19,537 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-07 16:19:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 16:19:19,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:19,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:19,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:19:19,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:19,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782697, now seen corresponding path program 1 times [2024-11-07 16:19:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:19,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148099225] [2024-11-07 16:19:19,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:19,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:19,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:19,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148099225] [2024-11-07 16:19:19,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148099225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:19,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:19,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:19:19,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855823647] [2024-11-07 16:19:19,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:19,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:19:19,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:19,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:19:19,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:19:19,621 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:19,652 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-07 16:19:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:19:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-07 16:19:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:19,653 INFO L225 Difference]: With dead ends: 31 [2024-11-07 16:19:19,653 INFO L226 Difference]: Without dead ends: 31 [2024-11-07 16:19:19,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:19:19,654 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:19,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-07 16:19:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-07 16:19:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.619047619047619) internal successors, (34), 30 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-11-07 16:19:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-07 16:19:19,661 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 7 [2024-11-07 16:19:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:19,661 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-07 16:19:19,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-07 16:19:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 16:19:19,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:19,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:19,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:19:19,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:19,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:19,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782698, now seen corresponding path program 1 times [2024-11-07 16:19:19,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:19,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556504615] [2024-11-07 16:19:19,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:19,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556504615] [2024-11-07 16:19:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556504615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:19,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:19,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:19:19,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256705285] [2024-11-07 16:19:19,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:19,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:19:19,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:19,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:19:19,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:19,828 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:19,842 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-07 16:19:19,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:19:19,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-07 16:19:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:19,844 INFO L225 Difference]: With dead ends: 30 [2024-11-07 16:19:19,844 INFO L226 Difference]: Without dead ends: 30 [2024-11-07 16:19:19,845 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-11-07 16:19:19,845 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:19,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-07 16:19:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-07 16:19:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-07 16:19:19,848 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 7 [2024-11-07 16:19:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:19,849 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-07 16:19:19,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-07 16:19:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 16:19:19,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:19,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:19,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:19:19,850 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:19,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:19,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782686, now seen corresponding path program 1 times [2024-11-07 16:19:19,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:19,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155599880] [2024-11-07 16:19:19,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:19,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:19,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:19,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155599880] [2024-11-07 16:19:19,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155599880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:19,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:19,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:19:19,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439205335] [2024-11-07 16:19:19,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:19,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:19:19,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:19,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:19:19,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:19,944 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:19,978 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-11-07 16:19:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:19:19,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-07 16:19:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:19,978 INFO L225 Difference]: With dead ends: 31 [2024-11-07 16:19:19,978 INFO L226 Difference]: Without dead ends: 30 [2024-11-07 16:19:19,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:19,979 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 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-11-07 16:19:19,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-07 16:19:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-07 16:19:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 29 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-11-07 16:19:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-07 16:19:19,982 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 7 [2024-11-07 16:19:19,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:19,982 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-07 16:19:19,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-07 16:19:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:19:19,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:19,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:19,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:19:19,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:19,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:19,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383917, now seen corresponding path program 1 times [2024-11-07 16:19:19,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:19,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461123397] [2024-11-07 16:19:19,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:19,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:20,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461123397] [2024-11-07 16:19:20,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461123397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:20,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:20,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:19:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334757596] [2024-11-07 16:19:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:20,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:19:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:20,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:19:20,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:20,099 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:20,145 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-07 16:19:20,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:19:20,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-07 16:19:20,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:20,146 INFO L225 Difference]: With dead ends: 28 [2024-11-07 16:19:20,146 INFO L226 Difference]: Without dead ends: 28 [2024-11-07 16:19:20,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:20,147 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:20,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 28 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-07 16:19:20,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-07 16:19:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 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-11-07 16:19:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-07 16:19:20,149 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 9 [2024-11-07 16:19:20,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:20,149 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-07 16:19:20,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,152 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-07 16:19:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:19:20,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:20,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:20,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:19:20,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:20,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383918, now seen corresponding path program 1 times [2024-11-07 16:19:20,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:20,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51520416] [2024-11-07 16:19:20,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:20,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:20,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:20,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51520416] [2024-11-07 16:19:20,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51520416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:20,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:20,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:19:20,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123959744] [2024-11-07 16:19:20,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:20,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:19:20,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:20,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:19:20,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:19:20,367 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:20,442 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-11-07 16:19:20,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:19:20,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2024-11-07 16:19:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:20,443 INFO L225 Difference]: With dead ends: 44 [2024-11-07 16:19:20,443 INFO L226 Difference]: Without dead ends: 44 [2024-11-07 16:19:20,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:19:20,444 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:20,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 74 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:19:20,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-07 16:19:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2024-11-07 16:19:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 35 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-07 16:19:20,448 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 9 [2024-11-07 16:19:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:20,448 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-07 16:19:20,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-11-07 16:19:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:19:20,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:20,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:20,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:19:20,449 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1621618095, now seen corresponding path program 1 times [2024-11-07 16:19:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118058614] [2024-11-07 16:19:20,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:20,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:20,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118058614] [2024-11-07 16:19:20,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118058614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:20,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:20,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:19:20,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692387666] [2024-11-07 16:19:20,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:20,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:19:20,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:20,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:19:20,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:20,501 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:20,534 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-07 16:19:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:19:20,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-07 16:19:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:20,538 INFO L225 Difference]: With dead ends: 34 [2024-11-07 16:19:20,538 INFO L226 Difference]: Without dead ends: 34 [2024-11-07 16:19:20,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:20,538 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:20,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:20,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-07 16:19:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-07 16:19:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-07 16:19:20,545 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 11 [2024-11-07 16:19:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:20,546 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-07 16:19:20,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-07 16:19:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:19:20,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:20,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:20,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:19:20,547 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:20,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:20,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1621618094, now seen corresponding path program 1 times [2024-11-07 16:19:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:20,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951138771] [2024-11-07 16:19:20,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:20,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:20,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:20,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951138771] [2024-11-07 16:19:20,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951138771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:20,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:20,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:19:20,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770933285] [2024-11-07 16:19:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:20,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:19:20,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:20,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:19:20,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:19:20,742 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:20,799 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-11-07 16:19:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:19:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2024-11-07 16:19:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:20,800 INFO L225 Difference]: With dead ends: 54 [2024-11-07 16:19:20,800 INFO L226 Difference]: Without dead ends: 54 [2024-11-07 16:19:20,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:19:20,801 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:20,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:19:20,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-07 16:19:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2024-11-07 16:19:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 41 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-11-07 16:19:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-11-07 16:19:20,805 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 11 [2024-11-07 16:19:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:20,805 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-07 16:19:20,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-07 16:19:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:19:20,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:20,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:20,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:19:20,806 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:20,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash 698109586, now seen corresponding path program 1 times [2024-11-07 16:19:20,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:20,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142407467] [2024-11-07 16:19:20,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:20,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:20,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:20,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142407467] [2024-11-07 16:19:20,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142407467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:20,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:20,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:19:20,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009988735] [2024-11-07 16:19:20,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:20,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:19:20,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:20,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:19:20,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:19:20,981 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-11-07 16:19:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:21,013 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-11-07 16:19:21,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:19:21,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-11-07 16:19:21,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:21,017 INFO L225 Difference]: With dead ends: 41 [2024-11-07 16:19:21,017 INFO L226 Difference]: Without dead ends: 38 [2024-11-07 16:19:21,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:19:21,017 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 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, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:21,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 49 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-07 16:19:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-07 16:19:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-07 16:19:21,023 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 13 [2024-11-07 16:19:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:21,024 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-07 16:19:21,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-11-07 16:19:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-07 16:19:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 16:19:21,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:21,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:21,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:19:21,024 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:21,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash 897154592, now seen corresponding path program 1 times [2024-11-07 16:19:21,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:21,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545321896] [2024-11-07 16:19:21,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:21,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:21,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:21,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545321896] [2024-11-07 16:19:21,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545321896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:19:21,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553964641] [2024-11-07 16:19:21,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:21,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:21,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:21,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:19:21,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 16:19:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:21,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 16:19:21,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:19:21,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-07 16:19:21,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:19:21,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-07 16:19:21,674 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:19:21,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:19:21,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:19:21,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-07 16:19:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:21,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:19:22,322 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:19:22,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-07 16:19:22,334 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:19:22,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-07 16:19:22,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-07 16:19:22,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-07 16:19:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553964641] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:19:22,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:19:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-07 16:19:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706354846] [2024-11-07 16:19:22,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:19:22,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 16:19:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 16:19:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:19:22,370 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:22,716 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-07 16:19:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:19:22,716 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 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-11-07 16:19:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:22,717 INFO L225 Difference]: With dead ends: 57 [2024-11-07 16:19:22,717 INFO L226 Difference]: Without dead ends: 57 [2024-11-07 16:19:22,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2024-11-07 16:19:22,719 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 80 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:22,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 133 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:19:22,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-07 16:19:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2024-11-07 16:19:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-07 16:19:22,724 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 15 [2024-11-07 16:19:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:22,725 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-07 16:19:22,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-07 16:19:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:19:22,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:22,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:22,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 16:19:22,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 16:19:22,928 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:22,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:22,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1080800794, now seen corresponding path program 1 times [2024-11-07 16:19:22,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:22,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385134274] [2024-11-07 16:19:22,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:22,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:23,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:23,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385134274] [2024-11-07 16:19:23,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385134274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:19:23,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228545168] [2024-11-07 16:19:23,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:23,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:23,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:23,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:19:23,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 16:19:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:23,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 16:19:23,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:19:23,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-07 16:19:23,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:19:23,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2024-11-07 16:19:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:23,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:19:23,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-07 16:19:23,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-07 16:19:23,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-07 16:19:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:23,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228545168] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:19:23,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:19:23,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-11-07 16:19:23,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079383873] [2024-11-07 16:19:23,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:19:23,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 16:19:23,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:23,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 16:19:23,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-11-07 16:19:23,914 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:24,290 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2024-11-07 16:19:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:19:24,290 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 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 17 [2024-11-07 16:19:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:24,291 INFO L225 Difference]: With dead ends: 78 [2024-11-07 16:19:24,291 INFO L226 Difference]: Without dead ends: 78 [2024-11-07 16:19:24,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2024-11-07 16:19:24,292 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 114 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:24,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 138 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:19:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-07 16:19:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2024-11-07 16:19:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 44 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-11-07 16:19:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-11-07 16:19:24,295 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 17 [2024-11-07 16:19:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:24,296 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-11-07 16:19:24,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-11-07 16:19:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 16:19:24,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:24,297 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:24,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 16:19:24,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:24,498 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:24,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:24,498 INFO L85 PathProgramCache]: Analyzing trace with hash 834958674, now seen corresponding path program 2 times [2024-11-07 16:19:24,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:24,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777799978] [2024-11-07 16:19:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:24,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:24,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777799978] [2024-11-07 16:19:24,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777799978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:19:24,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859764699] [2024-11-07 16:19:24,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:19:24,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:24,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:24,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:19:24,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 16:19:24,984 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:19:24,985 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:19:24,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-07 16:19:24,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:19:25,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-07 16:19:25,094 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:19:25,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:19:25,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-07 16:19:25,671 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-07 16:19:25,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2024-11-07 16:19:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:25,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:19:26,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-07 16:19:26,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:19:26,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2024-11-07 16:19:26,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-11-07 16:19:26,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:19:26,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2024-11-07 16:19:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:26,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859764699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:19:26,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:19:26,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2024-11-07 16:19:26,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939779023] [2024-11-07 16:19:26,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:19:26,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 16:19:26,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:26,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 16:19:26,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=661, Unknown=1, NotChecked=0, Total=756 [2024-11-07 16:19:26,287 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 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-11-07 16:19:30,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:30,883 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-07 16:19:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 16:19:30,883 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 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) Word has length 21 [2024-11-07 16:19:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:30,884 INFO L225 Difference]: With dead ends: 99 [2024-11-07 16:19:30,885 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 16:19:30,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=199, Invalid=1279, Unknown=4, NotChecked=0, Total=1482 [2024-11-07 16:19:30,887 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 142 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 4 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:30,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 301 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 473 Invalid, 13 Unknown, 0 Unchecked, 3.5s Time] [2024-11-07 16:19:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 16:19:30,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2024-11-07 16:19:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2024-11-07 16:19:30,895 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 21 [2024-11-07 16:19:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:30,895 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2024-11-07 16:19:30,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 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-11-07 16:19:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2024-11-07 16:19:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:19:30,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:30,896 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:30,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 16:19:31,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:31,096 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:31,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:31,097 INFO L85 PathProgramCache]: Analyzing trace with hash -828013958, now seen corresponding path program 2 times [2024-11-07 16:19:31,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:31,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718582057] [2024-11-07 16:19:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:31,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:31,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:31,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718582057] [2024-11-07 16:19:31,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718582057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:19:31,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808671694] [2024-11-07 16:19:31,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:19:31,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:31,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:31,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:19:31,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 16:19:31,594 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:19:31,594 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:19:31,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 16:19:31,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:19:31,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 16:19:31,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-07 16:19:32,098 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-07 16:19:32,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 20 [2024-11-07 16:19:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:32,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:19:32,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-07 16:19:32,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-11-07 16:19:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:32,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808671694] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:19:32,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:19:32,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 31 [2024-11-07 16:19:32,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656524235] [2024-11-07 16:19:32,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:19:32,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-07 16:19:32,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:32,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-07 16:19:32,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2024-11-07 16:19:32,596 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:33,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:33,603 INFO L93 Difference]: Finished difference Result 275 states and 305 transitions. [2024-11-07 16:19:33,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 16:19:33,603 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 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 23 [2024-11-07 16:19:33,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:33,604 INFO L225 Difference]: With dead ends: 275 [2024-11-07 16:19:33,604 INFO L226 Difference]: Without dead ends: 275 [2024-11-07 16:19:33,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=430, Invalid=2222, Unknown=0, NotChecked=0, Total=2652 [2024-11-07 16:19:33,606 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 266 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:33,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 221 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:19:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-07 16:19:33,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 172. [2024-11-07 16:19:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.1529411764705881) internal successors, (196), 171 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 196 transitions. [2024-11-07 16:19:33,620 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 196 transitions. Word has length 23 [2024-11-07 16:19:33,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:33,620 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 196 transitions. [2024-11-07 16:19:33,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2024-11-07 16:19:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:19:33,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:33,621 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:33,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 16:19:33,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 16:19:33,822 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:33,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:33,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1529251018, now seen corresponding path program 3 times [2024-11-07 16:19:33,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:33,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833392227] [2024-11-07 16:19:33,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:33,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:34,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:34,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833392227] [2024-11-07 16:19:34,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833392227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:19:34,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607782376] [2024-11-07 16:19:34,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 16:19:34,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:34,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:34,352 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:19:34,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 16:19:34,436 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-07 16:19:34,436 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:19:34,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-07 16:19:34,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:19:34,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-07 16:19:34,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:19:34,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-07 16:19:34,513 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:19:34,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:19:35,142 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-11-07 16:19:35,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2024-11-07 16:19:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 16:19:35,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:19:36,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2024-11-07 16:19:36,418 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:19:36,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-07 16:19:36,425 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:19:36,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-07 16:19:36,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:19:36,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 125 [2024-11-07 16:19:36,515 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:36,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607782376] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:19:36,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:19:36,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 17] total 37 [2024-11-07 16:19:36,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258101483] [2024-11-07 16:19:36,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:19:36,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-07 16:19:36,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:36,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-07 16:19:36,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2024-11-07 16:19:36,517 INFO L87 Difference]: Start difference. First operand 172 states and 196 transitions. Second operand has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 38 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:37,483 INFO L93 Difference]: Finished difference Result 214 states and 239 transitions. [2024-11-07 16:19:37,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:19:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 38 states have internal predecessors, (84), 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 33 [2024-11-07 16:19:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:37,484 INFO L225 Difference]: With dead ends: 214 [2024-11-07 16:19:37,484 INFO L226 Difference]: Without dead ends: 214 [2024-11-07 16:19:37,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=451, Invalid=2519, Unknown=0, NotChecked=0, Total=2970 [2024-11-07 16:19:37,485 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 176 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:37,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 393 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:19:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-07 16:19:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 50. [2024-11-07 16:19:37,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-07 16:19:37,489 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 33 [2024-11-07 16:19:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:37,492 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-07 16:19:37,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 38 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-07 16:19:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 16:19:37,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:37,493 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:37,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 16:19:37,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-07 16:19:37,694 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-07 16:19:37,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash 41398838, now seen corresponding path program 3 times [2024-11-07 16:19:37,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:37,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297602216] [2024-11-07 16:19:37,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:37,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:38,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:38,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297602216] [2024-11-07 16:19:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297602216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:19:38,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136270985] [2024-11-07 16:19:38,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 16:19:38,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:38,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:38,203 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:19:38,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 16:19:38,276 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-07 16:19:38,277 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:19:38,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 16:19:38,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:19:38,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-07 16:19:38,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-07 16:19:38,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:19:38,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-07 16:19:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 16:19:38,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:19:39,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-07 16:19:39,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2024-11-07 16:19:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 16:19:39,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136270985] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:19:39,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:19:39,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 26 [2024-11-07 16:19:39,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457030045] [2024-11-07 16:19:39,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:19:39,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 16:19:39,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:39,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 16:19:39,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2024-11-07 16:19:39,194 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:40,212 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-07 16:19:40,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 16:19:40,212 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 27 states have internal predecessors, (77), 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 41 [2024-11-07 16:19:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:40,213 INFO L225 Difference]: With dead ends: 78 [2024-11-07 16:19:40,213 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 16:19:40,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=386, Invalid=1594, Unknown=0, NotChecked=0, Total=1980 [2024-11-07 16:19:40,214 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 91 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:40,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 336 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:19:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 16:19:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 16:19:40,214 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-11-07 16:19:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 16:19:40,214 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2024-11-07 16:19:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:40,214 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 16:19:40,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 16:19:40,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 16:19:40,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 13 remaining) [2024-11-07 16:19:40,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2024-11-07 16:19:40,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2024-11-07 16:19:40,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2024-11-07 16:19:40,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2024-11-07 16:19:40,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2024-11-07 16:19:40,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2024-11-07 16:19:40,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2024-11-07 16:19:40,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2024-11-07 16:19:40,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2024-11-07 16:19:40,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2024-11-07 16:19:40,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2024-11-07 16:19:40,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2024-11-07 16:19:40,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 16:19:40,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 16:19:40,424 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:40,426 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 16:19:40,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:19:40 BoogieIcfgContainer [2024-11-07 16:19:40,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 16:19:40,429 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 16:19:40,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 16:19:40,429 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 16:19:40,429 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:19:18" (3/4) ... [2024-11-07 16:19:40,431 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 16:19:40,438 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-07 16:19:40,439 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 16:19:40,439 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-07 16:19:40,439 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 16:19:40,511 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 16:19:40,511 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 16:19:40,512 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 16:19:40,512 INFO L158 Benchmark]: Toolchain (without parser) took 22535.01ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 90.9MB in the beginning and 63.2MB in the end (delta: 27.7MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2024-11-07 16:19:40,512 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:19:40,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.49ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 74.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:19:40,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.16ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 72.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:19:40,513 INFO L158 Benchmark]: Boogie Preprocessor took 46.77ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 71.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:19:40,513 INFO L158 Benchmark]: RCFGBuilder took 315.11ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 58.0MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:19:40,514 INFO L158 Benchmark]: TraceAbstraction took 21658.62ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 57.5MB in the beginning and 67.9MB in the end (delta: -10.4MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-11-07 16:19:40,514 INFO L158 Benchmark]: Witness Printer took 83.11ms. Allocated memory is still 159.4MB. Free memory was 67.9MB in the beginning and 63.2MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:19:40,515 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.32ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.49ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 74.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.16ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 72.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.77ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 71.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 315.11ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 58.0MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21658.62ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 57.5MB in the beginning and 67.9MB in the end (delta: -10.4MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * Witness Printer took 83.11ms. Allocated memory is still 159.4MB. Free memory was 67.9MB in the beginning and 63.2MB in the end (delta: 4.7MB). There was no memory consumed. 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: 517]: 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, 36 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 979 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 979 mSDsluCounter, 2121 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1695 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3026 IncrementalHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 426 mSDtfsCounter, 3026 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 199 SyntacticMatches, 6 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1774 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=15, InterpolantAutomatonStates: 144, 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, 17 MinimizatonAttempts, 357 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 386 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 507 ConstructedInterpolants, 112 QuantifiedInterpolants, 9215 SizeOfPredicates, 40 NumberOfNonLiveVariables, 772 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 101/369 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 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 16:19:40,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE