./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i --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/array-memsafety-realloc/array-realloc-1.i', '-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', 'a7528f200456114b53348dcc6f65daa446d01523914ddd1f3b2ed0ccb2daf1cf']
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/array-memsafety-realloc/array-realloc-1.i -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 a7528f200456114b53348dcc6f65daa446d01523914ddd1f3b2ed0ccb2daf1cf
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 16:18:57,073 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 16:18:57,176 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:18:57,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 16:18:57,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 16:18:57,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 16:18:57,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 16:18:57,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 16:18:57,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 16:18:57,211 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 16:18:57,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 16:18:57,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 16:18:57,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 16:18:57,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 16:18:57,213 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 16:18:57,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 16:18:57,214 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 16:18:57,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 16:18:57,214 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 16:18:57,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 16:18:57,214 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-07 16:18:57,215 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-07 16:18:57,215 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-07 16:18:57,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 16:18:57,215 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 16:18:57,215 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 16:18:57,215 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 16:18:57,215 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 16:18:57,215 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 16:18:57,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 16:18:57,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 16:18:57,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 16:18:57,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 16:18:57,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:18:57,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 16:18:57,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 16:18:57,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 16:18:57,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 16:18:57,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 16:18:57,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 16:18:57,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 16:18:57,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 16:18:57,217 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 -> a7528f200456114b53348dcc6f65daa446d01523914ddd1f3b2ed0ccb2daf1cf
[2024-11-07 16:18:57,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 16:18:57,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 16:18:57,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 16:18:57,492 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 16:18:57,494 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 16:18:57,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i
[2024-11-07 16:18:58,825 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 16:18:59,066 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 16:18:59,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i
[2024-11-07 16:18:59,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4973aeb9/0c2bb9c02f364762ae1ea23c82d88d84/FLAG47efe015c
[2024-11-07 16:18:59,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4973aeb9/0c2bb9c02f364762ae1ea23c82d88d84
[2024-11-07 16:18:59,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 16:18:59,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 16:18:59,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 16:18:59,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 16:18:59,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 16:18:59,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:18:59" (1/1) ...
[2024-11-07 16:18:59,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca0284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:59, skipping insertion in model container
[2024-11-07 16:18:59,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:18:59" (1/1) ...
[2024-11-07 16:18:59,433 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 16:18:59,631 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 16:18:59,643 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 16:18:59,644 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:18:59,653 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 16:18:59,712 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:18:59,743 INFO L204 MainTranslator]: Completed translation
[2024-11-07 16:18:59,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:59 WrapperNode
[2024-11-07 16:18:59,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 16:18:59,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 16:18:59,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 16:18:59,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 16:18:59,754 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:18:59" (1/1) ...
[2024-11-07 16:18:59,773 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:18:59" (1/1) ...
[2024-11-07 16:18:59,792 INFO L138 Inliner]: procedures = 117, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57
[2024-11-07 16:18:59,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 16:18:59,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 16:18:59,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 16:18:59,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 16:18:59,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:59" (1/1) ...
[2024-11-07 16:18:59,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:59" (1/1) ...
[2024-11-07 16:18:59,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:59" (1/1) ...
[2024-11-07 16:18:59,811 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS
[2024-11-07 16:18:59,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:59" (1/1) ...
[2024-11-07 16:18:59,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:59" (1/1) ...
[2024-11-07 16:18:59,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:59" (1/1) ...
[2024-11-07 16:18:59,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:59" (1/1) ...
[2024-11-07 16:18:59,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:59" (1/1) ...
[2024-11-07 16:18:59,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:59" (1/1) ...
[2024-11-07 16:18:59,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 16:18:59,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 16:18:59,834 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 16:18:59,834 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 16:18:59,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:59" (1/1) ...
[2024-11-07 16:18:59,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:18:59,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 16:18:59,865 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:18:59,872 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:18:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2024-11-07 16:18:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-07 16:18:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-07 16:18:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 16:18:59,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 16:18:59,973 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 16:18:59,975 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 16:19:00,122 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live.
[2024-11-07 16:19:00,122 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 16:19:00,129 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 16:19:00,129 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 16:19:00,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:19:00 BoogieIcfgContainer
[2024-11-07 16:19:00,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 16:19:00,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 16:19:00,131 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 16:19:00,135 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 16:19:00,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:18:59" (1/3) ...
[2024-11-07 16:19:00,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2dae7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:19:00, skipping insertion in model container
[2024-11-07 16:19:00,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:59" (2/3) ...
[2024-11-07 16:19:00,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2dae7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:19:00, skipping insertion in model container
[2024-11-07 16:19:00,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:19:00" (3/3) ...
[2024-11-07 16:19:00,139 INFO L112 eAbstractionObserver]: Analyzing ICFG array-realloc-1.i
[2024-11-07 16:19:00,151 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 16:19:00,152 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2024-11-07 16:19:00,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 16:19:00,190 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;@7c8ab455, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 16:19:00,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-11-07 16:19:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.75) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2024-11-07 16:19:00,213 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:19:00,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2024-11-07 16:19:00,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] ===
[2024-11-07 16:19:00,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:19:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash 925656, now seen corresponding path program 1 times
[2024-11-07 16:19:00,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:19:00,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889938637]
[2024-11-07 16:19:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:19:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:19:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:19:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:19:00,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:19:00,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889938637]
[2024-11-07 16:19:00,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889938637] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:19:00,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:19:00,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:19:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621296587]
[2024-11-07 16:19:00,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:19:00,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:19:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:19:00,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:19:00,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:19:00,403 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.75) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:19:00,442 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions.
[2024-11-07 16:19:00,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:19:00,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4
[2024-11-07 16:19:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:19:00,451 INFO L225 Difference]: With dead ends: 31
[2024-11-07 16:19:00,451 INFO L226 Difference]: Without dead ends: 28
[2024-11-07 16:19:00,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:19:00,455 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:19:00,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:19:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2024-11-07 16:19:00,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2024-11-07 16:19:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.631578947368421) internal successors, (31), 27 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:19:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions.
[2024-11-07 16:19:00,481 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 4
[2024-11-07 16:19:00,482 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:19:00,482 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions.
[2024-11-07 16:19:00,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions.
[2024-11-07 16:19:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-07 16:19:00,482 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:19:00,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-07 16:19:00,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 16:19:00,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] ===
[2024-11-07 16:19:00,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:19:00,484 INFO L85 PathProgramCache]: Analyzing trace with hash 28695828, now seen corresponding path program 1 times
[2024-11-07 16:19:00,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:19:00,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818777970]
[2024-11-07 16:19:00,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:19:00,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:19:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:19:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:19:00,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:19:00,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818777970]
[2024-11-07 16:19:00,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818777970] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:19:00,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:19:00,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 16:19:00,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737513965]
[2024-11-07 16:19:00,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:19:00,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:19:00,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:19:00,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:19:00,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:19:00,533 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:19:00,551 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions.
[2024-11-07 16:19:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:19:00,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5
[2024-11-07 16:19:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:19:00,551 INFO L225 Difference]: With dead ends: 28
[2024-11-07 16:19:00,551 INFO L226 Difference]: Without dead ends: 28
[2024-11-07 16:19:00,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:19:00,552 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:19:00,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 27 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:19:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2024-11-07 16:19:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2024-11-07 16:19:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions.
[2024-11-07 16:19:00,556 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 5
[2024-11-07 16:19:00,557 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:19:00,557 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions.
[2024-11-07 16:19:00,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions.
[2024-11-07 16:19:00,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2024-11-07 16:19:00,557 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:19:00,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:19:00,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 16:19:00,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] ===
[2024-11-07 16:19:00,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:19:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910252, now seen corresponding path program 1 times
[2024-11-07 16:19:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:19:00,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973238868]
[2024-11-07 16:19:00,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:19:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:19:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:19:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:19:00,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:19:00,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973238868]
[2024-11-07 16:19:00,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973238868] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:19:00,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:19:00,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:19:00,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684120314]
[2024-11-07 16:19:00,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:19:00,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:19:00,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:19:00,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:19:00,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:19:00,651 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:19:00,668 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions.
[2024-11-07 16:19:00,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 16:19:00,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7
[2024-11-07 16:19:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:19:00,669 INFO L225 Difference]: With dead ends: 29
[2024-11-07 16:19:00,669 INFO L226 Difference]: Without dead ends: 29
[2024-11-07 16:19:00,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:19:00,670 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:19:00,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 50 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:19:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2024-11-07 16:19:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2024-11-07 16:19:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.55) 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:19:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions.
[2024-11-07 16:19:00,674 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 7
[2024-11-07 16:19:00,674 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:19:00,674 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions.
[2024-11-07 16:19:00,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions.
[2024-11-07 16:19:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-07 16:19:00,675 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:19:00,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:19:00,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 16:19:00,675 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] ===
[2024-11-07 16:19:00,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:19:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 179688781, now seen corresponding path program 1 times
[2024-11-07 16:19:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:19:00,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706812664]
[2024-11-07 16:19:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:19:00,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:19:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:19:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:19:00,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:19:00,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706812664]
[2024-11-07 16:19:00,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706812664] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:19:00,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:19:00,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 16:19:00,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673667]
[2024-11-07 16:19:00,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:19:00,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 16:19:00,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:19:00,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 16:19:00,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:19:00,834 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:19:00,891 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions.
[2024-11-07 16:19:00,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:19:00,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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:19:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:19:00,892 INFO L225 Difference]: With dead ends: 30
[2024-11-07 16:19:00,892 INFO L226 Difference]: Without dead ends: 30
[2024-11-07 16:19:00,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-07 16:19:00,893 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:19:00,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 67 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:19:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2024-11-07 16:19:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2024-11-07 16:19:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions.
[2024-11-07 16:19:00,900 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 8
[2024-11-07 16:19:00,900 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:19:00,900 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions.
[2024-11-07 16:19:00,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions.
[2024-11-07 16:19:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-07 16:19:00,901 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:19:00,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:19:00,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 16:19:00,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] ===
[2024-11-07 16:19:00,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:19:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash 179690703, now seen corresponding path program 1 times
[2024-11-07 16:19:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:19:00,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139068431]
[2024-11-07 16:19:00,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:19:00,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:19:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:19:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:19:01,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:19:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139068431]
[2024-11-07 16:19:01,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139068431] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:19:01,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:19:01,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 16:19:01,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144212639]
[2024-11-07 16:19:01,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:19:01,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:19:01,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:19:01,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:19:01,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:19:01,074 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:19:01,128 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions.
[2024-11-07 16:19:01,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:19:01,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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:19:01,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:19:01,129 INFO L225 Difference]: With dead ends: 29
[2024-11-07 16:19:01,130 INFO L226 Difference]: Without dead ends: 29
[2024-11-07 16:19:01,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:19:01,130 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:19:01,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 35 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:19:01,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2024-11-07 16:19:01,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28.
[2024-11-07 16:19:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:01,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions.
[2024-11-07 16:19:01,135 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 8
[2024-11-07 16:19:01,135 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:19:01,135 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions.
[2024-11-07 16:19:01,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions.
[2024-11-07 16:19:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-07 16:19:01,136 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:19:01,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:19:01,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 16:19:01,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] ===
[2024-11-07 16:19:01,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:19:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash 179690704, now seen corresponding path program 1 times
[2024-11-07 16:19:01,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:19:01,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338741102]
[2024-11-07 16:19:01,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:19:01,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:19:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:19:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:19:01,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:19:01,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338741102]
[2024-11-07 16:19:01,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338741102] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:19:01,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:19:01,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 16:19:01,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095379690]
[2024-11-07 16:19:01,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:19:01,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 16:19:01,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:19:01,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 16:19:01,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 16:19:01,371 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:19:01,457 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions.
[2024-11-07 16:19:01,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 16:19:01,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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:19:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:19:01,458 INFO L225 Difference]: With dead ends: 34
[2024-11-07 16:19:01,458 INFO L226 Difference]: Without dead ends: 34
[2024-11-07 16:19:01,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 16:19:01,459 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 16:19:01,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 71 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 16:19:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2024-11-07 16:19:01,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2024-11-07 16:19:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions.
[2024-11-07 16:19:01,463 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 8
[2024-11-07 16:19:01,463 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:19:01,463 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions.
[2024-11-07 16:19:01,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions.
[2024-11-07 16:19:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-11-07 16:19:01,463 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:19:01,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:19:01,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 16:19:01,464 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] ===
[2024-11-07 16:19:01,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:19:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash 702945990, now seen corresponding path program 1 times
[2024-11-07 16:19:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:19:01,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978405764]
[2024-11-07 16:19:01,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:19:01,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:19:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:19:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:19:01,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:19:01,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978405764]
[2024-11-07 16:19:01,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978405764] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:19:01,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:19:01,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 16:19:01,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365038373]
[2024-11-07 16:19:01,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:19:01,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:19:01,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:19:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:19:01,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:19:01,532 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:19:01,575 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions.
[2024-11-07 16:19:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:19:01,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13
[2024-11-07 16:19:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:19:01,576 INFO L225 Difference]: With dead ends: 33
[2024-11-07 16:19:01,576 INFO L226 Difference]: Without dead ends: 33
[2024-11-07 16:19:01,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:19:01,577 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:19:01,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 39 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:19:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2024-11-07 16:19:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2024-11-07 16:19:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions.
[2024-11-07 16:19:01,580 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13
[2024-11-07 16:19:01,580 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:19:01,580 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions.
[2024-11-07 16:19:01,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions.
[2024-11-07 16:19:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-11-07 16:19:01,581 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:19:01,581 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:19:01,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 16:19:01,582 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] ===
[2024-11-07 16:19:01,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:19:01,582 INFO L85 PathProgramCache]: Analyzing trace with hash 702991736, now seen corresponding path program 1 times
[2024-11-07 16:19:01,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:19:01,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940335756]
[2024-11-07 16:19:01,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:19:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:19:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:19:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:19:01,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:19:01,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940335756]
[2024-11-07 16:19:01,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940335756] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:19:01,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:19:01,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 16:19:01,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652252028]
[2024-11-07 16:19:01,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:19:01,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 16:19:01,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:19:01,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 16:19:01,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 16:19:01,677 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:19:01,741 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions.
[2024-11-07 16:19:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 16:19:01,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13
[2024-11-07 16:19:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:19:01,741 INFO L225 Difference]: With dead ends: 33
[2024-11-07 16:19:01,741 INFO L226 Difference]: Without dead ends: 33
[2024-11-07 16:19:01,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-11-07 16:19:01,742 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:19:01,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 74 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:19:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2024-11-07 16:19:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2024-11-07 16:19:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions.
[2024-11-07 16:19:01,745 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 13
[2024-11-07 16:19:01,745 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:19:01,745 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions.
[2024-11-07 16:19:01,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions.
[2024-11-07 16:19:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-11-07 16:19:01,745 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:19:01,745 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:19:01,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 16:19:01,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] ===
[2024-11-07 16:19:01,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:19:01,746 INFO L85 PathProgramCache]: Analyzing trace with hash 702993658, now seen corresponding path program 1 times
[2024-11-07 16:19:01,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:19:01,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011806381]
[2024-11-07 16:19:01,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:19:01,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:19:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:19:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:19:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:19:01,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011806381]
[2024-11-07 16:19:01,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011806381] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 16:19:01,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256675399]
[2024-11-07 16:19:01,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:19:01,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 16:19:01,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 16:19:01,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 16:19:01,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-07 16:19:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:19:02,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjuncts are in the unsatisfiable core
[2024-11-07 16:19:02,028 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:19:02,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2024-11-07 16:19:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:19:02,166 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:19:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:19:02,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256675399] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:19:02,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 16:19:02,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14
[2024-11-07 16:19:02,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133199058]
[2024-11-07 16:19:02,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:19:02,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-11-07 16:19:02,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:19:02,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-07 16:19:02,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210
[2024-11-07 16:19:02,366 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:19:02,767 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions.
[2024-11-07 16:19:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2024-11-07 16:19:02,767 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13
[2024-11-07 16:19:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:19:02,768 INFO L225 Difference]: With dead ends: 97
[2024-11-07 16:19:02,768 INFO L226 Difference]: Without dead ends: 97
[2024-11-07 16:19:02,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600
[2024-11-07 16:19:02,769 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 121 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 16:19:02,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 130 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 16:19:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2024-11-07 16:19:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 53.
[2024-11-07 16:19:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 52 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:19:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions.
[2024-11-07 16:19:02,775 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13
[2024-11-07 16:19:02,775 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:19:02,775 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions.
[2024-11-07 16:19:02,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions.
[2024-11-07 16:19:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2024-11-07 16:19:02,776 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:19:02,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:19:02,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-07 16:19:02,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 16:19:02,977 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] ===
[2024-11-07 16:19:02,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:19:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1079122444, now seen corresponding path program 1 times
[2024-11-07 16:19:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:19:02,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284912315]
[2024-11-07 16:19:02,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:19:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:19:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:19:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-07 16:19:03,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:19:03,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284912315]
[2024-11-07 16:19:03,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284912315] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:19:03,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:19:03,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:19:03,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446511288]
[2024-11-07 16:19:03,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:19:03,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:19:03,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:19:03,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:19:03,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:19:03,008 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:19:03,013 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions.
[2024-11-07 16:19:03,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:19:03,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17
[2024-11-07 16:19:03,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:19:03,015 INFO L225 Difference]: With dead ends: 52
[2024-11-07 16:19:03,015 INFO L226 Difference]: Without dead ends: 52
[2024-11-07 16:19:03,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:19:03,016 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:19:03,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:19:03,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2024-11-07 16:19:03,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52.
[2024-11-07 16:19:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions.
[2024-11-07 16:19:03,021 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 17
[2024-11-07 16:19:03,021 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:19:03,021 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions.
[2024-11-07 16:19:03,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions.
[2024-11-07 16:19:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2024-11-07 16:19:03,022 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:19:03,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:19:03,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-07 16:19:03,022 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] ===
[2024-11-07 16:19:03,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:19:03,022 INFO L85 PathProgramCache]: Analyzing trace with hash -906942520, now seen corresponding path program 1 times
[2024-11-07 16:19:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:19:03,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560475053]
[2024-11-07 16:19:03,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:19:03,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:19:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:19:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-07 16:19:03,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:19:03,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560475053]
[2024-11-07 16:19:03,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560475053] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:19:03,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:19:03,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:19:03,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303244680]
[2024-11-07 16:19:03,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:19:03,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:19:03,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:19:03,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:19:03,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:19:03,062 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:19:03,074 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions.
[2024-11-07 16:19:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:19:03,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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:19:03,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:19:03,075 INFO L225 Difference]: With dead ends: 51
[2024-11-07 16:19:03,075 INFO L226 Difference]: Without dead ends: 51
[2024-11-07 16:19:03,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:19:03,076 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:19:03,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:19:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2024-11-07 16:19:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2024-11-07 16:19:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions.
[2024-11-07 16:19:03,079 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 18
[2024-11-07 16:19:03,079 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:19:03,079 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions.
[2024-11-07 16:19:03,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:19:03,079 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions.
[2024-11-07 16:19:03,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2024-11-07 16:19:03,080 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:19:03,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:19:03,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-07 16:19:03,080 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] ===
[2024-11-07 16:19:03,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:19:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1949553038, now seen corresponding path program 1 times
[2024-11-07 16:19:03,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:19:03,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399267204]
[2024-11-07 16:19:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:19:03,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:19:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 16:19:03,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 16:19:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 16:19:03,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 16:19:03,125 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 16:19:03,128 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (8 of 9 remaining)
[2024-11-07 16:19:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining)
[2024-11-07 16:19:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining)
[2024-11-07 16:19:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (5 of 9 remaining)
[2024-11-07 16:19:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (4 of 9 remaining)
[2024-11-07 16:19:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (3 of 9 remaining)
[2024-11-07 16:19:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (2 of 9 remaining)
[2024-11-07 16:19:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (1 of 9 remaining)
[2024-11-07 16:19:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining)
[2024-11-07 16:19:03,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-07 16:19:03,133 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:19:03,161 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 16:19:03,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:19:03 BoogieIcfgContainer
[2024-11-07 16:19:03,163 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 16:19:03,165 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 16:19:03,165 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 16:19:03,165 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 16:19:03,165 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:19:00" (3/4) ...
[2024-11-07 16:19:03,166 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-07 16:19:03,207 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 16:19:03,207 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 16:19:03,207 INFO L158 Benchmark]: Toolchain (without parser) took 3817.63ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 59.0MB in the end (delta: 16.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB.
[2024-11-07 16:19:03,208 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:19:03,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.22ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 58.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 16:19:03,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.68ms. Allocated memory is still 100.7MB. Free memory was 58.9MB in the beginning and 57.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:19:03,208 INFO L158 Benchmark]: Boogie Preprocessor took 38.14ms. Allocated memory is still 100.7MB. Free memory was 57.3MB in the beginning and 56.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:19:03,208 INFO L158 Benchmark]: RCFGBuilder took 296.15ms. Allocated memory is still 100.7MB. Free memory was 56.1MB in the beginning and 43.5MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 16:19:03,208 INFO L158 Benchmark]: TraceAbstraction took 3032.37ms. Allocated memory is still 100.7MB. Free memory was 42.9MB in the beginning and 61.7MB in the end (delta: -18.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:19:03,209 INFO L158 Benchmark]: Witness Printer took 42.31ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 59.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:19:03,211 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.81ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 352.22ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 58.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 47.68ms. Allocated memory is still 100.7MB. Free memory was 58.9MB in the beginning and 57.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 38.14ms. Allocated memory is still 100.7MB. Free memory was 57.3MB in the beginning and 56.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 296.15ms. Allocated memory is still 100.7MB. Free memory was 56.1MB in the beginning and 43.5MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 3032.37ms. Allocated memory is still 100.7MB. Free memory was 42.9MB in the beginning and 61.7MB in the end (delta: -18.8MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 42.31ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 59.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- CounterExampleResult [Line: 538]: free of unallocated memory possible
free of unallocated memory possible
We found a FailurePath:
[L512] int num;
[L513] int ind, newsize, i = 1;
VAL [i=1, ind=0, newsize=0, num=0]
[L528] num = __VERIFIER_nondet_int()
[L529] COND FALSE !(!(num > 0 && num < 100))
[L532] int *a = (int *)malloc(sizeof(int));
[L533] COND FALSE !(a == ((void *)0))
[L536] newsize = 0
[L537] CALL expandArray(a)
[L515] int *a = (int *)arg;
[L516] int *b = ((void *)0);
VAL [a={-1:0}, b={0:0}, i=1, ind=0, newsize=0, num=1]
[L517] COND TRUE newsize < num
[L518] newsize = newsize + 1
[L519] EXPR, FCALL realloc(a, sizeof(int) * newsize)
[L519] b = realloc(a, sizeof(int) * newsize)
[L520] b[newsize - 1] = i
VAL [b={2:0}, i=1, ind=0, newsize=1, num=1]
[L521] a = b
VAL [a={2:0}, b={2:0}, i=1, ind=0, newsize=1, num=1]
[L517] COND FALSE !(newsize < num)
VAL [a={2:0}, b={2:0}, i=1, ind=0, newsize=1, num=1]
[L523] COND TRUE b != ((void *)0)
VAL [a={2:0}, b={2:0}, i=1, ind=0, newsize=1, num=1]
[L524] free(b)
VAL [a={2:0}, i=1, ind=0, newsize=1, num=1]
[L524] free(b)
VAL [a={2:0}, i=1, ind=0, newsize=1, num=1]
[L524] free(b)
[L525] return 0;
VAL [a={2:0}, i=1, ind=0, newsize=1, num=1]
[L537] RET expandArray(a)
[L538] free(a)
VAL [i=1, ind=0, newsize=1, num=1]
[L538] free(a)
VAL [i=1, ind=0, newsize=1, num=1]
[L538] free(a)
VAL [i=1, ind=0, newsize=1, num=1]
- 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: 524]: Unable to prove that free always succeeds
Unable to prove that free always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 524]: Unable to prove that free always succeeds
Unable to prove that free always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 524]: Unable to prove that free always succeeds
Unable to prove that free always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 538]: Unable to prove that free always succeeds
Unable to prove that free always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 538]: Unable to prove that free always succeeds
Unable to prove that free always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 527]: 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, 30 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 591 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 353 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 458 IncrementalHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 238 mSDtfsCounter, 458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=9, InterpolantAutomatonStates: 67, 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, 11 MinimizatonAttempts, 45 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 7/19 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:19:03,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE(valid-free)