./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/dll-lst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/memsafety-broom/dll-lst-shared.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '6f8708414d69d58e69308ef3f6436b82a3a2ac306b0f68b7007fd3139e12ef15'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/dll-lst-shared.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6f8708414d69d58e69308ef3f6436b82a3a2ac306b0f68b7007fd3139e12ef15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:37:11,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:37:11,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-07 16:37:11,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:37:11,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:37:11,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:37:11,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:37:11,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:37:11,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:37:11,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:37:11,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:37:11,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:37:11,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:37:11,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:37:11,866 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:37:11,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:37:11,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:37:11,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:37:11,867 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:37:11,867 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:37:11,867 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:37:11,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:37:11,868 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:37:11,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:37:11,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:37:11,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:37:11,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:37:11,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:37:11,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:37:11,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:37:11,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:37:11,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:37:11,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:37:11,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:37:11,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:37:11,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:37:11,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:37:11,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:37:11,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:37:11,870 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f8708414d69d58e69308ef3f6436b82a3a2ac306b0f68b7007fd3139e12ef15 [2024-11-07 16:37:12,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:37:12,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:37:12,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:37:12,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:37:12,147 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:37:12,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/dll-lst-shared.i [2024-11-07 16:37:13,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:37:13,720 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:37:13,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-shared.i [2024-11-07 16:37:13,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c36fdbf89/e24f2f87de4f438b90068223528a61ad/FLAG1ab931096 [2024-11-07 16:37:13,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c36fdbf89/e24f2f87de4f438b90068223528a61ad [2024-11-07 16:37:13,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:37:13,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:37:13,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:37:13,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:37:13,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:37:13,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:37:13" (1/1) ... [2024-11-07 16:37:13,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d6caefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:13, skipping insertion in model container [2024-11-07 16:37:13,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:37:13" (1/1) ... [2024-11-07 16:37:13,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:37:14,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:37:14,105 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:37:14,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:37:14,182 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:37:14,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:14 WrapperNode [2024-11-07 16:37:14,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:37:14,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:37:14,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:37:14,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:37:14,189 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:37:14" (1/1) ... [2024-11-07 16:37:14,202 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:37:14" (1/1) ... [2024-11-07 16:37:14,225 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 78 [2024-11-07 16:37:14,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:37:14,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:37:14,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:37:14,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:37:14,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:14" (1/1) ... [2024-11-07 16:37:14,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:14" (1/1) ... [2024-11-07 16:37:14,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:14" (1/1) ... [2024-11-07 16:37:14,262 INFO L175 MemorySlicer]: Split 14 memory accesses to 1 slices as follows [14]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2024-11-07 16:37:14,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:14" (1/1) ... [2024-11-07 16:37:14,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:14" (1/1) ... [2024-11-07 16:37:14,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:14" (1/1) ... [2024-11-07 16:37:14,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:14" (1/1) ... [2024-11-07 16:37:14,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:14" (1/1) ... [2024-11-07 16:37:14,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:14" (1/1) ... [2024-11-07 16:37:14,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:37:14,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:37:14,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:37:14,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:37:14,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:14" (1/1) ... [2024-11-07 16:37:14,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:37:14,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:14,314 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:37:14,318 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:37:14,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:37:14,341 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-07 16:37:14,341 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-07 16:37:14,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:37:14,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:37:14,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:37:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:37:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:37:14,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:37:14,441 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:37:14,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:37:14,754 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-11-07 16:37:14,754 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:37:14,769 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:37:14,770 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-07 16:37:14,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:37:14 BoogieIcfgContainer [2024-11-07 16:37:14,770 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:37:14,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:37:14,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:37:14,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:37:14,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:37:13" (1/3) ... [2024-11-07 16:37:14,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e200997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:37:14, skipping insertion in model container [2024-11-07 16:37:14,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:14" (2/3) ... [2024-11-07 16:37:14,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e200997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:37:14, skipping insertion in model container [2024-11-07 16:37:14,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:37:14" (3/3) ... [2024-11-07 16:37:14,780 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-lst-shared.i [2024-11-07 16:37:14,793 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:37:14,793 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-11-07 16:37:14,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:37:14,846 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;@7343ab59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:37:14,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-07 16:37:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:37:14,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:37:14,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:14,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:37:14,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:14,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:14,864 INFO L85 PathProgramCache]: Analyzing trace with hash 37387707, now seen corresponding path program 1 times [2024-11-07 16:37:14,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:14,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690226571] [2024-11-07 16:37:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:14,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:15,052 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:37:15,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:15,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690226571] [2024-11-07 16:37:15,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690226571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:15,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:15,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:37:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8591034] [2024-11-07 16:37:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:15,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:37:15,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:15,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:37:15,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:37:15,084 INFO L87 Difference]: Start difference. First operand has 85 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:37:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:15,186 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-11-07 16:37:15,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:37:15,188 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 16:37:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:15,194 INFO L225 Difference]: With dead ends: 83 [2024-11-07 16:37:15,194 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 16:37:15,195 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:37:15,198 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:15,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 130 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:37:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 16:37:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 16:37:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.8) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:37:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-07 16:37:15,234 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 5 [2024-11-07 16:37:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:15,235 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-07 16:37:15,235 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:37:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-07 16:37:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:37:15,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:15,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:37:15,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:37:15,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:15,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash 37387708, now seen corresponding path program 1 times [2024-11-07 16:37:15,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:15,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432539281] [2024-11-07 16:37:15,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:15,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:15,351 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:37:15,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:15,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432539281] [2024-11-07 16:37:15,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432539281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:15,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:15,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:37:15,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741350418] [2024-11-07 16:37:15,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:15,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:37:15,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:15,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:37:15,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:37:15,355 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:37:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:15,423 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-11-07 16:37:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:37:15,423 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 16:37:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:15,424 INFO L225 Difference]: With dead ends: 79 [2024-11-07 16:37:15,424 INFO L226 Difference]: Without dead ends: 79 [2024-11-07 16:37:15,424 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:37:15,425 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:15,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:37:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-07 16:37:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-07 16:37:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:37:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-07 16:37:15,431 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 5 [2024-11-07 16:37:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:15,431 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-07 16:37:15,431 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:37:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-07 16:37:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:37:15,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:15,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:15,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:37:15,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:15,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:15,432 INFO L85 PathProgramCache]: Analyzing trace with hash -802469099, now seen corresponding path program 1 times [2024-11-07 16:37:15,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:15,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689401784] [2024-11-07 16:37:15,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:15,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:15,613 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:37:15,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:15,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689401784] [2024-11-07 16:37:15,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689401784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:15,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:15,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:37:15,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247468707] [2024-11-07 16:37:15,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:15,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:37:15,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:15,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:37:15,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:37:15,616 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:15,748 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-11-07 16:37:15,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:37:15,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-07 16:37:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:15,753 INFO L225 Difference]: With dead ends: 83 [2024-11-07 16:37:15,753 INFO L226 Difference]: Without dead ends: 83 [2024-11-07 16:37:15,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:37:15,754 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:15,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 159 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:37:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-07 16:37:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2024-11-07 16:37:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:37:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-07 16:37:15,769 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 11 [2024-11-07 16:37:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:15,769 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-07 16:37:15,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-07 16:37:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:37:15,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:15,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:15,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:37:15,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:15,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash -802469100, now seen corresponding path program 1 times [2024-11-07 16:37:15,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:15,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170707264] [2024-11-07 16:37:15,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:15,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:15,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:15,889 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:37:15,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:15,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170707264] [2024-11-07 16:37:15,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170707264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:15,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:15,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:37:15,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139843033] [2024-11-07 16:37:15,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:15,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:37:15,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:15,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:37:15,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:37:15,891 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:15,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:15,984 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2024-11-07 16:37:15,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:37:15,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-07 16:37:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:15,986 INFO L225 Difference]: With dead ends: 82 [2024-11-07 16:37:15,986 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 16:37:15,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:37:15,986 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:15,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 153 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:37:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 16:37:15,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2024-11-07 16:37:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.711111111111111) internal successors, (77), 73 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:37:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2024-11-07 16:37:15,994 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 11 [2024-11-07 16:37:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:15,994 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2024-11-07 16:37:15,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2024-11-07 16:37:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:37:15,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:15,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:15,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:37:15,996 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:15,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:15,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1921307765, now seen corresponding path program 1 times [2024-11-07 16:37:15,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:15,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203658301] [2024-11-07 16:37:15,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:15,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:16,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:37:16,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:16,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203658301] [2024-11-07 16:37:16,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203658301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:16,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:16,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:37:16,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264764300] [2024-11-07 16:37:16,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:16,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:37:16,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:16,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:37:16,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:37:16,223 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:16,407 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2024-11-07 16:37:16,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:37:16,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-07 16:37:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:16,408 INFO L225 Difference]: With dead ends: 78 [2024-11-07 16:37:16,408 INFO L226 Difference]: Without dead ends: 78 [2024-11-07 16:37:16,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:37:16,409 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 16 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:16,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 265 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:37:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-07 16:37:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-07 16:37:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:37:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-11-07 16:37:16,413 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 13 [2024-11-07 16:37:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:16,413 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-11-07 16:37:16,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-11-07 16:37:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:37:16,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:16,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:16,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:37:16,414 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:16,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:16,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1921307766, now seen corresponding path program 1 times [2024-11-07 16:37:16,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:16,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611878530] [2024-11-07 16:37:16,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:16,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:16,761 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:37:16,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:16,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611878530] [2024-11-07 16:37:16,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611878530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:16,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:16,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:37:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346574735] [2024-11-07 16:37:16,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:16,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:37:16,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:16,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:37:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:37:16,764 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:16,915 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-11-07 16:37:16,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:37:16,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-07 16:37:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:16,916 INFO L225 Difference]: With dead ends: 77 [2024-11-07 16:37:16,916 INFO L226 Difference]: Without dead ends: 77 [2024-11-07 16:37:16,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:37:16,917 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 6 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:16,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 304 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:37:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-07 16:37:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2024-11-07 16:37:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.6) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:37:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-07 16:37:16,927 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 13 [2024-11-07 16:37:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:16,928 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-07 16:37:16,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-07 16:37:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 16:37:16,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:16,928 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:37:16,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:37:16,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:16,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1295463995, now seen corresponding path program 1 times [2024-11-07 16:37:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:16,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784043693] [2024-11-07 16:37:16,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:16,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:17,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:17,062 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:37:17,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:17,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784043693] [2024-11-07 16:37:17,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784043693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:17,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:17,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:37:17,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893194865] [2024-11-07 16:37:17,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:17,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:37:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:17,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:37:17,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:37:17,064 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:17,239 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2024-11-07 16:37:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:37:17,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-07 16:37:17,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:17,241 INFO L225 Difference]: With dead ends: 101 [2024-11-07 16:37:17,241 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 16:37:17,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:37:17,242 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 42 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:17,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 250 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:37:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 16:37:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2024-11-07 16:37:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 86 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2024-11-07 16:37:17,250 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 19 [2024-11-07 16:37:17,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:17,250 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2024-11-07 16:37:17,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2024-11-07 16:37:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 16:37:17,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:17,251 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:37:17,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:37:17,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:17,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:17,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1295463996, now seen corresponding path program 1 times [2024-11-07 16:37:17,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:17,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795304882] [2024-11-07 16:37:17,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:17,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:17,536 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:37:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:17,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795304882] [2024-11-07 16:37:17,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795304882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:17,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:17,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:37:17,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660431961] [2024-11-07 16:37:17,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:17,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:37:17,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:17,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:37:17,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:37:17,538 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:17,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:17,752 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2024-11-07 16:37:17,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 16:37:17,752 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-07 16:37:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:17,753 INFO L225 Difference]: With dead ends: 109 [2024-11-07 16:37:17,753 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 16:37:17,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:37:17,754 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 42 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:17,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 416 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:37:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 16:37:17,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2024-11-07 16:37:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.6231884057971016) internal successors, (112), 92 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-11-07 16:37:17,763 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 19 [2024-11-07 16:37:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:17,763 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-11-07 16:37:17,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-11-07 16:37:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 16:37:17,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:17,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:17,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:37:17,765 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:17,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:17,765 INFO L85 PathProgramCache]: Analyzing trace with hash -599661973, now seen corresponding path program 1 times [2024-11-07 16:37:17,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:17,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507901083] [2024-11-07 16:37:17,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:17,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:17,917 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:37:17,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:17,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507901083] [2024-11-07 16:37:17,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507901083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:17,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:17,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:37:17,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436801164] [2024-11-07 16:37:17,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:17,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:37:17,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:17,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:37:17,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:37:17,924 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:18,026 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2024-11-07 16:37:18,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:37:18,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-07 16:37:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:18,028 INFO L225 Difference]: With dead ends: 106 [2024-11-07 16:37:18,028 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 16:37:18,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:37:18,029 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 26 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:18,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 450 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:37:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 16:37:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-07 16:37:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.6) internal successors, (112), 93 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2024-11-07 16:37:18,040 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 21 [2024-11-07 16:37:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:18,040 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2024-11-07 16:37:18,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2024-11-07 16:37:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:37:18,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:18,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:18,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:37:18,041 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:18,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1408205040, now seen corresponding path program 1 times [2024-11-07 16:37:18,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:18,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605380661] [2024-11-07 16:37:18,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:18,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:18,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:37:18,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:18,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605380661] [2024-11-07 16:37:18,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605380661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:18,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:18,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:37:18,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983472442] [2024-11-07 16:37:18,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:18,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:37:18,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:18,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:37:18,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:37:18,160 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:18,313 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2024-11-07 16:37:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:37:18,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-07 16:37:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:18,315 INFO L225 Difference]: With dead ends: 111 [2024-11-07 16:37:18,315 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 16:37:18,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:37:18,316 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 34 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:18,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 248 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:37:18,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 16:37:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2024-11-07 16:37:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.5810810810810811) internal successors, (117), 97 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2024-11-07 16:37:18,323 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 22 [2024-11-07 16:37:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:18,324 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2024-11-07 16:37:18,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2024-11-07 16:37:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:37:18,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:18,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:18,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:37:18,324 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:18,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1408205039, now seen corresponding path program 1 times [2024-11-07 16:37:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:18,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427051344] [2024-11-07 16:37:18,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:18,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:18,712 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:37:18,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:18,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427051344] [2024-11-07 16:37:18,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427051344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:18,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:18,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:37:18,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540730450] [2024-11-07 16:37:18,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:18,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:37:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:18,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:37:18,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:37:18,715 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:18,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:18,908 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2024-11-07 16:37:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:37:18,908 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-07 16:37:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:18,909 INFO L225 Difference]: With dead ends: 109 [2024-11-07 16:37:18,909 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 16:37:18,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:37:18,910 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 8 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:18,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 314 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:37:18,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 16:37:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-07 16:37:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.5308641975308641) internal successors, (124), 104 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2024-11-07 16:37:18,914 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 22 [2024-11-07 16:37:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:18,914 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2024-11-07 16:37:18,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2024-11-07 16:37:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:37:18,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:18,915 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:18,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:37:18,916 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:18,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1461881377, now seen corresponding path program 1 times [2024-11-07 16:37:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:18,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927407262] [2024-11-07 16:37:18,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:18,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:19,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:19,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:19,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:19,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:19,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927407262] [2024-11-07 16:37:19,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927407262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:19,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:19,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:37:19,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871124759] [2024-11-07 16:37:19,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:19,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:37:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:19,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:37:19,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:37:19,086 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:37:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:19,179 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2024-11-07 16:37:19,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:37:19,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-07 16:37:19,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:19,180 INFO L225 Difference]: With dead ends: 109 [2024-11-07 16:37:19,180 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 16:37:19,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:37:19,181 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:19,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 128 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:37:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 16:37:19,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-07 16:37:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 104 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2024-11-07 16:37:19,188 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 23 [2024-11-07 16:37:19,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:19,188 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2024-11-07 16:37:19,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:37:19,188 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2024-11-07 16:37:19,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:37:19,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:19,189 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:19,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 16:37:19,189 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:19,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:19,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1461881378, now seen corresponding path program 1 times [2024-11-07 16:37:19,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:19,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454041370] [2024-11-07 16:37:19,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:19,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:19,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:19,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:19,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454041370] [2024-11-07 16:37:19,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454041370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:19,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42632186] [2024-11-07 16:37:19,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:19,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:19,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:19,633 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:37:19,635 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:37:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:19,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 16:37:19,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:19,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:37:19,818 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:37:19,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:19,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 16:37:19,969 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:19,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:20,087 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-07 16:37:20,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:20,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 16:37:20,142 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:20,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-07 16:37:20,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:20,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42632186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:20,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:37:20,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-11-07 16:37:20,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124216891] [2024-11-07 16:37:20,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:20,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 16:37:20,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:20,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 16:37:20,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2024-11-07 16:37:20,293 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:37:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:20,597 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2024-11-07 16:37:20,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:37:20,611 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2024-11-07 16:37:20,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:20,612 INFO L225 Difference]: With dead ends: 113 [2024-11-07 16:37:20,612 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 16:37:20,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=391, Unknown=1, NotChecked=40, Total=506 [2024-11-07 16:37:20,613 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 58 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:20,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 352 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 311 Invalid, 0 Unknown, 91 Unchecked, 0.2s Time] [2024-11-07 16:37:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 16:37:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-07 16:37:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 104 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2024-11-07 16:37:20,618 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 23 [2024-11-07 16:37:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:20,618 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2024-11-07 16:37:20,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:37:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2024-11-07 16:37:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:37:20,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:20,619 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:20,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 16:37:20,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-07 16:37:20,824 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:20,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:20,824 INFO L85 PathProgramCache]: Analyzing trace with hash -60274233, now seen corresponding path program 1 times [2024-11-07 16:37:20,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:20,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100171185] [2024-11-07 16:37:20,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:20,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:20,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:20,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:37:20,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:20,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100171185] [2024-11-07 16:37:20,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100171185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:20,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:20,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:37:20,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110115020] [2024-11-07 16:37:20,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:20,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:37:20,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:20,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:37:20,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:37:20,991 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:37:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:21,142 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2024-11-07 16:37:21,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:37:21,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-07 16:37:21,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:21,143 INFO L225 Difference]: With dead ends: 108 [2024-11-07 16:37:21,143 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 16:37:21,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:37:21,144 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 8 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:21,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 279 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:37:21,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 16:37:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-07 16:37:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 103 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2024-11-07 16:37:21,147 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 26 [2024-11-07 16:37:21,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:21,148 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2024-11-07 16:37:21,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:37:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2024-11-07 16:37:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:37:21,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:21,148 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:21,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 16:37:21,149 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:21,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:21,149 INFO L85 PathProgramCache]: Analyzing trace with hash -60274232, now seen corresponding path program 1 times [2024-11-07 16:37:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:21,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423776351] [2024-11-07 16:37:21,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:21,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:21,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:21,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423776351] [2024-11-07 16:37:21,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423776351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:21,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:21,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:37:21,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981843045] [2024-11-07 16:37:21,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:21,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:37:21,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:21,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:37:21,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:37:21,417 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:37:21,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:21,583 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2024-11-07 16:37:21,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:37:21,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-07 16:37:21,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:21,584 INFO L225 Difference]: With dead ends: 107 [2024-11-07 16:37:21,584 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 16:37:21,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:37:21,585 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:21,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 313 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:37:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 16:37:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-07 16:37:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 102 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2024-11-07 16:37:21,589 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 26 [2024-11-07 16:37:21,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:21,589 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2024-11-07 16:37:21,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:37:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2024-11-07 16:37:21,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:37:21,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:21,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:21,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 16:37:21,590 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:21,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:21,591 INFO L85 PathProgramCache]: Analyzing trace with hash 862583441, now seen corresponding path program 1 times [2024-11-07 16:37:21,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:21,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503388154] [2024-11-07 16:37:21,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:21,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:21,690 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:37:21,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:21,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503388154] [2024-11-07 16:37:21,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503388154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:21,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:21,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:37:21,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800449603] [2024-11-07 16:37:21,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:21,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:37:21,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:21,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:37:21,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:37:21,692 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:21,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:21,876 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2024-11-07 16:37:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:37:21,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-07 16:37:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:21,877 INFO L225 Difference]: With dead ends: 116 [2024-11-07 16:37:21,877 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 16:37:21,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:37:21,878 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 42 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:21,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 229 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:37:21,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 16:37:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2024-11-07 16:37:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.430232558139535) internal successors, (123), 106 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2024-11-07 16:37:21,881 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 27 [2024-11-07 16:37:21,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:21,882 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2024-11-07 16:37:21,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2024-11-07 16:37:21,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:37:21,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:21,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:21,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 16:37:21,883 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:21,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash 862583442, now seen corresponding path program 1 times [2024-11-07 16:37:21,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:21,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927491396] [2024-11-07 16:37:21,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:21,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:22,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:37:22,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:22,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927491396] [2024-11-07 16:37:22,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927491396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:22,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951614441] [2024-11-07 16:37:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:22,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:22,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:22,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:37:22,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 16:37:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:22,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 16:37:22,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:37:22,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:22,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:22,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-11-07 16:37:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:37:22,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951614441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:37:22,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:37:22,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2024-11-07 16:37:22,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064636101] [2024-11-07 16:37:22,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:22,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 16:37:22,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:22,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 16:37:22,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:37:22,630 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:37:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:23,050 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2024-11-07 16:37:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 16:37:23,051 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-07 16:37:23,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:23,052 INFO L225 Difference]: With dead ends: 121 [2024-11-07 16:37:23,053 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 16:37:23,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2024-11-07 16:37:23,054 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 130 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:23,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 523 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:37:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 16:37:23,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2024-11-07 16:37:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 109 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2024-11-07 16:37:23,058 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 27 [2024-11-07 16:37:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:23,059 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2024-11-07 16:37:23,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:37:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2024-11-07 16:37:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:37:23,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:23,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:23,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 16:37:23,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 16:37:23,265 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:23,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash 970282953, now seen corresponding path program 1 times [2024-11-07 16:37:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:23,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610024211] [2024-11-07 16:37:23,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:23,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:23,433 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:37:23,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:23,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610024211] [2024-11-07 16:37:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610024211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:23,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:23,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:37:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534178270] [2024-11-07 16:37:23,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:23,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:37:23,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:23,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:37:23,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:37:23,435 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:23,615 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2024-11-07 16:37:23,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:37:23,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-07 16:37:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:23,616 INFO L225 Difference]: With dead ends: 138 [2024-11-07 16:37:23,616 INFO L226 Difference]: Without dead ends: 138 [2024-11-07 16:37:23,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:37:23,617 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 27 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:23,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 334 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:37:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-07 16:37:23,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2024-11-07 16:37:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.39) internal successors, (139), 119 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2024-11-07 16:37:23,621 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 28 [2024-11-07 16:37:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:23,621 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2024-11-07 16:37:23,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2024-11-07 16:37:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:37:23,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:23,622 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:23,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 16:37:23,623 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:23,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:23,623 INFO L85 PathProgramCache]: Analyzing trace with hash 971729834, now seen corresponding path program 1 times [2024-11-07 16:37:23,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:23,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174258355] [2024-11-07 16:37:23,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:23,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:37:24,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174258355] [2024-11-07 16:37:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174258355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138446754] [2024-11-07 16:37:24,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:24,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:24,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:24,222 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:37:24,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 16:37:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:24,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-07 16:37:24,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:24,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:37:24,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:37:24,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:37:24,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-07 16:37:24,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-07 16:37:24,567 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:24,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:24,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-07 16:37:24,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-07 16:37:24,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:24,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:24,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-07 16:37:24,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:24,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:24,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-07 16:37:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:37:24,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:25,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:25,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-07 16:37:25,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:25,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2024-11-07 16:37:25,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:37:25,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:25,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-07 16:37:26,002 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:37:26,009 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:37:26,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2024-11-07 16:37:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:37:26,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138446754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:37:26,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:37:26,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 34 [2024-11-07 16:37:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800225564] [2024-11-07 16:37:26,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:26,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-07 16:37:26,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:26,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-07 16:37:26,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1012, Unknown=2, NotChecked=0, Total=1122 [2024-11-07 16:37:26,061 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 30 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:37:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:26,712 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2024-11-07 16:37:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:37:26,713 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 30 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-07 16:37:26,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:26,714 INFO L225 Difference]: With dead ends: 120 [2024-11-07 16:37:26,714 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 16:37:26,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=141, Invalid=1339, Unknown=2, NotChecked=0, Total=1482 [2024-11-07 16:37:26,715 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 22 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:26,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 884 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 16:37:26,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 16:37:26,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 16:37:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.375) internal successors, (132), 115 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2024-11-07 16:37:26,718 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 28 [2024-11-07 16:37:26,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:26,719 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2024-11-07 16:37:26,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 30 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:37:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2024-11-07 16:37:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:37:26,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:26,722 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:26,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 16:37:26,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:26,926 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:26,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:26,926 INFO L85 PathProgramCache]: Analyzing trace with hash -333333623, now seen corresponding path program 1 times [2024-11-07 16:37:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:26,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208475751] [2024-11-07 16:37:26,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:26,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:27,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:27,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:27,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:27,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208475751] [2024-11-07 16:37:27,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208475751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:27,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:27,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:37:27,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865341573] [2024-11-07 16:37:27,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:27,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:37:27,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:27,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:37:27,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:37:27,301 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:37:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:27,522 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2024-11-07 16:37:27,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:37:27,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-07 16:37:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:27,523 INFO L225 Difference]: With dead ends: 121 [2024-11-07 16:37:27,523 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 16:37:27,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:37:27,524 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 24 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:27,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 361 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:37:27,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 16:37:27,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-07 16:37:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 115 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2024-11-07 16:37:27,528 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 29 [2024-11-07 16:37:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:27,528 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2024-11-07 16:37:27,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:37:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2024-11-07 16:37:27,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:37:27,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:27,529 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:27,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 16:37:27,529 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:27,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:27,529 INFO L85 PathProgramCache]: Analyzing trace with hash -333333624, now seen corresponding path program 1 times [2024-11-07 16:37:27,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:27,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672962190] [2024-11-07 16:37:27,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:27,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:27,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:27,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:27,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:27,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672962190] [2024-11-07 16:37:27,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672962190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:27,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:27,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:37:27,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294636658] [2024-11-07 16:37:27,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:27,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:37:27,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:27,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:37:27,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:37:27,795 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:37:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:28,027 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2024-11-07 16:37:28,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:37:28,028 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-07 16:37:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:28,028 INFO L225 Difference]: With dead ends: 120 [2024-11-07 16:37:28,028 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 16:37:28,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:37:28,029 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 21 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:28,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 378 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:37:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 16:37:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 16:37:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 115 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2024-11-07 16:37:28,036 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 29 [2024-11-07 16:37:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:28,036 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2024-11-07 16:37:28,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:37:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2024-11-07 16:37:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:37:28,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:28,037 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:28,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 16:37:28,037 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:28,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash 14345560, now seen corresponding path program 1 times [2024-11-07 16:37:28,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:28,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628285093] [2024-11-07 16:37:28,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:28,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:28,144 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:37:28,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:28,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628285093] [2024-11-07 16:37:28,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628285093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:28,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:28,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:37:28,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935918174] [2024-11-07 16:37:28,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:28,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:37:28,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:28,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:37:28,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:37:28,146 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:28,258 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2024-11-07 16:37:28,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:37:28,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-07 16:37:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:28,260 INFO L225 Difference]: With dead ends: 120 [2024-11-07 16:37:28,260 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 16:37:28,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:37:28,261 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 35 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:28,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 407 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:37:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 16:37:28,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-11-07 16:37:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 113 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2024-11-07 16:37:28,265 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 29 [2024-11-07 16:37:28,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:28,265 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2024-11-07 16:37:28,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2024-11-07 16:37:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:37:28,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:28,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:28,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 16:37:28,266 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:28,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:28,266 INFO L85 PathProgramCache]: Analyzing trace with hash 14000593, now seen corresponding path program 1 times [2024-11-07 16:37:28,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:28,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716700078] [2024-11-07 16:37:28,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:28,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:28,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:28,443 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:37:28,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:28,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716700078] [2024-11-07 16:37:28,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716700078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:28,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:28,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:37:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353985204] [2024-11-07 16:37:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:28,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:37:28,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:28,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:37:28,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:37:28,445 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:28,652 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2024-11-07 16:37:28,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:37:28,652 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-07 16:37:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:28,653 INFO L225 Difference]: With dead ends: 125 [2024-11-07 16:37:28,653 INFO L226 Difference]: Without dead ends: 125 [2024-11-07 16:37:28,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:37:28,654 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 22 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:28,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 295 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:37:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-07 16:37:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2024-11-07 16:37:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.305263157894737) internal successors, (124), 114 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2024-11-07 16:37:28,659 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 29 [2024-11-07 16:37:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:28,659 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2024-11-07 16:37:28,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2024-11-07 16:37:28,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:37:28,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:28,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:28,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 16:37:28,660 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:28,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:28,660 INFO L85 PathProgramCache]: Analyzing trace with hash 434018507, now seen corresponding path program 1 times [2024-11-07 16:37:28,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:28,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868527983] [2024-11-07 16:37:28,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:28,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:28,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:28,812 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:37:28,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:28,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868527983] [2024-11-07 16:37:28,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868527983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:28,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:28,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:37:28,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136084861] [2024-11-07 16:37:28,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:28,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:37:28,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:28,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:37:28,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:37:28,814 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:29,011 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2024-11-07 16:37:29,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:37:29,012 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-07 16:37:29,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:29,013 INFO L225 Difference]: With dead ends: 120 [2024-11-07 16:37:29,013 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 16:37:29,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:37:29,013 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 16 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:29,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 332 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:37:29,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 16:37:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 16:37:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 115 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2024-11-07 16:37:29,019 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 30 [2024-11-07 16:37:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:29,019 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2024-11-07 16:37:29,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2024-11-07 16:37:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 16:37:29,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:29,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:29,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 16:37:29,020 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:29,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:29,020 INFO L85 PathProgramCache]: Analyzing trace with hash 479961838, now seen corresponding path program 1 times [2024-11-07 16:37:29,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:29,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766148381] [2024-11-07 16:37:29,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:29,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:29,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:29,280 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:37:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766148381] [2024-11-07 16:37:29,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766148381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:29,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:29,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 16:37:29,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692712385] [2024-11-07 16:37:29,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:29,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:37:29,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:29,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:37:29,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:37:29,282 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:29,540 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2024-11-07 16:37:29,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:37:29,541 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-07 16:37:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:29,542 INFO L225 Difference]: With dead ends: 124 [2024-11-07 16:37:29,542 INFO L226 Difference]: Without dead ends: 124 [2024-11-07 16:37:29,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:37:29,543 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:29,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 307 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:37:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-07 16:37:29,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-11-07 16:37:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 117 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2024-11-07 16:37:29,549 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 32 [2024-11-07 16:37:29,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:29,550 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2024-11-07 16:37:29,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2024-11-07 16:37:29,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 16:37:29,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:29,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:29,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 16:37:29,551 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:29,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:29,552 INFO L85 PathProgramCache]: Analyzing trace with hash 597065985, now seen corresponding path program 1 times [2024-11-07 16:37:29,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:29,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548798209] [2024-11-07 16:37:29,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:29,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:29,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:29,706 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:37:29,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:29,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548798209] [2024-11-07 16:37:29,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548798209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:37:29,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:37:29,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:37:29,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218774201] [2024-11-07 16:37:29,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:37:29,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:37:29,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:29,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:37:29,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:37:29,707 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:29,844 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2024-11-07 16:37:29,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:37:29,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-07 16:37:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:29,845 INFO L225 Difference]: With dead ends: 123 [2024-11-07 16:37:29,845 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 16:37:29,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:37:29,846 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 26 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:29,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 372 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:37:29,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 16:37:29,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-07 16:37:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.292929292929293) internal successors, (128), 118 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2024-11-07 16:37:29,850 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 35 [2024-11-07 16:37:29,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:29,850 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2024-11-07 16:37:29,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:37:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2024-11-07 16:37:29,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 16:37:29,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:29,851 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:29,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 16:37:29,851 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:29,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1733330067, now seen corresponding path program 1 times [2024-11-07 16:37:29,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:29,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077400771] [2024-11-07 16:37:29,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:29,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:30,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:30,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:30,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077400771] [2024-11-07 16:37:30,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077400771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:30,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548117638] [2024-11-07 16:37:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:30,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:30,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:30,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:37:30,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 16:37:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:30,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-07 16:37:30,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:30,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:37:30,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:37:30,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:37:30,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-07 16:37:30,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-07 16:37:30,898 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:30,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:30,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-07 16:37:30,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-07 16:37:31,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:31,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:31,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-07 16:37:31,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:31,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:31,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-07 16:37:31,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:31,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-07 16:37:31,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:31,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2024-11-07 16:37:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:31,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:31,819 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_1382 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1382))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8) 0)) (forall ((v_ArrVal_1384 Int) (v_ArrVal_1383 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1383))) (store .cse1 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_1384))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8) 0))) is different from false [2024-11-07 16:37:32,247 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_alloc_and_zero_~pi~0.offset 16))) (and (forall ((v_ArrVal_1384 Int) (v_ArrVal_1383 (Array Int Int)) (|v_ULTIMATE.start_create_~now~0#1.offset_21| Int) (|v_ULTIMATE.start_create_~data~0#1.base_14| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_~data~0#1.base_14|) 0)) (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| c_alloc_and_zero_~pi~0.base (store (select |c_#memory_$Pointer$#0.base| c_alloc_and_zero_~pi~0.base) .cse0 0)) |v_ULTIMATE.start_create_~data~0#1.base_14| v_ArrVal_1383) c_alloc_and_zero_~pi~0.base) |v_ULTIMATE.start_create_~now~0#1.offset_21| v_ArrVal_1384) 8) 0) (< c_alloc_and_zero_~pi~0.offset |v_ULTIMATE.start_create_~now~0#1.offset_21|))) (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_1382 (Array Int Int)) (|v_ULTIMATE.start_create_~now~0#1.offset_21| Int) (|v_ULTIMATE.start_create_~data~0#1.base_14| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_~data~0#1.base_14|) 0)) (= (select (store (select (store (store |c_#memory_$Pointer$#0.offset| c_alloc_and_zero_~pi~0.base (store (select |c_#memory_$Pointer$#0.offset| c_alloc_and_zero_~pi~0.base) .cse0 0)) |v_ULTIMATE.start_create_~data~0#1.base_14| v_ArrVal_1382) c_alloc_and_zero_~pi~0.base) |v_ULTIMATE.start_create_~now~0#1.offset_21| |ULTIMATE.start_create_~data~0#1.offset|) 8) 0) (< c_alloc_and_zero_~pi~0.offset |v_ULTIMATE.start_create_~now~0#1.offset_21|))))) is different from false [2024-11-07 16:37:32,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:32,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-07 16:37:32,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2024-11-07 16:37:32,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-07 16:37:32,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:32,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2024-11-07 16:37:32,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:32,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-07 16:37:32,392 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:37:32,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-11-07 16:37:32,413 INFO L349 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2024-11-07 16:37:32,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 32 [2024-11-07 16:37:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:32,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548117638] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:37:32,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:37:32,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 44 [2024-11-07 16:37:32,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219860405] [2024-11-07 16:37:32,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:32,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-07 16:37:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:32,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-07 16:37:32,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1591, Unknown=4, NotChecked=162, Total=1892 [2024-11-07 16:37:32,493 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:37:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:33,302 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2024-11-07 16:37:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:37:33,303 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-07 16:37:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:33,304 INFO L225 Difference]: With dead ends: 128 [2024-11-07 16:37:33,304 INFO L226 Difference]: Without dead ends: 128 [2024-11-07 16:37:33,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=202, Invalid=2352, Unknown=4, NotChecked=198, Total=2756 [2024-11-07 16:37:33,306 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 17 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:33,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1127 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 911 Invalid, 0 Unknown, 115 Unchecked, 0.5s Time] [2024-11-07 16:37:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-07 16:37:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-07 16:37:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 123 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2024-11-07 16:37:33,312 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 38 [2024-11-07 16:37:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:33,313 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2024-11-07 16:37:33,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:37:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2024-11-07 16:37:33,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 16:37:33,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:33,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:33,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 16:37:33,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-07 16:37:33,515 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:33,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2101344200, now seen corresponding path program 1 times [2024-11-07 16:37:33,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:33,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365083949] [2024-11-07 16:37:33,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:33,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:33,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:34,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:34,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365083949] [2024-11-07 16:37:34,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365083949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:34,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631744561] [2024-11-07 16:37:34,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:34,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:34,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:34,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:37:34,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 16:37:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:34,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-07 16:37:34,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:34,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 16:37:34,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:34,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2024-11-07 16:37:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:35,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:35,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 80 [2024-11-07 16:37:35,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631744561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:35,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:37:35,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2024-11-07 16:37:35,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16988220] [2024-11-07 16:37:35,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:35,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-07 16:37:35,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:35,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-07 16:37:35,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1449, Unknown=2, NotChecked=0, Total=1560 [2024-11-07 16:37:35,995 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 26 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:37:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:37,206 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2024-11-07 16:37:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 16:37:37,207 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 26 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2024-11-07 16:37:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:37,208 INFO L225 Difference]: With dead ends: 130 [2024-11-07 16:37:37,208 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 16:37:37,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=183, Invalid=2167, Unknown=2, NotChecked=0, Total=2352 [2024-11-07 16:37:37,209 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:37,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 640 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 906 Invalid, 1 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 16:37:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 16:37:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-07 16:37:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 101 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2024-11-07 16:37:37,219 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 39 [2024-11-07 16:37:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:37,219 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2024-11-07 16:37:37,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 26 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:37:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2024-11-07 16:37:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 16:37:37,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:37,220 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:37,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 16:37:37,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-07 16:37:37,421 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:37,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:37,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1735997016, now seen corresponding path program 1 times [2024-11-07 16:37:37,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:37,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063337312] [2024-11-07 16:37:37,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:37,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:37,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:37,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:37,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:37,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063337312] [2024-11-07 16:37:37,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063337312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:37,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639587901] [2024-11-07 16:37:37,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:37,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:37,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:37,672 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:37:37,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 16:37:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:37,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 16:37:37,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 16:37:37,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:38,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:38,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-07 16:37:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 16:37:38,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639587901] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:37:38,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:37:38,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 20 [2024-11-07 16:37:38,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384790496] [2024-11-07 16:37:38,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:38,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 16:37:38,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:38,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 16:37:38,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:37:38,113 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 21 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:37:38,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:38,288 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2024-11-07 16:37:38,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 16:37:38,288 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2024-11-07 16:37:38,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:38,289 INFO L225 Difference]: With dead ends: 107 [2024-11-07 16:37:38,289 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 16:37:38,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:37:38,290 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:38,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 645 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:37:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 16:37:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-07 16:37:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.329268292682927) internal successors, (109), 101 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2024-11-07 16:37:38,293 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 41 [2024-11-07 16:37:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:38,293 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2024-11-07 16:37:38,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:37:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2024-11-07 16:37:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:37:38,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:38,294 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:38,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 16:37:38,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-07 16:37:38,494 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:38,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:38,495 INFO L85 PathProgramCache]: Analyzing trace with hash 147897274, now seen corresponding path program 1 times [2024-11-07 16:37:38,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:38,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560429368] [2024-11-07 16:37:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:38,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:38,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:38,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:38,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 16:37:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 16:37:38,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:38,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560429368] [2024-11-07 16:37:38,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560429368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:38,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573926042] [2024-11-07 16:37:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:38,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:38,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:38,900 INFO L229 MonitoredProcess]: Starting monitored process 8 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:37:38,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 16:37:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:39,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 16:37:39,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:39,098 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:39,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:39,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:37:39,149 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:37:39,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-07 16:37:39,181 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:37:39,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-07 16:37:39,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 16:37:39,206 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-07 16:37:39,235 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-07 16:37:39,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-07 16:37:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2024-11-07 16:37:39,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:39,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573926042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:39,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:37:39,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2024-11-07 16:37:39,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983375385] [2024-11-07 16:37:39,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:39,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 16:37:39,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:39,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 16:37:39,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2024-11-07 16:37:39,286 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 16:37:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:39,574 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-11-07 16:37:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 16:37:39,575 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-07 16:37:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:39,575 INFO L225 Difference]: With dead ends: 104 [2024-11-07 16:37:39,575 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 16:37:39,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=652, Unknown=1, NotChecked=52, Total=812 [2024-11-07 16:37:39,576 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:39,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 545 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 441 Invalid, 0 Unknown, 64 Unchecked, 0.2s Time] [2024-11-07 16:37:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 16:37:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-07 16:37:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2024-11-07 16:37:39,579 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 42 [2024-11-07 16:37:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:39,579 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2024-11-07 16:37:39,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 16:37:39,579 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2024-11-07 16:37:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:37:39,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:39,580 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:39,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 16:37:39,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:39,780 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:39,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash 147897275, now seen corresponding path program 1 times [2024-11-07 16:37:39,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:39,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553733068] [2024-11-07 16:37:39,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:39,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:40,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:40,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:40,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 16:37:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:37:40,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:40,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553733068] [2024-11-07 16:37:40,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553733068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:40,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999371509] [2024-11-07 16:37:40,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:40,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:40,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:40,425 INFO L229 MonitoredProcess]: Starting monitored process 9 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:37:40,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 16:37:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:40,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-07 16:37:40,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:40,611 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:37:40,668 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:40,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:40,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:37:40,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 16:37:40,773 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:37:40,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-07 16:37:40,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 16:37:40,857 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:37:40,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-07 16:37:40,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 16:37:40,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-07 16:37:40,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-07 16:37:40,956 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-07 16:37:40,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:40,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 16:37:40,985 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:40,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-07 16:37:41,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:41,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999371509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:41,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:37:41,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2024-11-07 16:37:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543028573] [2024-11-07 16:37:41,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:41,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-07 16:37:41,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:41,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-07 16:37:41,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=835, Unknown=1, NotChecked=58, Total=992 [2024-11-07 16:37:41,110 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:37:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:41,587 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2024-11-07 16:37:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:37:41,588 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2024-11-07 16:37:41,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:41,588 INFO L225 Difference]: With dead ends: 100 [2024-11-07 16:37:41,588 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 16:37:41,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=1369, Unknown=1, NotChecked=76, Total=1640 [2024-11-07 16:37:41,589 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 48 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:41,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 620 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 553 Invalid, 0 Unknown, 73 Unchecked, 0.3s Time] [2024-11-07 16:37:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 16:37:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-07 16:37:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-07 16:37:41,592 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 42 [2024-11-07 16:37:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:41,592 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-07 16:37:41,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:37:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-07 16:37:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 16:37:41,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:41,593 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:41,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-07 16:37:41,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:41,794 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:41,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:41,794 INFO L85 PathProgramCache]: Analyzing trace with hash 124992976, now seen corresponding path program 1 times [2024-11-07 16:37:41,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:41,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718218175] [2024-11-07 16:37:41,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:41,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:42,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:42,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:37:42,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:42,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718218175] [2024-11-07 16:37:42,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718218175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:42,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512907785] [2024-11-07 16:37:42,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:42,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:42,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:42,325 INFO L229 MonitoredProcess]: Starting monitored process 10 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:37:42,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-07 16:37:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:42,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-07 16:37:42,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:42,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:37:42,782 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:42,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:42,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-07 16:37:42,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:37:42,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:42,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 16:37:42,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:42,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2024-11-07 16:37:42,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 18 [2024-11-07 16:37:42,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-07 16:37:42,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-07 16:37:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:43,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:43,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512907785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:43,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:37:43,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2024-11-07 16:37:43,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101352588] [2024-11-07 16:37:43,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:43,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-07 16:37:43,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:43,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-07 16:37:43,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1804, Unknown=11, NotChecked=0, Total=1980 [2024-11-07 16:37:43,820 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:37:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:44,307 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2024-11-07 16:37:44,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 16:37:44,307 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-11-07 16:37:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:44,308 INFO L225 Difference]: With dead ends: 112 [2024-11-07 16:37:44,308 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 16:37:44,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=265, Invalid=2586, Unknown=11, NotChecked=0, Total=2862 [2024-11-07 16:37:44,309 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:44,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 718 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:37:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 16:37:44,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 101. [2024-11-07 16:37:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-07 16:37:44,313 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 47 [2024-11-07 16:37:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:44,313 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-07 16:37:44,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:37:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-07 16:37:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 16:37:44,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:44,314 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:44,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-07 16:37:44,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:44,518 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:44,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 126439857, now seen corresponding path program 1 times [2024-11-07 16:37:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:44,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038104054] [2024-11-07 16:37:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:45,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:45,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:45,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:45,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038104054] [2024-11-07 16:37:45,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038104054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:45,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713025471] [2024-11-07 16:37:45,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:45,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:45,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:45,130 INFO L229 MonitoredProcess]: Starting monitored process 11 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:37:45,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-07 16:37:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:45,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-07 16:37:45,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:45,509 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:45,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:45,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:37:45,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:37:45,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-07 16:37:45,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:45,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 37 [2024-11-07 16:37:45,701 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:37:45,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-07 16:37:45,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 16:37:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:37:45,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:46,028 INFO L349 Elim1Store]: treesize reduction 5, result has 88.4 percent of original size [2024-11-07 16:37:46,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2024-11-07 16:37:46,185 INFO L349 Elim1Store]: treesize reduction 19, result has 69.4 percent of original size [2024-11-07 16:37:46,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 102 [2024-11-07 16:37:46,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:46,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 162 [2024-11-07 16:37:46,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2024-11-07 16:37:46,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:46,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2024-11-07 16:37:46,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713025471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:46,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:37:46,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2024-11-07 16:37:46,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786720969] [2024-11-07 16:37:46,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:46,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-07 16:37:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:46,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-07 16:37:46,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1994, Unknown=8, NotChecked=0, Total=2162 [2024-11-07 16:37:46,562 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 32 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:37:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:47,085 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2024-11-07 16:37:47,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 16:37:47,085 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 32 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-11-07 16:37:47,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:47,086 INFO L225 Difference]: With dead ends: 108 [2024-11-07 16:37:47,086 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 16:37:47,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=257, Invalid=2815, Unknown=8, NotChecked=0, Total=3080 [2024-11-07 16:37:47,087 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:47,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 905 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:37:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 16:37:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-07 16:37:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 102 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2024-11-07 16:37:47,090 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 47 [2024-11-07 16:37:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:47,090 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2024-11-07 16:37:47,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 32 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:37:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2024-11-07 16:37:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 16:37:47,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:47,091 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:47,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-07 16:37:47,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:47,292 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:47,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash 126439858, now seen corresponding path program 1 times [2024-11-07 16:37:47,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:47,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579259950] [2024-11-07 16:37:47,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:47,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:47,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:47,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579259950] [2024-11-07 16:37:47,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579259950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322977468] [2024-11-07 16:37:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:47,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:47,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:47,985 INFO L229 MonitoredProcess]: Starting monitored process 12 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:37:47,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-07 16:37:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:48,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-07 16:37:48,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:48,277 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:37:48,330 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:48,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:48,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:37:48,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 16:37:48,499 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:37:48,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 16:37:48,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 16:37:48,558 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:37:48,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 16:37:48,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 16:37:48,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 16:37:48,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-07 16:37:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:37:48,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:49,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:49,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2024-11-07 16:37:49,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:49,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-07 16:37:49,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2024-11-07 16:37:49,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:49,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 207 [2024-11-07 16:37:49,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2024-11-07 16:37:49,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-11-07 16:37:49,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2024-11-07 16:37:49,352 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-07 16:37:49,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 1 [2024-11-07 16:37:49,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322977468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:49,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:37:49,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2024-11-07 16:37:49,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269986810] [2024-11-07 16:37:49,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:49,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-07 16:37:49,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:49,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-07 16:37:49,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2260, Unknown=4, NotChecked=0, Total=2450 [2024-11-07 16:37:49,480 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 32 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:37:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:49,980 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2024-11-07 16:37:49,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 16:37:49,980 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 32 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-11-07 16:37:49,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:49,981 INFO L225 Difference]: With dead ends: 108 [2024-11-07 16:37:49,981 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 16:37:49,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=261, Invalid=2815, Unknown=4, NotChecked=0, Total=3080 [2024-11-07 16:37:49,982 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 24 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:49,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 988 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:37:49,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 16:37:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-07 16:37:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.247191011235955) internal successors, (111), 102 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2024-11-07 16:37:49,984 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 47 [2024-11-07 16:37:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:49,984 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2024-11-07 16:37:49,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 32 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:37:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2024-11-07 16:37:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 16:37:49,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:49,985 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:50,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-07 16:37:50,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-07 16:37:50,185 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:50,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:50,188 INFO L85 PathProgramCache]: Analyzing trace with hash -767519134, now seen corresponding path program 1 times [2024-11-07 16:37:50,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:50,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762503225] [2024-11-07 16:37:50,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:50,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:50,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:50,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:50,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 16:37:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 16:37:50,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:50,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762503225] [2024-11-07 16:37:50,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762503225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:50,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487090118] [2024-11-07 16:37:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:50,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:50,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:50,819 INFO L229 MonitoredProcess]: Starting monitored process 13 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:37:50,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-07 16:37:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:51,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-07 16:37:51,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:51,180 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:51,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:51,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:37:51,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:37:51,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-07 16:37:51,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:51,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-07 16:37:51,344 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:37:51,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-07 16:37:51,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 16:37:51,389 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:37:51,457 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:51,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:51,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:37:51,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 16:37:51,567 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:37:51,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 16:37:51,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 16:37:51,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 16:37:51,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-07 16:37:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:51,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:51,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2729 (Array Int Int)) (v_ArrVal_2728 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2728) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2729) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) (forall ((v_ArrVal_2728 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2728) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))))) is different from false [2024-11-07 16:37:51,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:51,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-07 16:37:51,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:51,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-07 16:37:51,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2024-11-07 16:37:51,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2024-11-07 16:37:51,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-07 16:37:51,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:37:51,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:51,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-07 16:37:51,761 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:37:51,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-07 16:37:52,069 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-07 16:37:52,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2024-11-07 16:37:52,072 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2722 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2722) |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) |c_ULTIMATE.start_create_#t~mem10#1.base|)) is different from false [2024-11-07 16:37:52,181 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int) (|v_ULTIMATE.start_create_#t~mem9#1.offset_30| Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (or (let ((.cse0 (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (store |c_#memory_$Pointer$#0.base| .cse3 (store (select |c_#memory_$Pointer$#0.base| .cse3) (+ 16 |v_ULTIMATE.start_create_#t~mem9#1.offset_30|) v_ArrVal_2720))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2722) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) .cse1))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_30| (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))) is different from false [2024-11-07 16:37:52,214 INFO L349 Elim1Store]: treesize reduction 31, result has 50.0 percent of original size [2024-11-07 16:37:52,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 90 [2024-11-07 16:37:52,232 INFO L349 Elim1Store]: treesize reduction 3, result has 76.9 percent of original size [2024-11-07 16:37:52,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 93 [2024-11-07 16:37:52,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-07 16:37:52,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-07 16:37:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-11-07 16:37:52,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487090118] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:37:52,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:37:52,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 19] total 56 [2024-11-07 16:37:52,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212781101] [2024-11-07 16:37:52,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:52,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-07 16:37:52,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:52,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-07 16:37:52,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2635, Unknown=40, NotChecked=318, Total=3192 [2024-11-07 16:37:52,379 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 57 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 47 states have internal predecessors, (108), 4 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 16:37:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:53,154 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2024-11-07 16:37:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 16:37:53,154 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 47 states have internal predecessors, (108), 4 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) Word has length 48 [2024-11-07 16:37:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:53,155 INFO L225 Difference]: With dead ends: 106 [2024-11-07 16:37:53,155 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 16:37:53,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=354, Invalid=3650, Unknown=40, NotChecked=378, Total=4422 [2024-11-07 16:37:53,156 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 59 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:53,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1315 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 710 Invalid, 0 Unknown, 120 Unchecked, 0.4s Time] [2024-11-07 16:37:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 16:37:53,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-07 16:37:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 101 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2024-11-07 16:37:53,160 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 48 [2024-11-07 16:37:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:53,160 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2024-11-07 16:37:53,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 47 states have internal predecessors, (108), 4 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 16:37:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2024-11-07 16:37:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 16:37:53,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:53,161 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:53,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-07 16:37:53,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:53,361 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:53,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:53,362 INFO L85 PathProgramCache]: Analyzing trace with hash -420184918, now seen corresponding path program 1 times [2024-11-07 16:37:53,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:53,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386841552] [2024-11-07 16:37:53,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:53,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:37:53,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:53,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386841552] [2024-11-07 16:37:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386841552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:53,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595064700] [2024-11-07 16:37:53,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:53,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:53,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:53,821 INFO L229 MonitoredProcess]: Starting monitored process 14 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:37:53,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-07 16:37:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:54,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-07 16:37:54,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:54,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 16:37:54,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-07 16:37:54,264 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:54,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:54,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-07 16:37:54,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:54,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-07 16:37:54,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:37:54,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-07 16:37:54,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:54,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:54,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:37:54,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2024-11-07 16:37:54,484 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:37:54,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-11-07 16:37:54,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:54,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 16:37:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:37:54,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:55,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595064700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:55,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:37:55,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2024-11-07 16:37:55,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593337908] [2024-11-07 16:37:55,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:55,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-07 16:37:55,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:55,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-07 16:37:55,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1881, Unknown=16, NotChecked=0, Total=2070 [2024-11-07 16:37:55,112 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 36 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:37:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:55,679 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2024-11-07 16:37:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:37:55,679 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2024-11-07 16:37:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:55,680 INFO L225 Difference]: With dead ends: 116 [2024-11-07 16:37:55,680 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 16:37:55,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=276, Invalid=2678, Unknown=16, NotChecked=0, Total=2970 [2024-11-07 16:37:55,681 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:55,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 701 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:37:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 16:37:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2024-11-07 16:37:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 102 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2024-11-07 16:37:55,684 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 48 [2024-11-07 16:37:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:55,684 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2024-11-07 16:37:55,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:37:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2024-11-07 16:37:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 16:37:55,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:55,685 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:55,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-07 16:37:55,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:55,886 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:55,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash -140830446, now seen corresponding path program 1 times [2024-11-07 16:37:55,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:55,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085972172] [2024-11-07 16:37:55,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:55,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:56,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:37:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:56,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:37:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:37:56,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:37:56,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085972172] [2024-11-07 16:37:56,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085972172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:56,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44307631] [2024-11-07 16:37:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:56,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:37:56,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:37:56,403 INFO L229 MonitoredProcess]: Starting monitored process 15 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:37:56,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-07 16:37:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:37:56,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-07 16:37:56,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:37:56,787 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:37:56,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:37:56,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:37:56,903 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:37:56,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2024-11-07 16:37:56,961 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:37:56,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2024-11-07 16:37:57,181 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:37:57,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-07 16:37:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:37:57,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:37:57,790 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (and (forall ((|v_ULTIMATE.start_loop_~l#1.offset_21| Int) (v_ArrVal_3047 (Array Int Int))) (or (< |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (= |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~l#1.offset_21|) (not (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3047) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |v_ULTIMATE.start_loop_~l#1.offset_21| 8)) 0)))) (or (forall ((|v_ULTIMATE.start_loop_~l#1.offset_21| Int) (v_ArrVal_3047 (Array Int Int))) (or (< |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~l#1.offset_21|) (not (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3047) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |v_ULTIMATE.start_loop_~l#1.offset_21| 8)) 0)))) (= |c_ULTIMATE.start_create_~dll~0#1.base| 0)))) is different from false [2024-11-07 16:37:57,962 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (or (= |c_ULTIMATE.start_create_~dll~0#1.base| 0) (forall ((|v_ULTIMATE.start_loop_~l#1.offset_21| Int) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3047 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_3046))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3047)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |v_ULTIMATE.start_loop_~l#1.offset_21| 8)) 0)) (< |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~l#1.offset_21|)))) (forall ((|v_ULTIMATE.start_loop_~l#1.offset_21| Int) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3047 (Array Int Int))) (or (not (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_3046))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3047)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |v_ULTIMATE.start_loop_~l#1.offset_21| 8)) 0)) (< |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (= |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~l#1.offset_21|)))))) is different from false [2024-11-07 16:37:57,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:57,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2024-11-07 16:37:58,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:58,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 142 [2024-11-07 16:37:58,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:58,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 79 [2024-11-07 16:37:58,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-11-07 16:37:58,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:58,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2024-11-07 16:37:58,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:58,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 142 [2024-11-07 16:37:58,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:37:58,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 79 [2024-11-07 16:37:58,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-11-07 16:37:58,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44307631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:37:58,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:37:58,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 38 [2024-11-07 16:37:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250435413] [2024-11-07 16:37:58,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:37:58,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-07 16:37:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:37:58,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-07 16:37:58,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2373, Unknown=17, NotChecked=198, Total=2756 [2024-11-07 16:37:58,433 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 33 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:37:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:37:59,344 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2024-11-07 16:37:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 16:37:59,345 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 33 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2024-11-07 16:37:59,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:37:59,345 INFO L225 Difference]: With dead ends: 111 [2024-11-07 16:37:59,345 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 16:37:59,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=325, Invalid=4220, Unknown=19, NotChecked=266, Total=4830 [2024-11-07 16:37:59,347 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 32 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:37:59,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 899 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:37:59,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 16:37:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2024-11-07 16:37:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 103 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:37:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2024-11-07 16:37:59,350 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 49 [2024-11-07 16:37:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:37:59,350 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2024-11-07 16:37:59,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 33 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:37:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2024-11-07 16:37:59,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 16:37:59,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:37:59,351 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:37:59,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-07 16:37:59,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-07 16:37:59,552 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-07 16:37:59,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:37:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1019871627, now seen corresponding path program 2 times [2024-11-07 16:37:59,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:37:59,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145813252] [2024-11-07 16:37:59,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:37:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:37:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:00,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:00,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:38:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:38:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:00,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145813252] [2024-11-07 16:38:00,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145813252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:38:00,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870354494] [2024-11-07 16:38:00,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:38:00,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:38:00,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:38:00,659 INFO L229 MonitoredProcess]: Starting monitored process 16 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:38:00,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-07 16:38:00,916 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:38:00,916 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:38:00,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-07 16:38:00,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:38:00,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:38:00,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:38:00,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-07 16:38:00,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-07 16:38:01,066 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:38:01,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:38:01,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2024-11-07 16:38:01,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-07 16:38:01,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:38:01,257 INFO L349 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2024-11-07 16:38:01,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 81 [2024-11-07 16:38:01,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:38:01,276 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-07 16:38:01,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2024-11-07 16:38:01,411 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 16:38:01,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 65 [2024-11-07 16:38:01,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2024-11-07 16:38:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:38:01,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:38:20,916 INFO L349 Elim1Store]: treesize reduction 432, result has 29.9 percent of original size [2024-11-07 16:38:20,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 20 new quantified variables, introduced 56 case distinctions, treesize of input 320911 treesize of output 225274 [2024-11-07 16:38:25,025 INFO L349 Elim1Store]: treesize reduction 1393, result has 24.0 percent of original size [2024-11-07 16:38:25,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 18 new quantified variables, introduced 67 case distinctions, treesize of input 143201 treesize of output 122003 [2024-11-07 16:38:28,028 INFO L349 Elim1Store]: treesize reduction 68, result has 82.9 percent of original size [2024-11-07 16:38:28,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 17 new quantified variables, introduced 45 case distinctions, treesize of input 199390 treesize of output 161526 [2024-11-07 16:38:35,915 WARN L286 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 466 DAG size of output: 168 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-07 16:38:35,915 INFO L349 Elim1Store]: treesize reduction 1760, result has 25.8 percent of original size [2024-11-07 16:38:35,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 18 new quantified variables, introduced 92 case distinctions, treesize of input 369015863 treesize of output 194656156