./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-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/sll-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', '7ac435f9525efba17674735293ae04d2f777a83ec5e1b38ed3aaaf0148b05726'] 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/sll-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 7ac435f9525efba17674735293ae04d2f777a83ec5e1b38ed3aaaf0148b05726 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:38:44,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:38:44,893 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:38:44,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:38:44,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:38:44,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:38:44,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:38:44,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:38:44,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:38:44,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:38:44,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:38:44,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:38:44,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:38:44,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:38:44,939 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:38:44,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:38:44,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:38:44,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:38:44,939 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:38:44,939 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:38:44,939 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:38:44,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:38:44,940 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:38:44,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:38:44,940 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:38:44,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:38:44,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:38:44,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:38:44,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:38:44,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:38:44,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:38:44,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:38:44,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:38:44,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:38:44,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:38:44,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:38:44,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:38:44,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:38:44,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:38:44,943 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 -> 7ac435f9525efba17674735293ae04d2f777a83ec5e1b38ed3aaaf0148b05726 [2024-11-07 16:38:45,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:38:45,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:38:45,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:38:45,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:38:45,252 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:38:45,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-lst-shared.i [2024-11-07 16:38:46,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:38:46,927 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:38:46,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-lst-shared.i [2024-11-07 16:38:46,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b012042ac/8aef76b893c145cc8ab3a5d76d3fd01d/FLAG9b93b9385 [2024-11-07 16:38:46,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b012042ac/8aef76b893c145cc8ab3a5d76d3fd01d [2024-11-07 16:38:46,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:38:46,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:38:46,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:38:46,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:38:46,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:38:46,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:38:46" (1/1) ... [2024-11-07 16:38:47,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48749a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:47, skipping insertion in model container [2024-11-07 16:38:47,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:38:46" (1/1) ... [2024-11-07 16:38:47,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:38:47,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:38:47,355 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:38:47,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:38:47,427 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:38:47,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:47 WrapperNode [2024-11-07 16:38:47,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:38:47,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:38:47,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:38:47,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:38:47,434 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:38:47" (1/1) ... [2024-11-07 16:38:47,444 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:38:47" (1/1) ... [2024-11-07 16:38:47,460 INFO L138 Inliner]: procedures = 121, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 74 [2024-11-07 16:38:47,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:38:47,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:38:47,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:38:47,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:38:47,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:47" (1/1) ... [2024-11-07 16:38:47,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:47" (1/1) ... [2024-11-07 16:38:47,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:47" (1/1) ... [2024-11-07 16:38:47,489 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2024-11-07 16:38:47,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:47" (1/1) ... [2024-11-07 16:38:47,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:47" (1/1) ... [2024-11-07 16:38:47,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:47" (1/1) ... [2024-11-07 16:38:47,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:47" (1/1) ... [2024-11-07 16:38:47,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:47" (1/1) ... [2024-11-07 16:38:47,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:47" (1/1) ... [2024-11-07 16:38:47,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:38:47,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:38:47,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:38:47,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:38:47,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:47" (1/1) ... [2024-11-07 16:38:47,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:38:47,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:38:47,540 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:38:47,542 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:38:47,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:38:47,566 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-07 16:38:47,566 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-07 16:38:47,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:38:47,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:38:47,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:38:47,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:38:47,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:38:47,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:38:47,693 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:38:47,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:38:47,999 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-07 16:38:47,999 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:38:48,012 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:38:48,013 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-07 16:38:48,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:38:48 BoogieIcfgContainer [2024-11-07 16:38:48,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:38:48,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:38:48,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:38:48,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:38:48,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:38:46" (1/3) ... [2024-11-07 16:38:48,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53174bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:38:48, skipping insertion in model container [2024-11-07 16:38:48,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:47" (2/3) ... [2024-11-07 16:38:48,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53174bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:38:48, skipping insertion in model container [2024-11-07 16:38:48,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:38:48" (3/3) ... [2024-11-07 16:38:48,024 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-lst-shared.i [2024-11-07 16:38:48,038 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:38:48,038 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-07 16:38:48,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:38:48,100 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;@4e492c50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:38:48,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-11-07 16:38:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 71 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:38:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:38:48,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:48,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:38:48,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:48,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash 34518161, now seen corresponding path program 1 times [2024-11-07 16:38:48,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:48,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956063589] [2024-11-07 16:38:48,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:48,303 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:38:48,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:48,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956063589] [2024-11-07 16:38:48,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956063589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:48,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:48,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:38:48,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256051787] [2024-11-07 16:38:48,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:48,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:38:48,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:48,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:38:48,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:38:48,333 INFO L87 Difference]: Start difference. First operand has 75 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 71 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) 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:38:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:48,419 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-11-07 16:38:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:38:48,421 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:38:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:48,426 INFO L225 Difference]: With dead ends: 74 [2024-11-07 16:38:48,426 INFO L226 Difference]: Without dead ends: 72 [2024-11-07 16:38:48,429 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:38:48,432 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:48,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 120 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-07 16:38:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-07 16:38:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.7560975609756098) 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:38:48,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-07 16:38:48,476 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 5 [2024-11-07 16:38:48,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:48,477 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-07 16:38:48,477 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:38:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-07 16:38:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:38:48,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:48,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:38:48,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:38:48,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:48,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash 34518162, now seen corresponding path program 1 times [2024-11-07 16:38:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:48,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100958063] [2024-11-07 16:38:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:48,628 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:38:48,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:48,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100958063] [2024-11-07 16:38:48,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100958063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:48,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:48,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:38:48,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355727664] [2024-11-07 16:38:48,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:48,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:38:48,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:48,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:38:48,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:38:48,633 INFO L87 Difference]: Start difference. First operand 72 states and 76 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:38:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:48,703 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-07 16:38:48,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:38:48,703 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:38:48,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:48,704 INFO L225 Difference]: With dead ends: 71 [2024-11-07 16:38:48,704 INFO L226 Difference]: Without dead ends: 71 [2024-11-07 16:38:48,704 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:38:48,705 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:48,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:48,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-07 16:38:48,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-07 16:38:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 67 states have internal predecessors, (71), 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:38:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-07 16:38:48,712 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 5 [2024-11-07 16:38:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:48,713 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-07 16:38:48,713 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:38:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-07 16:38:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:38:48,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:48,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:48,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:38:48,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:48,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash 888666692, now seen corresponding path program 1 times [2024-11-07 16:38:48,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:48,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262822286] [2024-11-07 16:38:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:48,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:38:48,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:48,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262822286] [2024-11-07 16:38:48,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262822286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:48,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:48,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:38:48,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521402846] [2024-11-07 16:38:48,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:48,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:38:48,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:48,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:38:48,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:38:48,830 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:38:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:48,949 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-11-07 16:38:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:38:48,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-11-07 16:38:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:48,951 INFO L225 Difference]: With dead ends: 75 [2024-11-07 16:38:48,951 INFO L226 Difference]: Without dead ends: 75 [2024-11-07 16:38:48,952 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:38:48,952 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:48,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-07 16:38:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2024-11-07 16:38:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 66 states have internal predecessors, (70), 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:38:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-11-07 16:38:48,959 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 10 [2024-11-07 16:38:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:48,959 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-11-07 16:38:48,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:38:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-11-07 16:38:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:38:48,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:48,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:48,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:38:48,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:48,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash 888666693, now seen corresponding path program 1 times [2024-11-07 16:38:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:48,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571227576] [2024-11-07 16:38:48,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:48,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:49,140 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:38:49,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:49,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571227576] [2024-11-07 16:38:49,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571227576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:49,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:49,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:38:49,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926909539] [2024-11-07 16:38:49,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:49,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:38:49,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:49,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:38:49,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:38:49,145 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:38:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:49,222 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2024-11-07 16:38:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:38:49,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-11-07 16:38:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:49,223 INFO L225 Difference]: With dead ends: 74 [2024-11-07 16:38:49,223 INFO L226 Difference]: Without dead ends: 74 [2024-11-07 16:38:49,224 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:38:49,224 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:49,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 147 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:49,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-07 16:38:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2024-11-07 16:38:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 65 states have internal predecessors, (69), 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:38:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-07 16:38:49,229 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 10 [2024-11-07 16:38:49,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:49,229 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-07 16:38:49,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:38:49,229 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-07 16:38:49,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:38:49,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:49,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:49,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:38:49,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:49,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash -689801403, now seen corresponding path program 1 times [2024-11-07 16:38:49,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:49,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078734219] [2024-11-07 16:38:49,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:49,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:49,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:49,443 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:38:49,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:49,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078734219] [2024-11-07 16:38:49,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078734219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:49,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:49,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:38:49,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355999433] [2024-11-07 16:38:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:49,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:38:49,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:38:49,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:38:49,444 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:38:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:49,599 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2024-11-07 16:38:49,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:38:49,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 12 [2024-11-07 16:38:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:49,601 INFO L225 Difference]: With dead ends: 71 [2024-11-07 16:38:49,601 INFO L226 Difference]: Without dead ends: 71 [2024-11-07 16:38:49,602 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:38:49,602 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:49,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 226 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-07 16:38:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2024-11-07 16:38:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 62 states have internal predecessors, (66), 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:38:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-11-07 16:38:49,611 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 12 [2024-11-07 16:38:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:49,612 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-11-07 16:38:49,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:38:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-11-07 16:38:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:38:49,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:49,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:49,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:38:49,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:49,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:49,614 INFO L85 PathProgramCache]: Analyzing trace with hash -689801402, now seen corresponding path program 1 times [2024-11-07 16:38:49,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:49,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493706301] [2024-11-07 16:38:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:49,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:49,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:49,985 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:38:49,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:49,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493706301] [2024-11-07 16:38:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493706301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:49,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:49,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:38:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419138472] [2024-11-07 16:38:49,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:49,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:38:49,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:49,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:38:49,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:38:49,987 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:38:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:50,131 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-11-07 16:38:50,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:38:50,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 12 [2024-11-07 16:38:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:50,133 INFO L225 Difference]: With dead ends: 70 [2024-11-07 16:38:50,133 INFO L226 Difference]: Without dead ends: 70 [2024-11-07 16:38:50,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:38:50,133 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 5 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:50,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 236 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-07 16:38:50,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2024-11-07 16:38:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 61 states have internal predecessors, (65), 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:38:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-11-07 16:38:50,146 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2024-11-07 16:38:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:50,147 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-11-07 16:38:50,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:38:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-11-07 16:38:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 16:38:50,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:50,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:50,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:38:50,148 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:50,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:50,148 INFO L85 PathProgramCache]: Analyzing trace with hash -552207829, now seen corresponding path program 1 times [2024-11-07 16:38:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:50,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288909781] [2024-11-07 16:38:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:50,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:50,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:50,278 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:38:50,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:50,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288909781] [2024-11-07 16:38:50,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288909781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:50,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:50,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:38:50,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567694706] [2024-11-07 16:38:50,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:50,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:38:50,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:50,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:38:50,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:38:50,280 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:38:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:50,439 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-11-07 16:38:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:38:50,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 18 [2024-11-07 16:38:50,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:50,441 INFO L225 Difference]: With dead ends: 86 [2024-11-07 16:38:50,441 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 16:38:50,441 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:38:50,442 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:50,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 219 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 16:38:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-11-07 16:38:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 75 states have internal predecessors, (89), 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:38:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2024-11-07 16:38:50,447 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 18 [2024-11-07 16:38:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:50,448 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2024-11-07 16:38:50,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:38:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2024-11-07 16:38:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 16:38:50,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:50,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:50,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:38:50,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:50,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash -552207828, now seen corresponding path program 1 times [2024-11-07 16:38:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:50,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318663520] [2024-11-07 16:38:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:50,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:50,782 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:38:50,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:50,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318663520] [2024-11-07 16:38:50,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318663520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:50,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:50,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:38:50,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697198282] [2024-11-07 16:38:50,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:50,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:38:50,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:50,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:38:50,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:38:50,784 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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:38:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:50,985 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2024-11-07 16:38:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 16:38:50,985 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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 18 [2024-11-07 16:38:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:50,986 INFO L225 Difference]: With dead ends: 89 [2024-11-07 16:38:50,986 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 16:38:50,986 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:38:50,987 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 26 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:50,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 371 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:38:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 16:38:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2024-11-07 16:38:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 75 states have internal predecessors, (88), 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:38:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-07 16:38:50,991 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 18 [2024-11-07 16:38:50,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:50,991 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-07 16:38:50,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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:38:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-07 16:38:50,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 16:38:50,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:50,992 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] [2024-11-07 16:38:50,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:38:50,992 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:50,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:50,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1904175387, now seen corresponding path program 1 times [2024-11-07 16:38:50,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:50,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365425769] [2024-11-07 16:38:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:50,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:51,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:51,118 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:38:51,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:51,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365425769] [2024-11-07 16:38:51,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365425769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:51,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:51,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:38:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742831753] [2024-11-07 16:38:51,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:51,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:38:51,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:51,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:38:51,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:38:51,119 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 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:38:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:51,218 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2024-11-07 16:38:51,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:38:51,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 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 20 [2024-11-07 16:38:51,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:51,219 INFO L225 Difference]: With dead ends: 85 [2024-11-07 16:38:51,219 INFO L226 Difference]: Without dead ends: 85 [2024-11-07 16:38:51,220 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:38:51,220 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 18 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:51,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 405 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-07 16:38:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-07 16:38:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.543859649122807) internal successors, (88), 76 states have internal predecessors, (88), 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:38:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2024-11-07 16:38:51,227 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 20 [2024-11-07 16:38:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:51,227 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2024-11-07 16:38:51,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 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:38:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2024-11-07 16:38:51,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 16:38:51,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:51,228 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:51,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:38:51,232 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:51,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:51,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2038013526, now seen corresponding path program 1 times [2024-11-07 16:38:51,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:51,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008224530] [2024-11-07 16:38:51,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:51,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:51,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:51,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 16:38:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:38:51,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:51,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008224530] [2024-11-07 16:38:51,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008224530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:51,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:51,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:38:51,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357977290] [2024-11-07 16:38:51,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:51,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:38:51,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:51,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:38:51,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:38:51,400 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:38:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:51,521 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2024-11-07 16:38:51,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:38:51,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 21 [2024-11-07 16:38:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:51,523 INFO L225 Difference]: With dead ends: 83 [2024-11-07 16:38:51,523 INFO L226 Difference]: Without dead ends: 83 [2024-11-07 16:38:51,523 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:38:51,524 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:51,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 186 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:51,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-07 16:38:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-07 16:38:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 76 states have internal predecessors, (87), 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:38:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2024-11-07 16:38:51,533 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 21 [2024-11-07 16:38:51,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:51,533 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2024-11-07 16:38:51,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:38:51,533 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2024-11-07 16:38:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 16:38:51,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:51,533 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:51,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:38:51,534 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:51,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2038013527, now seen corresponding path program 1 times [2024-11-07 16:38:51,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:51,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367350768] [2024-11-07 16:38:51,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:51,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:51,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:51,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 16:38:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:38:52,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:52,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367350768] [2024-11-07 16:38:52,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367350768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:38:52,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200683001] [2024-11-07 16:38:52,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:52,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:38:52,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:38:52,017 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:38:52,020 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:38:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:52,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 16:38:52,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:38:52,175 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:38:52,186 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:38:52,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:38:52,302 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:38:52,315 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:38:52,315 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:52,439 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:38:52,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:38:52,483 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:38:52,495 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:38:52,495 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:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-07 16:38:52,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:38:52,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200683001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:38:52,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:38:52,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-11-07 16:38:52,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913630685] [2024-11-07 16:38:52,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:38:52,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 16:38:52,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:52,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 16:38:52,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2024-11-07 16:38:52,659 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 14 states have internal predecessors, (31), 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:38:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:52,965 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-11-07 16:38:52,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:38:52,966 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 14 states have internal predecessors, (31), 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 21 [2024-11-07 16:38:52,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:52,967 INFO L225 Difference]: With dead ends: 85 [2024-11-07 16:38:52,967 INFO L226 Difference]: Without dead ends: 85 [2024-11-07 16:38:52,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 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:38:52,968 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 38 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:52,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 370 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 296 Invalid, 0 Unknown, 79 Unchecked, 0.2s Time] [2024-11-07 16:38:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-07 16:38:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-07 16:38:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 76 states have internal predecessors, (84), 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:38:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-11-07 16:38:52,975 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 21 [2024-11-07 16:38:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:52,975 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-11-07 16:38:52,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 14 states have internal predecessors, (31), 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:38:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-11-07 16:38:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 16:38:52,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:52,976 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:38:52,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 16:38:53,176 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,SelfDestructingSolverStorable10 [2024-11-07 16:38:53,177 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:53,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1098658217, now seen corresponding path program 1 times [2024-11-07 16:38:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:53,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220279888] [2024-11-07 16:38:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:53,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:38:53,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:53,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220279888] [2024-11-07 16:38:53,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220279888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:53,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:53,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:38:53,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218590047] [2024-11-07 16:38:53,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:53,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:38:53,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:53,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:38:53,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:38:53,500 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 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:38:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:53,659 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-11-07 16:38:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:38:53,659 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 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:38:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:53,660 INFO L225 Difference]: With dead ends: 88 [2024-11-07 16:38:53,660 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 16:38:53,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:38:53,677 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:53,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 292 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 16:38:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-07 16:38:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.421875) internal successors, (91), 83 states have internal predecessors, (91), 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:38:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-11-07 16:38:53,680 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 21 [2024-11-07 16:38:53,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:53,681 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-11-07 16:38:53,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 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:38:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-11-07 16:38:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:38:53,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:53,682 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] [2024-11-07 16:38:53,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 16:38:53,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:53,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:53,683 INFO L85 PathProgramCache]: Analyzing trace with hash 803258831, now seen corresponding path program 1 times [2024-11-07 16:38:53,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:53,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859512785] [2024-11-07 16:38:53,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:53,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:53,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 16:38:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:38:53,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859512785] [2024-11-07 16:38:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859512785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:53,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:53,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:38:53,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247043876] [2024-11-07 16:38:53,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:53,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:38:53,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:53,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:38:53,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:38:53,841 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:38:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:53,974 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2024-11-07 16:38:53,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:38:53,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 24 [2024-11-07 16:38:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:53,975 INFO L225 Difference]: With dead ends: 87 [2024-11-07 16:38:53,975 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 16:38:53,976 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:38:53,976 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:53,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 267 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:53,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 16:38:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-07 16:38:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.390625) internal successors, (89), 82 states have internal predecessors, (89), 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:38:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-11-07 16:38:53,983 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 24 [2024-11-07 16:38:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:53,983 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-11-07 16:38:53,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:38:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-11-07 16:38:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:38:53,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:53,984 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] [2024-11-07 16:38:53,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 16:38:53,984 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:53,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:53,986 INFO L85 PathProgramCache]: Analyzing trace with hash 803258832, now seen corresponding path program 1 times [2024-11-07 16:38:53,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:53,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053574342] [2024-11-07 16:38:53,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:53,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:54,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:54,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 16:38:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:38:54,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:54,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053574342] [2024-11-07 16:38:54,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053574342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:54,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:54,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:38:54,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881098466] [2024-11-07 16:38:54,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:54,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:38:54,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:38:54,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:38:54,245 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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:38:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:54,384 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2024-11-07 16:38:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:38:54,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 24 [2024-11-07 16:38:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:54,386 INFO L225 Difference]: With dead ends: 86 [2024-11-07 16:38:54,387 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 16:38:54,387 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:38:54,388 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:54,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 290 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 16:38:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 16:38:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.359375) internal successors, (87), 81 states have internal predecessors, (87), 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:38:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2024-11-07 16:38:54,396 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 24 [2024-11-07 16:38:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:54,397 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2024-11-07 16:38:54,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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:38:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-11-07 16:38:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:38:54,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:54,398 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] [2024-11-07 16:38:54,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 16:38:54,398 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:38:54,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:54,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1818827793, now seen corresponding path program 1 times [2024-11-07 16:38:54,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:54,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928568157] [2024-11-07 16:38:54,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:54,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:54,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:38:54,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:54,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928568157] [2024-11-07 16:38:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928568157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:38:54,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267908916] [2024-11-07 16:38:54,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:54,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:38:54,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:38:54,977 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:38:54,978 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:38:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:55,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-07 16:38:55,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:38:55,092 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:38:55,114 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:38:55,120 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:38:55,240 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:38:55,240 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:55,283 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:38:55,291 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:38:55,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:38:55,329 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 25 treesize of output 13 [2024-11-07 16:38:55,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:38:55,337 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 13 [2024-11-07 16:38:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:38:55,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:38:58,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:38:58,230 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:38:58,233 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 36 treesize of output 24 [2024-11-07 16:38:58,242 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-07 16:38:58,242 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 1 [2024-11-07 16:38:58,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:38:58,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267908916] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:38:58,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:38:58,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 31 [2024-11-07 16:38:58,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919391527] [2024-11-07 16:38:58,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:38:58,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-07 16:38:58,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:58,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-07 16:38:58,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=820, Unknown=20, NotChecked=0, Total=930 [2024-11-07 16:38:58,276 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 31 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 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:39:02,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:39:06,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:39:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:06,912 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2024-11-07 16:39:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:39:06,913 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 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 24 [2024-11-07 16:39:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:06,914 INFO L225 Difference]: With dead ends: 88 [2024-11-07 16:39:06,914 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 16:39:06,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=126, Invalid=1114, Unknown=20, NotChecked=0, Total=1260 [2024-11-07 16:39:06,915 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:06,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 829 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 531 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2024-11-07 16:39:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 16:39:06,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-07 16:39:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 83 states have internal predecessors, (89), 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:39:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2024-11-07 16:39:06,921 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 24 [2024-11-07 16:39:06,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:06,922 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2024-11-07 16:39:06,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 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:39:06,922 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-11-07 16:39:06,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:39:06,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:06,926 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] [2024-11-07 16:39:06,944 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:39:07,129 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,SelfDestructingSolverStorable14 [2024-11-07 16:39:07,130 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:07,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash -158226047, now seen corresponding path program 1 times [2024-11-07 16:39:07,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:07,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483312276] [2024-11-07 16:39:07,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:07,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,237 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:39:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483312276] [2024-11-07 16:39:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483312276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:07,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:07,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:39:07,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942531085] [2024-11-07 16:39:07,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:07,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:39:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:07,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:39:07,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:39:07,239 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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:39:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:07,404 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2024-11-07 16:39:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:39:07,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 26 [2024-11-07 16:39:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:07,405 INFO L225 Difference]: With dead ends: 102 [2024-11-07 16:39:07,405 INFO L226 Difference]: Without dead ends: 102 [2024-11-07 16:39:07,405 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:39:07,406 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:07,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 206 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-07 16:39:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-07 16:39:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 93 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:39:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2024-11-07 16:39:07,410 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 26 [2024-11-07 16:39:07,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:07,410 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-11-07 16:39:07,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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:39:07,411 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2024-11-07 16:39:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:39:07,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:07,411 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] [2024-11-07 16:39:07,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 16:39:07,412 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:07,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash -158226046, now seen corresponding path program 1 times [2024-11-07 16:39:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:07,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946734129] [2024-11-07 16:39:07,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:07,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,603 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:39:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946734129] [2024-11-07 16:39:07,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946734129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336632745] [2024-11-07 16:39:07,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:07,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:07,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:07,606 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:39:07,607 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:39:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 16:39:07,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:07,866 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:39:07,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:08,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:08,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 15 treesize of output 19 [2024-11-07 16:39:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:39:08,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336632745] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:08,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:08,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 20 [2024-11-07 16:39:08,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311200943] [2024-11-07 16:39:08,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:08,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:39:08,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:08,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:39:08,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:39:08,091 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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:39:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:08,276 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2024-11-07 16:39:08,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:39:08,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 26 [2024-11-07 16:39:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:08,278 INFO L225 Difference]: With dead ends: 106 [2024-11-07 16:39:08,278 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 16:39:08,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2024-11-07 16:39:08,279 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 32 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:08,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 227 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 16:39:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-07 16:39:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 93 states have internal predecessors, (106), 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:39:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2024-11-07 16:39:08,282 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 26 [2024-11-07 16:39:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:08,282 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2024-11-07 16:39:08,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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:39:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2024-11-07 16:39:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:39:08,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:08,283 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:39:08,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 16:39:08,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:08,484 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:08,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:08,484 INFO L85 PathProgramCache]: Analyzing trace with hash -610028934, now seen corresponding path program 1 times [2024-11-07 16:39:08,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:08,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548544197] [2024-11-07 16:39:08,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:08,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,603 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:39:08,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548544197] [2024-11-07 16:39:08,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548544197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:08,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:08,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:39:08,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577047268] [2024-11-07 16:39:08,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:08,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:39:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:08,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:39:08,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:39:08,606 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 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:39:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:08,725 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-11-07 16:39:08,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:39:08,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 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:39:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:08,726 INFO L225 Difference]: With dead ends: 103 [2024-11-07 16:39:08,726 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 16:39:08,727 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:39:08,728 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:08,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 350 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:39:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 16:39:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2024-11-07 16:39:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 92 states have internal predecessors, (101), 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:39:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2024-11-07 16:39:08,732 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 27 [2024-11-07 16:39:08,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:08,733 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2024-11-07 16:39:08,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 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:39:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2024-11-07 16:39:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:39:08,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:08,735 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:39:08,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 16:39:08,736 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:08,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:08,736 INFO L85 PathProgramCache]: Analyzing trace with hash -610040113, now seen corresponding path program 1 times [2024-11-07 16:39:08,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:08,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790105767] [2024-11-07 16:39:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:08,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,897 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:39:08,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:08,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790105767] [2024-11-07 16:39:08,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790105767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:08,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:08,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:39:08,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095482324] [2024-11-07 16:39:08,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:08,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:39:08,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:08,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:39:08,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:39:08,899 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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:39:09,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:09,060 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2024-11-07 16:39:09,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:39:09,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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:39:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:09,061 INFO L225 Difference]: With dead ends: 109 [2024-11-07 16:39:09,061 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 16:39:09,061 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:39:09,062 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:09,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 296 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:39:09,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 16:39:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2024-11-07 16:39:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.3125) internal successors, (105), 96 states have internal predecessors, (105), 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:39:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2024-11-07 16:39:09,068 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 27 [2024-11-07 16:39:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:09,068 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2024-11-07 16:39:09,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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:39:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2024-11-07 16:39:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:39:09,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:09,068 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:39:09,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 16:39:09,069 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:09,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1731374207, now seen corresponding path program 1 times [2024-11-07 16:39:09,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:09,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67122757] [2024-11-07 16:39:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,235 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:39:09,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67122757] [2024-11-07 16:39:09,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67122757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:09,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:09,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:39:09,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885038633] [2024-11-07 16:39:09,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:09,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:39:09,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:09,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:39:09,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:39:09,237 INFO L87 Difference]: Start difference. First operand 101 states and 111 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:39:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:09,444 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2024-11-07 16:39:09,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:39:09,444 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:39:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:09,445 INFO L225 Difference]: With dead ends: 108 [2024-11-07 16:39:09,445 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 16:39:09,446 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:39:09,446 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:09,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 250 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 16:39:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2024-11-07 16:39:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.308641975308642) internal successors, (106), 97 states have internal predecessors, (106), 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:39:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2024-11-07 16:39:09,450 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 28 [2024-11-07 16:39:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:09,450 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2024-11-07 16:39:09,450 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:39:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2024-11-07 16:39:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:39:09,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:09,451 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:39:09,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 16:39:09,451 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:09,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2132992751, now seen corresponding path program 1 times [2024-11-07 16:39:09,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:09,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325752067] [2024-11-07 16:39:09,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:09,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,626 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:39:09,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:09,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325752067] [2024-11-07 16:39:09,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325752067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:09,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:09,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:39:09,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029921363] [2024-11-07 16:39:09,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:09,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:39:09,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:09,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:39:09,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:39:09,628 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 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:39:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:09,805 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2024-11-07 16:39:09,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:39:09,806 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 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:39:09,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:09,807 INFO L225 Difference]: With dead ends: 103 [2024-11-07 16:39:09,807 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 16:39:09,807 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:39:09,807 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 13 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:09,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 310 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 16:39:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-07 16:39:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 98 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:39:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2024-11-07 16:39:09,812 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 29 [2024-11-07 16:39:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:09,812 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2024-11-07 16:39:09,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 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:39:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2024-11-07 16:39:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:39:09,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:09,813 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] [2024-11-07 16:39:09,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 16:39:09,813 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:09,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:09,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1106629516, now seen corresponding path program 1 times [2024-11-07 16:39:09,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:09,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968254527] [2024-11-07 16:39:09,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:09,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:10,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:10,117 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:39:10,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:10,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968254527] [2024-11-07 16:39:10,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968254527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:10,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:10,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 16:39:10,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481095375] [2024-11-07 16:39:10,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:10,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:39:10,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:10,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:39:10,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:39:10,119 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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:39:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:10,412 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2024-11-07 16:39:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:39:10,413 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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 31 [2024-11-07 16:39:10,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:10,414 INFO L225 Difference]: With dead ends: 107 [2024-11-07 16:39:10,414 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 16:39:10,414 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:39:10,415 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:10,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 266 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 16:39:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-11-07 16:39:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 100 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:39:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2024-11-07 16:39:10,421 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 31 [2024-11-07 16:39:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:10,421 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2024-11-07 16:39:10,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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:39:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2024-11-07 16:39:10,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:39:10,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:10,423 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] [2024-11-07 16:39:10,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 16:39:10,423 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:10,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1106629515, now seen corresponding path program 1 times [2024-11-07 16:39:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:10,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599360585] [2024-11-07 16:39:10,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:10,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:10,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:10,605 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:39:10,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:10,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599360585] [2024-11-07 16:39:10,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599360585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:10,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015236816] [2024-11-07 16:39:10,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:10,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:10,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:10,608 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:39:10,610 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:39:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:10,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 16:39:10,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:10,829 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:39:10,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:10,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:10,950 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:39:11,013 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:39:11,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015236816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:39:11,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:39:11,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2024-11-07 16:39:11,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568944166] [2024-11-07 16:39:11,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:11,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 16:39:11,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:11,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 16:39:11,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-07 16:39:11,014 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 19 states, 18 states have (on average 4.0) internal successors, (72), 17 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:39:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:11,271 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2024-11-07 16:39:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:39:11,272 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 17 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 31 [2024-11-07 16:39:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:11,273 INFO L225 Difference]: With dead ends: 117 [2024-11-07 16:39:11,273 INFO L226 Difference]: Without dead ends: 117 [2024-11-07 16:39:11,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-07 16:39:11,273 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:11,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 505 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-07 16:39:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2024-11-07 16:39:11,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.2873563218390804) 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:39:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2024-11-07 16:39:11,277 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 31 [2024-11-07 16:39:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:11,277 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2024-11-07 16:39:11,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 17 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:39:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2024-11-07 16:39:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:39:11,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:11,278 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] [2024-11-07 16:39:11,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 16:39:11,478 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,SelfDestructingSolverStorable22 [2024-11-07 16:39:11,479 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:11,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:11,479 INFO L85 PathProgramCache]: Analyzing trace with hash 569121521, now seen corresponding path program 1 times [2024-11-07 16:39:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:11,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442862546] [2024-11-07 16:39:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:11,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:11,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:11,639 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:39:11,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:11,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442862546] [2024-11-07 16:39:11,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442862546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:11,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:11,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:39:11,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862415504] [2024-11-07 16:39:11,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:11,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:39:11,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:11,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:39:11,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:39:11,641 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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:39:11,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:11,784 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2024-11-07 16:39:11,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:39:11,785 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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 34 [2024-11-07 16:39:11,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:11,786 INFO L225 Difference]: With dead ends: 108 [2024-11-07 16:39:11,786 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 16:39:11,786 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:39:11,787 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:11,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 322 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:39:11,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 16:39:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-07 16:39:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 103 states have internal predecessors, (113), 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:39:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2024-11-07 16:39:11,793 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 34 [2024-11-07 16:39:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:11,793 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2024-11-07 16:39:11,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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:39:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2024-11-07 16:39:11,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 16:39:11,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:11,794 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:11,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 16:39:11,794 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:11,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:11,794 INFO L85 PathProgramCache]: Analyzing trace with hash 945604030, now seen corresponding path program 1 times [2024-11-07 16:39:11,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:11,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670971095] [2024-11-07 16:39:11,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:11,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:12,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:12,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 16:39:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:12,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 16:39:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 16:39:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:12,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670971095] [2024-11-07 16:39:12,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670971095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:12,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240774642] [2024-11-07 16:39:12,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:12,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:12,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:12,179 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:39:12,181 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:39:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:12,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 16:39:12,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:12,372 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:12,372 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:39:12,395 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:39:12,457 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:39:12,457 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:39:12,470 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:39:12,486 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2024-11-07 16:39:12,506 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-07 16:39:12,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2024-11-07 16:39:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-07 16:39:12,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:12,636 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-07 16:39:12,636 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 21 treesize of output 20 [2024-11-07 16:39:12,641 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_948) |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) is different from false [2024-11-07 16:39:12,647 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int))) (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))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_948) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) .cse0)))) is different from false [2024-11-07 16:39:12,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:12,658 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:39:12,662 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 36 treesize of output 24 [2024-11-07 16:39:12,665 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 7 treesize of output 3 [2024-11-07 16:39:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:39:12,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240774642] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:39:12,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:39:12,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 24 [2024-11-07 16:39:12,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084069629] [2024-11-07 16:39:12,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:12,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 16:39:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:12,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 16:39:12,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=403, Unknown=3, NotChecked=126, Total=600 [2024-11-07 16:39:12,743 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 20 states have internal predecessors, (55), 3 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 16:39:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:13,061 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2024-11-07 16:39:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:39:13,062 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 20 states have internal predecessors, (55), 3 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 36 [2024-11-07 16:39:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:13,062 INFO L225 Difference]: With dead ends: 107 [2024-11-07 16:39:13,062 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 16:39:13,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=605, Unknown=3, NotChecked=156, Total=870 [2024-11-07 16:39:13,063 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 15 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:13,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 533 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 111 Unchecked, 0.2s Time] [2024-11-07 16:39:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 16:39:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-07 16:39:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.2727272727272727) 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:39:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2024-11-07 16:39:13,071 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 36 [2024-11-07 16:39:13,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:13,071 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2024-11-07 16:39:13,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 20 states have internal predecessors, (55), 3 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 16:39:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2024-11-07 16:39:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 16:39:13,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:13,073 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:13,090 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:39:13,273 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,SelfDestructingSolverStorable24 [2024-11-07 16:39:13,274 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:13,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:13,274 INFO L85 PathProgramCache]: Analyzing trace with hash 945604031, now seen corresponding path program 1 times [2024-11-07 16:39:13,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:13,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456918040] [2024-11-07 16:39:13,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:13,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:13,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:13,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 16:39:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:13,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 16:39:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:39:13,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:13,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456918040] [2024-11-07 16:39:13,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456918040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:13,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585017798] [2024-11-07 16:39:13,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:13,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:13,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:13,835 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:39:13,837 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:39:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:13,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-07 16:39:13,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:14,012 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:39:14,089 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:14,090 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:39:14,131 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:39:14,136 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:39:14,217 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:39:14,217 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:39:14,226 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:39:14,248 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:39:14,253 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:39:14,312 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:39:14,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:14,334 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:39:14,341 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:14,341 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:39:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-07 16:39:14,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:14,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585017798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:14,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:14,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2024-11-07 16:39:14,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105403531] [2024-11-07 16:39:14,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:14,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 16:39:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:14,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 16:39:14,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=534, Unknown=1, NotChecked=46, Total=650 [2024-11-07 16:39:14,456 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 18 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 16:39:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:14,966 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2024-11-07 16:39:14,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 16:39:14,967 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 18 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2024-11-07 16:39:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:14,968 INFO L225 Difference]: With dead ends: 104 [2024-11-07 16:39:14,968 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 16:39:14,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=867, Unknown=1, NotChecked=60, Total=1056 [2024-11-07 16:39:14,969 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:14,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 691 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 513 Invalid, 0 Unknown, 68 Unchecked, 0.3s Time] [2024-11-07 16:39:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 16:39:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-07 16:39:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 99 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:39:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2024-11-07 16:39:14,972 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 36 [2024-11-07 16:39:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:14,972 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2024-11-07 16:39:14,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 18 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 16:39:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2024-11-07 16:39:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 16:39:14,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:14,973 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:14,992 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:39:15,173 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,SelfDestructingSolverStorable25 [2024-11-07 16:39:15,174 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:15,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:15,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2103899583, now seen corresponding path program 1 times [2024-11-07 16:39:15,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:15,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26343299] [2024-11-07 16:39:15,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:15,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:15,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:15,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 16:39:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:39:15,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:15,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26343299] [2024-11-07 16:39:15,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26343299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:15,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643375662] [2024-11-07 16:39:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:15,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:15,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:15,395 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:39:15,397 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:39:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:15,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 16:39:15,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 16:39:15,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:15,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:15,781 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:39:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 16:39:15,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643375662] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:39:15,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:39:15,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 20 [2024-11-07 16:39:15,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771861998] [2024-11-07 16:39:15,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:15,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 16:39:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:15,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 16:39:15,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:39:15,843 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 21 states, 20 states have (on average 3.85) internal successors, (77), 19 states have internal predecessors, (77), 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:39:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:15,972 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2024-11-07 16:39:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 16:39:15,973 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 19 states have internal predecessors, (77), 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 36 [2024-11-07 16:39:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:15,974 INFO L225 Difference]: With dead ends: 108 [2024-11-07 16:39:15,974 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 16:39:15,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:39:15,974 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 5 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:15,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 555 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:39:15,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 16:39:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-07 16:39:15,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.2307692307692308) 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:39:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2024-11-07 16:39:15,978 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 36 [2024-11-07 16:39:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:15,978 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2024-11-07 16:39:15,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 19 states have internal predecessors, (77), 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:39:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2024-11-07 16:39:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 16:39:15,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:15,978 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] [2024-11-07 16:39:15,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 16:39:16,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:16,182 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:16,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:16,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1831518759, now seen corresponding path program 1 times [2024-11-07 16:39:16,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:16,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22411292] [2024-11-07 16:39:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:16,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:16,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:39:16,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:16,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22411292] [2024-11-07 16:39:16,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22411292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:16,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764878465] [2024-11-07 16:39:16,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:16,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:16,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:16,600 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:39:16,602 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:39:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:16,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-07 16:39:16,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:16,746 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:39:16,750 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:39:16,851 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:39:16,851 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-07 16:39:16,866 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:39:16,866 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-07 16:39:16,917 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 31 treesize of output 19 [2024-11-07 16:39:16,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-07 16:39:17,202 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 10 treesize of output 9 [2024-11-07 16:39:17,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:17,266 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 25 treesize of output 23 [2024-11-07 16:39:17,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:17,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:17,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 47 [2024-11-07 16:39:17,298 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:17,299 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:39:17,410 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:39:17,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:17,530 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 10 treesize of output 8 [2024-11-07 16:39:17,840 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_1245 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245))) (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.base|))) |c_ULTIMATE.start_create_~sll~0#1.base|) 0) |c_ULTIMATE.start_create_~sll~0#1.base|)) (forall ((v_ArrVal_1244 (Array Int Int)) (|ULTIMATE.start_create_~data~0#1.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1244))) (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| |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0)))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_1245 (Array Int Int))) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245))) (store .cse3 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) |c_ULTIMATE.start_create_~sll~0#1.base|))) (or (= (select .cse2 8) 0) (= (select .cse2 0) |c_ULTIMATE.start_create_~sll~0#1.base|))))) is different from false [2024-11-07 16:39:17,860 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_1245 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) (or (= (select .cse0 8) 0) (= |c_ULTIMATE.start_create_#t~ret4#1.base| (select .cse0 0))))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_1244 (Array Int Int)) (|ULTIMATE.start_create_~data~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.offset|) 8) 0)) (forall ((v_ArrVal_1245 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~ret4#1.base| (select (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.base|) 0)))))) is different from false [2024-11-07 16:39:17,920 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_1245 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.base|) 0) |c_alloc_and_zero_#res.base|)) (forall ((v_ArrVal_1244 (Array Int Int)) (|ULTIMATE.start_create_~data~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1244) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.offset|) 8) 0)))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_1245 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.base|))) (or (= (select .cse0 8) 0) (= (select .cse0 0) |c_alloc_and_zero_#res.base|))))) is different from false [2024-11-07 16:39:17,953 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_1245 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245) c_alloc_and_zero_~pi~0.base) c_alloc_and_zero_~pi~0.offset |ULTIMATE.start_create_~data~0#1.base|) 0) c_alloc_and_zero_~pi~0.base)) (forall ((v_ArrVal_1244 (Array Int Int)) (|ULTIMATE.start_create_~data~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1244) c_alloc_and_zero_~pi~0.base) c_alloc_and_zero_~pi~0.offset |ULTIMATE.start_create_~data~0#1.offset|) 8) 0)))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_1245 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245) c_alloc_and_zero_~pi~0.base) c_alloc_and_zero_~pi~0.offset |ULTIMATE.start_create_~data~0#1.base|))) (or (= (select .cse0 8) 0) (= (select .cse0 0) c_alloc_and_zero_~pi~0.base))))) is different from false [2024-11-07 16:39:17,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:17,965 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 23 treesize of output 24 [2024-11-07 16:39:17,970 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 38 treesize of output 34 [2024-11-07 16:39:17,981 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:39:17,982 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 32 treesize of output 29 [2024-11-07 16:39:17,988 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:39:17,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:17,996 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 23 treesize of output 24 [2024-11-07 16:39:18,001 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 38 treesize of output 34 [2024-11-07 16:39:18,005 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:18,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:18,013 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:39:18,018 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:18,020 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 9 treesize of output 7 [2024-11-07 16:39:18,038 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:39:18,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764878465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:39:18,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:39:18,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 39 [2024-11-07 16:39:18,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589889536] [2024-11-07 16:39:18,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:18,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-07 16:39:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:18,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-07 16:39:18,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1104, Unknown=4, NotChecked=276, Total=1482 [2024-11-07 16:39:18,042 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 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:39:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:19,035 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2024-11-07 16:39:19,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 16:39:19,036 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 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 37 [2024-11-07 16:39:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:19,037 INFO L225 Difference]: With dead ends: 142 [2024-11-07 16:39:19,037 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 16:39:19,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=1996, Unknown=4, NotChecked=372, Total=2550 [2024-11-07 16:39:19,038 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:19,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 756 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1155 Invalid, 0 Unknown, 301 Unchecked, 0.6s Time] [2024-11-07 16:39:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 16:39:19,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 131. [2024-11-07 16:39:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 115 states have (on average 1.2695652173913043) internal successors, (146), 126 states have internal predecessors, (146), 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:39:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2024-11-07 16:39:19,043 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 37 [2024-11-07 16:39:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:19,043 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2024-11-07 16:39:19,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 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:39:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2024-11-07 16:39:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 16:39:19,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:19,044 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] [2024-11-07 16:39:19,059 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:39:19,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-07 16:39:19,245 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:19,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:19,245 INFO L85 PathProgramCache]: Analyzing trace with hash -942508120, now seen corresponding path program 1 times [2024-11-07 16:39:19,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:19,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900305940] [2024-11-07 16:39:19,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:19,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:19,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:19,712 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:39:19,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:19,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900305940] [2024-11-07 16:39:19,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900305940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:19,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055688985] [2024-11-07 16:39:19,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:19,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:19,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:19,715 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:39:19,717 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:39:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:19,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-07 16:39:19,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:20,045 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:39:20,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:20,265 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 39 treesize of output 31 [2024-11-07 16:39:20,603 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~l#1.base_23| Int) (|v_ULTIMATE.start_destroy_#t~mem13#1.base_14| Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_23| 1) |v_ULTIMATE.start_destroy_#t~mem13#1.base_14|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_23|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem13#1.base_14| 0) |v_ULTIMATE.start_destroy_~l#1.base_23| 0)))) is different from true [2024-11-07 16:39:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-07 16:39:20,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:20,860 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 44 [2024-11-07 16:39:21,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055688985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:21,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:21,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2024-11-07 16:39:21,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203707358] [2024-11-07 16:39:21,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:21,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-07 16:39:21,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:21,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-07 16:39:21,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1310, Unknown=1, NotChecked=72, Total=1482 [2024-11-07 16:39:21,328 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand has 29 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 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:39:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:22,202 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2024-11-07 16:39:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:39:22,202 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 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 38 [2024-11-07 16:39:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:22,203 INFO L225 Difference]: With dead ends: 138 [2024-11-07 16:39:22,203 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 16:39:22,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=160, Invalid=2005, Unknown=1, NotChecked=90, Total=2256 [2024-11-07 16:39:22,204 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:22,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 482 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 798 Invalid, 0 Unknown, 84 Unchecked, 0.5s Time] [2024-11-07 16:39:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 16:39:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-07 16:39:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 109 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:39:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2024-11-07 16:39:22,207 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 38 [2024-11-07 16:39:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:22,207 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2024-11-07 16:39:22,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 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:39:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2024-11-07 16:39:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 16:39:22,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:22,207 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] [2024-11-07 16:39:22,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-07 16:39:22,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-07 16:39:22,412 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:22,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash 814734249, now seen corresponding path program 1 times [2024-11-07 16:39:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:22,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446120060] [2024-11-07 16:39:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:22,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:22,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 16:39:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:39:22,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:22,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446120060] [2024-11-07 16:39:22,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446120060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:22,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331962235] [2024-11-07 16:39:22,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:22,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:22,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:22,941 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:39:22,943 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:39:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:23,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-07 16:39:23,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:23,202 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:39:23,371 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:39:23,372 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-07 16:39:23,377 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 5 treesize of output 3 [2024-11-07 16:39:23,389 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:23,390 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:39:23,433 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:39:23,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:23,442 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 27 treesize of output 11 [2024-11-07 16:39:23,497 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 3 [2024-11-07 16:39:23,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:23,556 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-11-07 16:39:23,556 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 2 case distinctions, treesize of input 49 treesize of output 36 [2024-11-07 16:39:23,804 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 16:39:23,804 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 19 [2024-11-07 16:39:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:39:23,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:23,939 INFO L349 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2024-11-07 16:39:23,939 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 26 treesize of output 25 [2024-11-07 16:39:24,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331962235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:24,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:24,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2024-11-07 16:39:24,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754408736] [2024-11-07 16:39:24,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:24,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-07 16:39:24,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:24,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-07 16:39:24,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1821, Unknown=0, NotChecked=0, Total=1980 [2024-11-07 16:39:24,155 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 31 states have internal predecessors, (65), 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:39:24,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:24,824 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2024-11-07 16:39:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:39:24,825 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 31 states have internal predecessors, (65), 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 39 [2024-11-07 16:39:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:24,825 INFO L225 Difference]: With dead ends: 116 [2024-11-07 16:39:24,825 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 16:39:24,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=264, Invalid=2816, Unknown=0, NotChecked=0, Total=3080 [2024-11-07 16:39:24,827 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:24,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 896 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:39:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 16:39:24,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-07 16:39:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 110 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:39:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2024-11-07 16:39:24,830 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 39 [2024-11-07 16:39:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:24,831 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2024-11-07 16:39:24,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 31 states have internal predecessors, (65), 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:39:24,831 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2024-11-07 16:39:24,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 16:39:24,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:24,831 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] [2024-11-07 16:39:24,848 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:39:25,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:25,036 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:25,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash 814734250, now seen corresponding path program 1 times [2024-11-07 16:39:25,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:25,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141424608] [2024-11-07 16:39:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:25,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:25,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:25,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 16:39:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:25,949 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:39:25,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:25,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141424608] [2024-11-07 16:39:25,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141424608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:25,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671098969] [2024-11-07 16:39:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:25,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:25,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:25,952 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:39:25,954 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:39:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:26,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-07 16:39:26,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:26,312 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:26,312 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:39:26,361 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:39:26,364 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:39:26,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:26,452 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 88 treesize of output 48 [2024-11-07 16:39:26,458 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 43 treesize of output 13 [2024-11-07 16:39:26,638 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:39:26,642 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:39:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:39:26,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:26,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:26,870 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 61 treesize of output 65 [2024-11-07 16:39:27,095 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 81 treesize of output 75 [2024-11-07 16:39:27,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:27,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:27,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:27,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:27,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671098969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:27,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:27,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 36 [2024-11-07 16:39:27,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416448468] [2024-11-07 16:39:27,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:27,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-07 16:39:27,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:27,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-07 16:39:27,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1914, Unknown=0, NotChecked=0, Total=2070 [2024-11-07 16:39:27,260 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 31 states have internal predecessors, (68), 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:39:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:27,867 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2024-11-07 16:39:27,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:39:27,867 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 31 states have internal predecessors, (68), 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 39 [2024-11-07 16:39:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:27,868 INFO L225 Difference]: With dead ends: 119 [2024-11-07 16:39:27,868 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 16:39:27,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=236, Invalid=2734, Unknown=0, NotChecked=0, Total=2970 [2024-11-07 16:39:27,869 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 20 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:27,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 940 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:39:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 16:39:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-07 16:39:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 113 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:39:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2024-11-07 16:39:27,873 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 39 [2024-11-07 16:39:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:27,873 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2024-11-07 16:39:27,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 31 states have internal predecessors, (68), 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:39:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2024-11-07 16:39:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:39:27,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:27,874 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:27,891 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:39:28,074 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,SelfDestructingSolverStorable30 [2024-11-07 16:39:28,074 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:28,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash 886407223, now seen corresponding path program 1 times [2024-11-07 16:39:28,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:28,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760578356] [2024-11-07 16:39:28,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:28,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:28,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 16:39:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:39:28,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760578356] [2024-11-07 16:39:28,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760578356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590878317] [2024-11-07 16:39:28,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:28,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:28,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:28,488 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:39:28,489 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:39:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:28,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-07 16:39:28,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:28,661 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:39:28,734 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:28,734 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:39:28,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:28,750 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:39:28,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:39:28,766 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:39:28,784 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:39:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:39:28,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:28,857 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1637 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_1637) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|) 0)) is different from false [2024-11-07 16:39:28,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590878317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:28,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:28,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 18 [2024-11-07 16:39:28,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759667514] [2024-11-07 16:39:28,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:28,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 16:39:28,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 16:39:28,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=388, Unknown=18, NotChecked=40, Total=506 [2024-11-07 16:39:28,944 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:39:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:29,183 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2024-11-07 16:39:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:39:29,183 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-11-07 16:39:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:29,184 INFO L225 Difference]: With dead ends: 138 [2024-11-07 16:39:29,184 INFO L226 Difference]: Without dead ends: 138 [2024-11-07 16:39:29,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=588, Unknown=18, NotChecked=50, Total=756 [2024-11-07 16:39:29,185 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 26 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:29,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 395 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:29,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-07 16:39:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2024-11-07 16:39:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 115 states have internal predecessors, (134), 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:39:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2024-11-07 16:39:29,190 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 42 [2024-11-07 16:39:29,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:29,190 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2024-11-07 16:39:29,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:39:29,191 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2024-11-07 16:39:29,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-07 16:39:29,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:29,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:29,205 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:39:29,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:29,392 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:29,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:29,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1708820249, now seen corresponding path program 1 times [2024-11-07 16:39:29,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:29,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796397964] [2024-11-07 16:39:29,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:29,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:29,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:29,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 16:39:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:39:29,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:29,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796397964] [2024-11-07 16:39:29,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796397964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:29,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762546887] [2024-11-07 16:39:29,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:29,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:29,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:29,816 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:39:29,818 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:39:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:29,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-07 16:39:29,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:30,061 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:39:30,130 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:39:30,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:30,254 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:39:30,264 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:30,265 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:39:30,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 16:39:30,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:30,321 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:39:30,369 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 3 [2024-11-07 16:39:30,415 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-11-07 16:39:30,415 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2024-11-07 16:39:30,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-07 16:39:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:39:30,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:31,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762546887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:31,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:31,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2024-11-07 16:39:31,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016350220] [2024-11-07 16:39:31,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:31,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-07 16:39:31,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:31,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-07 16:39:31,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1475, Unknown=1, NotChecked=0, Total=1640 [2024-11-07 16:39:31,211 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 33 states, 32 states have (on average 2.3125) internal successors, (74), 28 states have internal predecessors, (74), 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:39:35,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:39:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:35,762 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2024-11-07 16:39:35,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:39:35,763 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.3125) internal successors, (74), 28 states have internal predecessors, (74), 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 43 [2024-11-07 16:39:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:35,763 INFO L225 Difference]: With dead ends: 137 [2024-11-07 16:39:35,763 INFO L226 Difference]: Without dead ends: 137 [2024-11-07 16:39:35,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=258, Invalid=2093, Unknown=1, NotChecked=0, Total=2352 [2024-11-07 16:39:35,764 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:35,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 536 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 558 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-11-07 16:39:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-07 16:39:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2024-11-07 16:39:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 117 states have internal predecessors, (136), 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:39:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2024-11-07 16:39:35,767 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 43 [2024-11-07 16:39:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:35,768 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2024-11-07 16:39:35,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.3125) internal successors, (74), 28 states have internal predecessors, (74), 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:39:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2024-11-07 16:39:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 16:39:35,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:35,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:35,786 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:39:35,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:35,969 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:35,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:35,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1433820281, now seen corresponding path program 1 times [2024-11-07 16:39:35,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:35,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175138305] [2024-11-07 16:39:35,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:35,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:36,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 16:39:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:39:36,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:36,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175138305] [2024-11-07 16:39:36,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175138305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:36,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372172733] [2024-11-07 16:39:36,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:36,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:36,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:36,459 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:39:36,461 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:39:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:36,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-07 16:39:36,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:36,771 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:36,772 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:39:36,813 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:39:36,889 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:39:36,889 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:39:37,022 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 30 treesize of output 12 [2024-11-07 16:39:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:39:37,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:37,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:37,342 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 23 treesize of output 24 [2024-11-07 16:39:37,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:37,348 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 39 treesize of output 38 [2024-11-07 16:39:37,350 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 18 [2024-11-07 16:39:37,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372172733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:37,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:37,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2024-11-07 16:39:37,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943936751] [2024-11-07 16:39:37,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:37,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-07 16:39:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:37,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-07 16:39:37,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1280, Unknown=19, NotChecked=0, Total=1406 [2024-11-07 16:39:37,454 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand has 30 states, 30 states have (on average 2.5) internal successors, (75), 26 states have internal predecessors, (75), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:39:38,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:38,187 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2024-11-07 16:39:38,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:39:38,187 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.5) internal successors, (75), 26 states have internal predecessors, (75), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2024-11-07 16:39:38,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:38,188 INFO L225 Difference]: With dead ends: 122 [2024-11-07 16:39:38,188 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 16:39:38,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=195, Invalid=2236, Unknown=19, NotChecked=0, Total=2450 [2024-11-07 16:39:38,189 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:38,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 815 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:39:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 16:39:38,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2024-11-07 16:39:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 113 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:39:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2024-11-07 16:39:38,192 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 137 transitions. Word has length 44 [2024-11-07 16:39:38,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:38,192 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 137 transitions. [2024-11-07 16:39:38,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.5) internal successors, (75), 26 states have internal predecessors, (75), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:39:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2024-11-07 16:39:38,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 16:39:38,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:38,192 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-07 16:39:38,205 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:39:38,393 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,SelfDestructingSolverStorable33 [2024-11-07 16:39:38,393 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-07 16:39:38,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:38,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1653040911, now seen corresponding path program 2 times [2024-11-07 16:39:38,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:38,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539578133] [2024-11-07 16:39:38,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:38,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:39,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:39,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 16:39:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:39:39,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:39,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539578133] [2024-11-07 16:39:39,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539578133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:39,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787651705] [2024-11-07 16:39:39,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:39:39,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:39,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:39,170 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:39:39,172 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:39:39,331 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:39:39,331 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:39:39,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-07 16:39:39,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:39,432 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:39:39,441 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:39:39,474 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:39,475 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:39:39,523 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 26 [2024-11-07 16:39:39,534 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 33 treesize of output 17 [2024-11-07 16:39:39,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:39,671 INFO L349 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2024-11-07 16:39:39,672 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 2 case distinctions, treesize of input 103 treesize of output 60 [2024-11-07 16:39:39,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:39,679 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 56 treesize of output 29 [2024-11-07 16:39:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:39:39,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:40:04,137 INFO L349 Elim1Store]: treesize reduction 1473, result has 47.5 percent of original size [2024-11-07 16:40:04,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 7401 treesize of output 5277 [2024-11-07 16:40:04,682 INFO L349 Elim1Store]: treesize reduction 204, result has 39.5 percent of original size [2024-11-07 16:40:04,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 5701 treesize of output 4831 [2024-11-07 16:40:04,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:40:04,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 3954 treesize of output 4030 [2024-11-07 16:40:07,444 INFO L349 Elim1Store]: treesize reduction 1557, result has 46.0 percent of original size [2024-11-07 16:40:07,445 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 15 new quantified variables, introduced 68 case distinctions, treesize of input 12982 treesize of output 8181 [2024-11-07 16:40:08,570 INFO L349 Elim1Store]: treesize reduction 372, result has 42.0 percent of original size [2024-11-07 16:40:08,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 5672 treesize of output 5722 [2024-11-07 16:40:08,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:40:08,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 5856 treesize of output 5464