./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/realloc1.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
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/memsafety-ext3/realloc1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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', '32bit', '--witnessprinter.graph.data.programhash', 'ac04f74b68086890b55eca7e645e90e8df8a67932fce57d15e9ba2378d355360']
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/memsafety-ext3/realloc1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash ac04f74b68086890b55eca7e645e90e8df8a67932fce57d15e9ba2378d355360
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 16:30:57,794 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 16:30:57,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-07 16:30:57,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 16:30:57,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 16:30:57,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 16:30:57,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 16:30:57,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 16:30:57,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 16:30:57,890 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 16:30:57,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 16:30:57,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 16:30:57,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 16:30:57,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 16:30:57,891 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 16:30:57,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 16:30:57,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 16:30:57,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 16:30:57,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 16:30:57,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:30:57,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 16:30:57,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 16:30:57,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 16:30:57,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 16:30:57,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 16:30:57,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 16:30:57,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 16:30:57,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 16:30:57,894 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 -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac04f74b68086890b55eca7e645e90e8df8a67932fce57d15e9ba2378d355360
[2024-11-07 16:30:58,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 16:30:58,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 16:30:58,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 16:30:58,167 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 16:30:58,167 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 16:30:58,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/realloc1.c
[2024-11-07 16:30:59,309 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 16:30:59,487 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 16:30:59,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/realloc1.c
[2024-11-07 16:30:59,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03b5b98af/c3c03cd513724e908a9ac6d13dbb4c28/FLAG6e057cb0e
[2024-11-07 16:30:59,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03b5b98af/c3c03cd513724e908a9ac6d13dbb4c28
[2024-11-07 16:30:59,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 16:30:59,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 16:30:59,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 16:30:59,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 16:30:59,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 16:30:59,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:30:59" (1/1) ...
[2024-11-07 16:30:59,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5395fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:59, skipping insertion in model container
[2024-11-07 16:30:59,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:30:59" (1/1) ...
[2024-11-07 16:30:59,529 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 16:30:59,628 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:30:59,638 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 16:30:59,646 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:30:59,657 INFO L204 MainTranslator]: Completed translation
[2024-11-07 16:30:59,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:59 WrapperNode
[2024-11-07 16:30:59,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 16:30:59,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 16:30:59,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 16:30:59,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 16:30:59,663 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:30:59" (1/1) ...
[2024-11-07 16:30:59,667 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:30:59" (1/1) ...
[2024-11-07 16:30:59,679 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38
[2024-11-07 16:30:59,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 16:30:59,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 16:30:59,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 16:30:59,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 16:30:59,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:59" (1/1) ...
[2024-11-07 16:30:59,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:59" (1/1) ...
[2024-11-07 16:30:59,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:59" (1/1) ...
[2024-11-07 16:30:59,692 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS
[2024-11-07 16:30:59,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:59" (1/1) ...
[2024-11-07 16:30:59,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:59" (1/1) ...
[2024-11-07 16:30:59,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:59" (1/1) ...
[2024-11-07 16:30:59,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:59" (1/1) ...
[2024-11-07 16:30:59,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:59" (1/1) ...
[2024-11-07 16:30:59,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:59" (1/1) ...
[2024-11-07 16:30:59,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 16:30:59,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 16:30:59,706 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 16:30:59,706 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 16:30:59,707 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:59" (1/1) ...
[2024-11-07 16:30:59,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:30:59,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 16:30:59,735 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:30:59,737 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:30:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2024-11-07 16:30:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-07 16:30:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 16:30:59,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 16:30:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2024-11-07 16:30:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-07 16:30:59,812 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 16:30:59,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 16:30:59,938 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live.
[2024-11-07 16:30:59,939 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 16:30:59,945 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 16:30:59,945 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 16:30:59,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:30:59 BoogieIcfgContainer
[2024-11-07 16:30:59,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 16:30:59,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 16:30:59,947 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 16:30:59,950 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 16:30:59,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:30:59" (1/3) ...
[2024-11-07 16:30:59,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35beeb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:30:59, skipping insertion in model container
[2024-11-07 16:30:59,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:59" (2/3) ...
[2024-11-07 16:30:59,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35beeb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:30:59, skipping insertion in model container
[2024-11-07 16:30:59,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:30:59" (3/3) ...
[2024-11-07 16:30:59,952 INFO L112 eAbstractionObserver]: Analyzing ICFG realloc1.c
[2024-11-07 16:30:59,963 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 16:30:59,963 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2024-11-07 16:30:59,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 16:31:00,005 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;@68fe2a99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 16:31:00,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-11-07 16:31:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:31:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2024-11-07 16:31:00,012 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:31:00,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2024-11-07 16:31:00,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] ===
[2024-11-07 16:31:00,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:31:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times
[2024-11-07 16:31:00,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:31:00,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132024702]
[2024-11-07 16:31:00,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:31:00,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:31:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:31:00,158 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:31:00,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:31:00,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132024702]
[2024-11-07 16:31:00,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132024702] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:31:00,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:31:00,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:31:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584985829]
[2024-11-07 16:31:00,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:31:00,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:31:00,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:31:00,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:31:00,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:31:00,205 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:31:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:31:00,245 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions.
[2024-11-07 16:31:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:31:00,247 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:31:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:31:00,251 INFO L225 Difference]: With dead ends: 27
[2024-11-07 16:31:00,252 INFO L226 Difference]: Without dead ends: 25
[2024-11-07 16:31:00,253 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:31:00,257 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:31:00,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 21 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:31:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2024-11-07 16:31:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22.
[2024-11-07 16:31:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:31:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions.
[2024-11-07 16:31:00,281 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 4
[2024-11-07 16:31:00,281 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:31:00,281 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions.
[2024-11-07 16:31:00,281 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:31:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions.
[2024-11-07 16:31:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2024-11-07 16:31:00,281 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:31:00,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2024-11-07 16:31:00,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 16:31:00,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] ===
[2024-11-07 16:31:00,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:31:00,282 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times
[2024-11-07 16:31:00,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:31:00,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485902823]
[2024-11-07 16:31:00,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:31:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:31:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:31:00,376 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:31:00,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:31:00,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485902823]
[2024-11-07 16:31:00,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485902823] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:31:00,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:31:00,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:31:00,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154927623]
[2024-11-07 16:31:00,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:31:00,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:31:00,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:31:00,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:31:00,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:31:00,379 INFO L87 Difference]: Start difference. First operand 22 states and 24 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:31:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:31:00,422 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions.
[2024-11-07 16:31:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:31:00,422 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:31:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:31:00,422 INFO L225 Difference]: With dead ends: 26
[2024-11-07 16:31:00,422 INFO L226 Difference]: Without dead ends: 26
[2024-11-07 16:31:00,422 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:31:00,423 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:31:00,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:31:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2024-11-07 16:31:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24.
[2024-11-07 16:31:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:31:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions.
[2024-11-07 16:31:00,426 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 4
[2024-11-07 16:31:00,426 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:31:00,426 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions.
[2024-11-07 16:31:00,427 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:31:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions.
[2024-11-07 16:31:00,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-07 16:31:00,427 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:31:00,427 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:31:00,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 16:31:00,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] ===
[2024-11-07 16:31:00,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:31:00,428 INFO L85 PathProgramCache]: Analyzing trace with hash 264435913, now seen corresponding path program 1 times
[2024-11-07 16:31:00,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:31:00,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629420539]
[2024-11-07 16:31:00,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:31:00,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:31:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:31:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:31:00,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:31:00,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629420539]
[2024-11-07 16:31:00,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629420539] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 16:31:00,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823363059]
[2024-11-07 16:31:00,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:31:00,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 16:31:00,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 16:31:00,580 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:31:00,582 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:31:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:31:00,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-07 16:31:00,627 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:31:00,671 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:31:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:31:00,747 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:31:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:31:00,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823363059] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:31:00,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 16:31:00,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8
[2024-11-07 16:31:00,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818305251]
[2024-11-07 16:31:00,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:31:00,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 16:31:00,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:31:00,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 16:31:00,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2024-11-07 16:31:00,840 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:31:00,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:31:00,930 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions.
[2024-11-07 16:31:00,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 16:31:00,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-07 16:31:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:31:00,931 INFO L225 Difference]: With dead ends: 30
[2024-11-07 16:31:00,931 INFO L226 Difference]: Without dead ends: 30
[2024-11-07 16:31:00,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2024-11-07 16:31:00,932 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 16:31:00,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 45 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 16:31:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2024-11-07 16:31:00,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2024-11-07 16:31:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) 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:31:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions.
[2024-11-07 16:31:00,936 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 8
[2024-11-07 16:31:00,937 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:31:00,937 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions.
[2024-11-07 16:31:00,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:31:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions.
[2024-11-07 16:31:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2024-11-07 16:31:00,938 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:31:00,938 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1]
[2024-11-07 16:31:00,951 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:31:01,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 16:31:01,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] ===
[2024-11-07 16:31:01,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:31:01,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1401693693, now seen corresponding path program 1 times
[2024-11-07 16:31:01,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:31:01,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981121966]
[2024-11-07 16:31:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:31:01,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:31:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:31:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-07 16:31:01,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:31:01,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981121966]
[2024-11-07 16:31:01,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981121966] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:31:01,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:31:01,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:31:01,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512445653]
[2024-11-07 16:31:01,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:31:01,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:31:01,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:31:01,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:31:01,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:31:01,176 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:31:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:31:01,183 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions.
[2024-11-07 16:31:01,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:31:01,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 17
[2024-11-07 16:31:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:31:01,184 INFO L225 Difference]: With dead ends: 32
[2024-11-07 16:31:01,184 INFO L226 Difference]: Without dead ends: 32
[2024-11-07 16:31:01,184 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:31:01,185 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 23 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:31:01,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 23 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:31:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2024-11-07 16:31:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29.
[2024-11-07 16:31:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:31:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions.
[2024-11-07 16:31:01,187 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 17
[2024-11-07 16:31:01,188 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:31:01,188 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions.
[2024-11-07 16:31:01,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:31:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions.
[2024-11-07 16:31:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2024-11-07 16:31:01,188 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:31:01,188 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:31:01,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 16:31:01,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] ===
[2024-11-07 16:31:01,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:31:01,189 INFO L85 PathProgramCache]: Analyzing trace with hash 502831577, now seen corresponding path program 1 times
[2024-11-07 16:31:01,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:31:01,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341219573]
[2024-11-07 16:31:01,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:31:01,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:31:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:31:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-07 16:31:01,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:31:01,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341219573]
[2024-11-07 16:31:01,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341219573] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:31:01,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:31:01,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:31:01,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596144845]
[2024-11-07 16:31:01,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:31:01,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:31:01,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:31:01,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:31:01,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:31:01,227 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:31:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:31:01,244 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions.
[2024-11-07 16:31:01,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:31:01,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18
[2024-11-07 16:31:01,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:31:01,245 INFO L225 Difference]: With dead ends: 31
[2024-11-07 16:31:01,246 INFO L226 Difference]: Without dead ends: 31
[2024-11-07 16:31:01,246 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:31:01,246 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:31:01,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:31:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2024-11-07 16:31:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28.
[2024-11-07 16:31:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.2) 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:31:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions.
[2024-11-07 16:31:01,249 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18
[2024-11-07 16:31:01,249 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:31:01,249 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions.
[2024-11-07 16:31:01,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:31:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions.
[2024-11-07 16:31:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2024-11-07 16:31:01,250 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:31:01,250 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:31:01,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 16:31:01,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] ===
[2024-11-07 16:31:01,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:31:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2110157156, now seen corresponding path program 1 times
[2024-11-07 16:31:01,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:31:01,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245900733]
[2024-11-07 16:31:01,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:31:01,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:31:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:31:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:31:01,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:31:01,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245900733]
[2024-11-07 16:31:01,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245900733] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 16:31:01,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555420684]
[2024-11-07 16:31:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:31:01,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 16:31:01,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 16:31:01,324 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:31:01,325 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:31:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:31:01,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 16:31:01,368 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:31:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:31:01,398 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:31:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:31:01,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555420684] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:31:01,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 16:31:01,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11
[2024-11-07 16:31:01,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386799907]
[2024-11-07 16:31:01,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:31:01,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-07 16:31:01,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:31:01,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-07 16:31:01,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110
[2024-11-07 16:31:01,468 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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:31:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:31:01,503 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions.
[2024-11-07 16:31:01,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 16:31:01,504 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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 20
[2024-11-07 16:31:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:31:01,504 INFO L225 Difference]: With dead ends: 48
[2024-11-07 16:31:01,504 INFO L226 Difference]: Without dead ends: 48
[2024-11-07 16:31:01,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110
[2024-11-07 16:31:01,505 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:31:01,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:31:01,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2024-11-07 16:31:01,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2024-11-07 16:31:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 47 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:31:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions.
[2024-11-07 16:31:01,509 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 20
[2024-11-07 16:31:01,509 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:31:01,509 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions.
[2024-11-07 16:31:01,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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:31:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions.
[2024-11-07 16:31:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2024-11-07 16:31:01,510 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:31:01,510 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:31:01,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-07 16:31:01,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 16:31:01,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] ===
[2024-11-07 16:31:01,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:31:01,715 INFO L85 PathProgramCache]: Analyzing trace with hash -20280277, now seen corresponding path program 2 times
[2024-11-07 16:31:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:31:01,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454102960]
[2024-11-07 16:31:01,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:31:01,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:31:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:31:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:31:01,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:31:01,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454102960]
[2024-11-07 16:31:01,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454102960] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 16:31:01,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071168055]
[2024-11-07 16:31:01,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 16:31:01,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 16:31:01,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 16:31:01,887 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:31:01,888 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:31:01,937 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-07 16:31:01,938 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 16:31:01,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-07 16:31:01,941 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:31:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:31:01,999 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:31:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:31:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071168055] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:31:02,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 16:31:02,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13
[2024-11-07 16:31:02,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444655376]
[2024-11-07 16:31:02,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:31:02,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-11-07 16:31:02,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:31:02,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-11-07 16:31:02,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156
[2024-11-07 16:31:02,110 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:31:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:31:02,158 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions.
[2024-11-07 16:31:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-07 16:31:02,159 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40
[2024-11-07 16:31:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:31:02,159 INFO L225 Difference]: With dead ends: 56
[2024-11-07 16:31:02,159 INFO L226 Difference]: Without dead ends: 56
[2024-11-07 16:31:02,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156
[2024-11-07 16:31:02,160 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:31:02,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 84 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:31:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2024-11-07 16:31:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56.
[2024-11-07 16:31:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:31:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions.
[2024-11-07 16:31:02,163 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 40
[2024-11-07 16:31:02,163 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:31:02,163 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions.
[2024-11-07 16:31:02,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:31:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions.
[2024-11-07 16:31:02,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2024-11-07 16:31:02,164 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:31:02,164 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:31:02,177 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:31:02,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 16:31:02,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] ===
[2024-11-07 16:31:02,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:31:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1405581489, now seen corresponding path program 3 times
[2024-11-07 16:31:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:31:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171004224]
[2024-11-07 16:31:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:31:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:31:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 16:31:02,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 16:31:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 16:31:02,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 16:31:02,421 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 16:31:02,422 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 8 remaining)
[2024-11-07 16:31:02,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining)
[2024-11-07 16:31:02,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining)
[2024-11-07 16:31:02,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (4 of 8 remaining)
[2024-11-07 16:31:02,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (3 of 8 remaining)
[2024-11-07 16:31:02,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (2 of 8 remaining)
[2024-11-07 16:31:02,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining)
[2024-11-07 16:31:02,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining)
[2024-11-07 16:31:02,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 16:31:02,426 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1]
[2024-11-07 16:31:02,444 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 16:31:02,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:31:02 BoogieIcfgContainer
[2024-11-07 16:31:02,447 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 16:31:02,448 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 16:31:02,448 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 16:31:02,449 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 16:31:02,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:30:59" (3/4) ...
[2024-11-07 16:31:02,450 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-07 16:31:02,484 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 16:31:02,485 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 16:31:02,486 INFO L158 Benchmark]: Toolchain (without parser) took 2973.69ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 68.9MB in the end (delta: 8.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB.
[2024-11-07 16:31:02,486 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:31:02,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.43ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 66.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 16:31:02,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.76ms. Allocated memory is still 100.7MB. Free memory was 66.7MB in the beginning and 65.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:31:02,487 INFO L158 Benchmark]: Boogie Preprocessor took 24.99ms. Allocated memory is still 100.7MB. Free memory was 65.5MB in the beginning and 64.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:31:02,487 INFO L158 Benchmark]: RCFGBuilder took 239.07ms. Allocated memory is still 100.7MB. Free memory was 64.3MB in the beginning and 53.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 16:31:02,487 INFO L158 Benchmark]: TraceAbstraction took 2500.54ms. Allocated memory is still 100.7MB. Free memory was 52.8MB in the beginning and 71.5MB in the end (delta: -18.7MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB.
[2024-11-07 16:31:02,487 INFO L158 Benchmark]: Witness Printer took 37.68ms. Allocated memory is still 100.7MB. Free memory was 71.5MB in the beginning and 68.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:31:02,488 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.16ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 144.43ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 66.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 21.76ms. Allocated memory is still 100.7MB. Free memory was 66.7MB in the beginning and 65.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 24.99ms. Allocated memory is still 100.7MB. Free memory was 65.5MB in the beginning and 64.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 239.07ms. Allocated memory is still 100.7MB. Free memory was 64.3MB in the beginning and 53.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 2500.54ms. Allocated memory is still 100.7MB. Free memory was 52.8MB in the beginning and 71.5MB in the end (delta: -18.7MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB.
* Witness Printer took 37.68ms. Allocated memory is still 100.7MB. Free memory was 71.5MB in the beginning and 68.9MB in the end (delta: 2.6MB). 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
- CounterExampleResult [Line: -1]: pointer dereference may fail
pointer dereference may fail
We found a FailurePath:
[L8] char* p = malloc(10 * sizeof(int));
[L10] int i = 0;
VAL [i=0, p={-1:0}]
[L10] COND TRUE i < 10
[L11] p[i] = __VERIFIER_nondet_char()
VAL [i=0, p={-1:0}]
[L10] i++
VAL [i=1, p={-1:0}]
[L10] COND TRUE i < 10
[L11] p[i] = __VERIFIER_nondet_char()
VAL [i=1, p={-1:0}]
[L10] i++
VAL [i=2, p={-1:0}]
[L10] COND TRUE i < 10
[L11] p[i] = __VERIFIER_nondet_char()
VAL [i=2, p={-1:0}]
[L10] i++
VAL [i=3, p={-1:0}]
[L10] COND TRUE i < 10
[L11] p[i] = __VERIFIER_nondet_char()
VAL [i=3, p={-1:0}]
[L10] i++
VAL [i=4, p={-1:0}]
[L10] COND TRUE i < 10
[L11] p[i] = __VERIFIER_nondet_char()
VAL [i=4, p={-1:0}]
[L10] i++
VAL [i=5, p={-1:0}]
[L10] COND TRUE i < 10
[L11] p[i] = __VERIFIER_nondet_char()
VAL [i=5, p={-1:0}]
[L10] i++
VAL [i=6, p={-1:0}]
[L10] COND TRUE i < 10
[L11] p[i] = __VERIFIER_nondet_char()
VAL [i=6, p={-1:0}]
[L10] i++
VAL [i=7, p={-1:0}]
[L10] COND TRUE i < 10
[L11] p[i] = __VERIFIER_nondet_char()
VAL [i=7, p={-1:0}]
[L10] i++
VAL [i=8, p={-1:0}]
[L10] COND TRUE i < 10
[L11] p[i] = __VERIFIER_nondet_char()
VAL [i=8, p={-1:0}]
[L10] i++
VAL [i=9, p={-1:0}]
[L10] COND TRUE i < 10
[L11] p[i] = __VERIFIER_nondet_char()
VAL [i=9, p={-1:0}]
[L10] i++
VAL [i=10, p={-1:0}]
[L10] COND FALSE !(i < 10)
VAL [p={-1:0}]
[L14] free(p)
VAL [p={-1:0}]
[L14] free(p)
VAL [p={-1:0}]
[L14] free(p)
[L16] p[2]
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 14]: Unable to prove that free always succeeds
Unable to prove that free always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 14]: Unable to prove that free always succeeds
Unable to prove that free always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 14]: Unable to prove that free always succeeds
Unable to prove that free always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 7]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 26 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 126 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 120 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 252 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 30/441 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
RESULT: Ultimate proved your program to be incorrect!
[2024-11-07 16:31:02,507 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
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE(valid-deref)