./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-middle-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-middle-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', '003ead3201cb38ecc17dca4c0dd7fb7b12eace11010ba9f6077aefef97bddb9b'] 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-middle-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 003ead3201cb38ecc17dca4c0dd7fb7b12eace11010ba9f6077aefef97bddb9b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:38:50,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:38:50,131 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:50,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:38:50,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:38:50,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:38:50,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:38:50,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:38:50,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:38:50,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:38:50,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:38:50,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:38:50,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:38:50,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:38:50,156 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:38:50,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:38:50,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:38:50,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:38:50,157 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:38:50,157 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:38:50,157 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:38:50,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:38:50,157 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:38:50,157 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:38:50,158 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:38:50,158 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:38:50,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:38:50,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:38:50,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:38:50,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:38:50,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:38:50,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:38:50,159 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:38:50,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:38:50,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:38:50,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:38:50,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:38:50,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:38:50,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:38:50,159 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 -> 003ead3201cb38ecc17dca4c0dd7fb7b12eace11010ba9f6077aefef97bddb9b [2024-11-07 16:38:50,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:38:50,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:38:50,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:38:50,455 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:38:50,455 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:38:50,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-middle-shared.i [2024-11-07 16:38:51,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:38:52,075 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:38:52,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-middle-shared.i [2024-11-07 16:38:52,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/499293d1d/fc243b66a3f845fcbc286e37e875a647/FLAG76ad82762 [2024-11-07 16:38:52,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/499293d1d/fc243b66a3f845fcbc286e37e875a647 [2024-11-07 16:38:52,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:38:52,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:38:52,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:38:52,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:38:52,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:38:52,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:38:52" (1/1) ... [2024-11-07 16:38:52,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1fbb12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:52, skipping insertion in model container [2024-11-07 16:38:52,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:38:52" (1/1) ... [2024-11-07 16:38:52,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:38:52,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:38:52,459 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:38:52,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:38:52,530 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:38:52,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:52 WrapperNode [2024-11-07 16:38:52,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:38:52,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:38:52,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:38:52,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:38:52,536 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:52" (1/1) ... [2024-11-07 16:38:52,545 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:52" (1/1) ... [2024-11-07 16:38:52,568 INFO L138 Inliner]: procedures = 121, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 95 [2024-11-07 16:38:52,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:38:52,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:38:52,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:38:52,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:38:52,576 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:52" (1/1) ... [2024-11-07 16:38:52,576 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:52" (1/1) ... [2024-11-07 16:38:52,579 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:52" (1/1) ... [2024-11-07 16:38:52,598 INFO L175 MemorySlicer]: Split 17 memory accesses to 1 slices as follows [17]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 8 writes are split as follows [8]. [2024-11-07 16:38:52,599 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:52" (1/1) ... [2024-11-07 16:38:52,599 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:52" (1/1) ... [2024-11-07 16:38:52,611 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:52" (1/1) ... [2024-11-07 16:38:52,617 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:52" (1/1) ... [2024-11-07 16:38:52,620 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:52" (1/1) ... [2024-11-07 16:38:52,620 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:52" (1/1) ... [2024-11-07 16:38:52,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:38:52,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:38:52,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:38:52,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:38:52,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:52" (1/1) ... [2024-11-07 16:38:52,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:38:52,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:38:52,653 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:52,657 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:52,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:38:52,676 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-07 16:38:52,677 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-07 16:38:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:38:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:38:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:38:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:38:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:38:52,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:38:52,763 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:38:52,764 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:38:53,094 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-07 16:38:53,094 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:38:53,107 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:38:53,107 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-07 16:38:53,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:38:53 BoogieIcfgContainer [2024-11-07 16:38:53,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:38:53,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:38:53,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:38:53,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:38:53,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:38:52" (1/3) ... [2024-11-07 16:38:53,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6080cfd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:38:53, skipping insertion in model container [2024-11-07 16:38:53,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:52" (2/3) ... [2024-11-07 16:38:53,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6080cfd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:38:53, skipping insertion in model container [2024-11-07 16:38:53,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:38:53" (3/3) ... [2024-11-07 16:38:53,132 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-middle-shared.i [2024-11-07 16:38:53,145 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:38:53,145 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-07 16:38:53,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:38:53,195 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;@1f84a58a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:38:53,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-07 16:38:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 97 states have internal predecessors, (104), 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:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:38:53,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:53,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:38:53,205 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 41 more)] === [2024-11-07 16:38:53,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash 34543147, now seen corresponding path program 1 times [2024-11-07 16:38:53,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:53,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316660405] [2024-11-07 16:38:53,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:53,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:53,404 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,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:53,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316660405] [2024-11-07 16:38:53,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316660405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:53,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:53,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:38:53,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373178665] [2024-11-07 16:38:53,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:53,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:38:53,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:53,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:38:53,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:38:53,436 INFO L87 Difference]: Start difference. First operand has 101 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 97 states have internal predecessors, (104), 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:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:53,556 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2024-11-07 16:38:53,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:38:53,558 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:53,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:53,564 INFO L225 Difference]: With dead ends: 100 [2024-11-07 16:38:53,564 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 16:38:53,566 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:53,571 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:53,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 157 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 16:38:53,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-07 16:38:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 94 states have internal predecessors, (98), 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:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2024-11-07 16:38:53,609 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 5 [2024-11-07 16:38:53,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:53,609 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2024-11-07 16:38:53,609 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:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2024-11-07 16:38:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:38:53,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:53,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:38:53,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:38:53,610 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 41 more)] === [2024-11-07 16:38:53,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:53,610 INFO L85 PathProgramCache]: Analyzing trace with hash 34543148, now seen corresponding path program 1 times [2024-11-07 16:38:53,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:53,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560734342] [2024-11-07 16:38:53,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:53,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:53,710 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,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:53,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560734342] [2024-11-07 16:38:53,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560734342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:53,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:53,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:38:53,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741870435] [2024-11-07 16:38:53,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:53,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:38:53,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:53,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:38:53,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:38:53,712 INFO L87 Difference]: Start difference. First operand 98 states and 102 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:53,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:53,790 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2024-11-07 16:38:53,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:38:53,790 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:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:53,791 INFO L225 Difference]: With dead ends: 97 [2024-11-07 16:38:53,791 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 16:38:53,792 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:53,792 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:53,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 16:38:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-07 16:38:53,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 93 states have internal predecessors, (97), 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:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2024-11-07 16:38:53,803 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 5 [2024-11-07 16:38:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:53,803 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2024-11-07 16:38:53,803 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:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2024-11-07 16:38:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:38:53,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:53,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:53,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:38:53,804 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 41 more)] === [2024-11-07 16:38:53,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:53,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1042879868, now seen corresponding path program 1 times [2024-11-07 16:38:53,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:53,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803895191] [2024-11-07 16:38:53,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:53,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:53,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:53,939 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,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:53,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803895191] [2024-11-07 16:38:53,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803895191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:53,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:53,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:38:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20941905] [2024-11-07 16:38:53,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:53,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:38:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:38:53,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:38:53,941 INFO L87 Difference]: Start difference. First operand 97 states and 101 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:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:54,087 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2024-11-07 16:38:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:38:54,088 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:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:54,089 INFO L225 Difference]: With dead ends: 101 [2024-11-07 16:38:54,090 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 16:38:54,090 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:54,091 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 15 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:54,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 176 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 16:38:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2024-11-07 16:38:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 92 states have internal predecessors, (96), 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:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2024-11-07 16:38:54,098 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 10 [2024-11-07 16:38:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:54,098 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2024-11-07 16:38:54,098 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:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2024-11-07 16:38:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:38:54,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:54,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:54,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:38:54,099 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 41 more)] === [2024-11-07 16:38:54,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:54,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1042879867, now seen corresponding path program 1 times [2024-11-07 16:38:54,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:54,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485427075] [2024-11-07 16:38:54,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:54,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:54,260 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:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:54,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485427075] [2024-11-07 16:38:54,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485427075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:54,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:54,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:38:54,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656767764] [2024-11-07 16:38:54,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:54,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:38:54,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:54,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:38:54,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:38:54,262 INFO L87 Difference]: Start difference. First operand 96 states and 100 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:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:54,376 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-07 16:38:54,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:38:54,377 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:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:54,377 INFO L225 Difference]: With dead ends: 100 [2024-11-07 16:38:54,377 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 16:38:54,378 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:54,378 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 15 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:54,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 184 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 16:38:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-11-07 16:38:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 91 states have internal predecessors, (95), 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:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-07 16:38:54,383 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 10 [2024-11-07 16:38:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:54,383 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-07 16:38:54,384 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:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-07 16:38:54,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:38:54,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:54,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:54,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:38:54,384 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 41 more)] === [2024-11-07 16:38:54,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:54,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1480173691, now seen corresponding path program 1 times [2024-11-07 16:38:54,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:54,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430071529] [2024-11-07 16:38:54,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:54,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:54,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:54,483 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:54,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:54,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430071529] [2024-11-07 16:38:54,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430071529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:54,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:54,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:38:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677851381] [2024-11-07 16:38:54,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:54,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:38:54,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:54,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:38:54,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:38:54,484 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:54,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:54,588 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2024-11-07 16:38:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:38:54,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:54,590 INFO L225 Difference]: With dead ends: 99 [2024-11-07 16:38:54,590 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 16:38:54,590 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:54,591 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:54,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 177 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 16:38:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2024-11-07 16:38:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 90 states have internal predecessors, (94), 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:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2024-11-07 16:38:54,597 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 12 [2024-11-07 16:38:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:54,597 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-07 16:38:54,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2024-11-07 16:38:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:38:54,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:54,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:54,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:38:54,598 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 41 more)] === [2024-11-07 16:38:54,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:54,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1480173690, now seen corresponding path program 1 times [2024-11-07 16:38:54,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:54,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297825541] [2024-11-07 16:38:54,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:54,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:54,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:54,726 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:54,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:54,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297825541] [2024-11-07 16:38:54,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297825541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:54,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:54,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:38:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066114498] [2024-11-07 16:38:54,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:54,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:38:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:54,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:38:54,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:38:54,729 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:54,831 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-07 16:38:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:38:54,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:54,833 INFO L225 Difference]: With dead ends: 98 [2024-11-07 16:38:54,833 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 16:38:54,833 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:54,834 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 12 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:54,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 185 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 16:38:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-11-07 16:38:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 89 states have internal predecessors, (93), 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:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-07 16:38:54,845 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 12 [2024-11-07 16:38:54,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:54,845 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-07 16:38:54,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-07 16:38:54,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 16:38:54,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:54,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:54,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:38:54,846 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:38:54,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash -812742458, now seen corresponding path program 1 times [2024-11-07 16:38:54,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:54,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225750670] [2024-11-07 16:38:54,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:54,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:55,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:55,101 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:55,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:55,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225750670] [2024-11-07 16:38:55,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225750670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:55,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:55,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:38:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143169713] [2024-11-07 16:38:55,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:55,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:38:55,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:55,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:38:55,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:38:55,103 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:55,303 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2024-11-07 16:38:55,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:38:55,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2024-11-07 16:38:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:55,305 INFO L225 Difference]: With dead ends: 93 [2024-11-07 16:38:55,305 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 16:38:55,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:55,306 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 17 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:55,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 311 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:38:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 16:38:55,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2024-11-07 16:38:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.6923076923076923) internal successors, (88), 84 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:38:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2024-11-07 16:38:55,316 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 14 [2024-11-07 16:38:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:55,316 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2024-11-07 16:38:55,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2024-11-07 16:38:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 16:38:55,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:55,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:55,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:38:55,317 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:38:55,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:55,317 INFO L85 PathProgramCache]: Analyzing trace with hash -812742457, now seen corresponding path program 1 times [2024-11-07 16:38:55,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:55,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853213531] [2024-11-07 16:38:55,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:55,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:55,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:55,723 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:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:55,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853213531] [2024-11-07 16:38:55,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853213531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:55,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:55,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:38:55,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372990388] [2024-11-07 16:38:55,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:55,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:38:55,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:55,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:38:55,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:38:55,727 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:55,944 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-11-07 16:38:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:38:55,945 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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 14 [2024-11-07 16:38:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:55,945 INFO L225 Difference]: With dead ends: 91 [2024-11-07 16:38:55,945 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 16:38:55,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:38:55,946 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 8 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:55,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 322 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:38:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 16:38:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2024-11-07 16:38:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 82 states have internal predecessors, (86), 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:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-07 16:38:55,950 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 14 [2024-11-07 16:38:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:55,951 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-07 16:38:55,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-07 16:38:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 16:38:55,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:55,951 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:55,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:38:55,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:38:55,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:55,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2081078920, now seen corresponding path program 1 times [2024-11-07 16:38:55,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:55,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401012084] [2024-11-07 16:38:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:55,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:56,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:56,102 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:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401012084] [2024-11-07 16:38:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401012084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:56,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:38:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569748035] [2024-11-07 16:38:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:56,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:38:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:56,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:38:56,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:38:56,105 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:38:56,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:56,304 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-07 16:38:56,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:38:56,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-07 16:38:56,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:56,305 INFO L225 Difference]: With dead ends: 112 [2024-11-07 16:38:56,305 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 16:38:56,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:38:56,306 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 25 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:56,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 310 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:38:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 16:38:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2024-11-07 16:38:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 98 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:38:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2024-11-07 16:38:56,311 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 21 [2024-11-07 16:38:56,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:56,311 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2024-11-07 16:38:56,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:38:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2024-11-07 16:38:56,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 16:38:56,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:56,312 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:56,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:38:56,312 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:38:56,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:56,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2081078919, now seen corresponding path program 1 times [2024-11-07 16:38:56,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:56,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354606462] [2024-11-07 16:38:56,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:56,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:56,598 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:56,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354606462] [2024-11-07 16:38:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354606462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:56,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:56,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:38:56,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386321514] [2024-11-07 16:38:56,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:56,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:38:56,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:56,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:38:56,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:38:56,600 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:56,808 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2024-11-07 16:38:56,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:38:56,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:56,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:56,810 INFO L225 Difference]: With dead ends: 115 [2024-11-07 16:38:56,810 INFO L226 Difference]: Without dead ends: 115 [2024-11-07 16:38:56,810 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:56,810 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 21 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:56,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 495 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:38:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-07 16:38:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2024-11-07 16:38:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.5897435897435896) internal successors, (124), 106 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:38:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2024-11-07 16:38:56,820 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 21 [2024-11-07 16:38:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:56,820 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2024-11-07 16:38:56,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2024-11-07 16:38:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:38:56,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:56,821 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] [2024-11-07 16:38:56,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:38:56,821 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:38:56,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:56,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1537875595, now seen corresponding path program 1 times [2024-11-07 16:38:56,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:56,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292353249] [2024-11-07 16:38:56,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:56,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:56,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:56,993 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:56,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:56,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292353249] [2024-11-07 16:38:56,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292353249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:56,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:56,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:38:56,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721028509] [2024-11-07 16:38:56,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:56,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:38:56,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:56,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:38:56,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:38:56,996 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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:57,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:57,110 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2024-11-07 16:38:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:38:57,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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 23 [2024-11-07 16:38:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:57,112 INFO L225 Difference]: With dead ends: 117 [2024-11-07 16:38:57,112 INFO L226 Difference]: Without dead ends: 117 [2024-11-07 16:38:57,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:38:57,113 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 25 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:57,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 539 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-07 16:38:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2024-11-07 16:38:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 107 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:38:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2024-11-07 16:38:57,119 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 23 [2024-11-07 16:38:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:57,119 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2024-11-07 16:38:57,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2024-11-07 16:38:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:38:57,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:57,122 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:57,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:38:57,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:38:57,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash 918504240, now seen corresponding path program 1 times [2024-11-07 16:38:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:57,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508510142] [2024-11-07 16:38:57,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:57,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:57,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 16:38:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:57,324 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:57,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:57,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508510142] [2024-11-07 16:38:57,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508510142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:57,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:57,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:38:57,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493575258] [2024-11-07 16:38:57,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:57,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:38:57,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:57,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:38:57,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:38:57,326 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:57,454 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2024-11-07 16:38:57,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:38:57,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2024-11-07 16:38:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:57,455 INFO L225 Difference]: With dead ends: 112 [2024-11-07 16:38:57,455 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 16:38:57,456 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:57,456 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 14 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:57,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 194 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 16:38:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-07 16:38:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 107 states have internal predecessors, (122), 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:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2024-11-07 16:38:57,460 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 24 [2024-11-07 16:38:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:57,460 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2024-11-07 16:38:57,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2024-11-07 16:38:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:38:57,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:57,461 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:57,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 16:38:57,462 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:38:57,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:57,463 INFO L85 PathProgramCache]: Analyzing trace with hash 918504241, now seen corresponding path program 1 times [2024-11-07 16:38:57,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:57,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284888876] [2024-11-07 16:38:57,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:57,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:57,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 16:38:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:57,763 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:57,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:57,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284888876] [2024-11-07 16:38:57,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284888876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:38:57,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509791534] [2024-11-07 16:38:57,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:57,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:38:57,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:38:57,766 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:57,768 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:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:57,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 16:38:57,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:38:58,020 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:58,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:38:58,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-07 16:38:58,082 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:38:58,082 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:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:38:58,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:38:58,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509791534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:58,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:38:58,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-11-07 16:38:58,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562790004] [2024-11-07 16:38:58,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:58,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:38:58,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:58,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:38:58,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2024-11-07 16:38:58,104 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 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:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:58,225 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2024-11-07 16:38:58,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:38:58,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 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 24 [2024-11-07 16:38:58,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:58,227 INFO L225 Difference]: With dead ends: 116 [2024-11-07 16:38:58,227 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 16:38:58,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2024-11-07 16:38:58,228 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 26 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:58,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 199 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 125 Unchecked, 0.1s Time] [2024-11-07 16:38:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 16:38:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2024-11-07 16:38:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 107 states have internal predecessors, (118), 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:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-11-07 16:38:58,231 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 24 [2024-11-07 16:38:58,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:58,232 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-11-07 16:38:58,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 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:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-11-07 16:38:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:38:58,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:58,232 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:58,250 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:58,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-07 16:38:58,433 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:38:58,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:58,434 INFO L85 PathProgramCache]: Analyzing trace with hash -76820004, now seen corresponding path program 1 times [2024-11-07 16:38:58,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:58,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474961818] [2024-11-07 16:38:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:58,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:58,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 16:38:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:58,616 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:58,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:58,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474961818] [2024-11-07 16:38:58,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474961818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:58,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:58,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:38:58,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591866906] [2024-11-07 16:38:58,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:58,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:38:58,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:58,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:38:58,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:38:58,617 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:38:58,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:58,787 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2024-11-07 16:38:58,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:38:58,787 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-07 16:38:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:58,788 INFO L225 Difference]: With dead ends: 111 [2024-11-07 16:38:58,788 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 16:38:58,788 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:58,789 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:58,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 336 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:38:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 16:38:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-07 16:38:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 106 states have internal predecessors, (116), 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:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2024-11-07 16:38:58,792 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 27 [2024-11-07 16:38:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:58,792 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2024-11-07 16:38:58,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:38:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2024-11-07 16:38:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:38:58,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:58,793 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:58,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 16:38:58,793 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:38:58,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:58,794 INFO L85 PathProgramCache]: Analyzing trace with hash -76820003, now seen corresponding path program 1 times [2024-11-07 16:38:58,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:58,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824941811] [2024-11-07 16:38:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:58,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:59,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:59,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 16:38:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:59,068 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:59,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:59,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824941811] [2024-11-07 16:38:59,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824941811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:59,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:59,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:38:59,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795328494] [2024-11-07 16:38:59,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:59,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:38:59,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:59,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:38:59,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:38:59,070 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:59,250 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2024-11-07 16:38:59,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:38:59,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 27 [2024-11-07 16:38:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:59,253 INFO L225 Difference]: With dead ends: 110 [2024-11-07 16:38:59,253 INFO L226 Difference]: Without dead ends: 110 [2024-11-07 16:38:59,254 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:59,255 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:59,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 360 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:38:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-07 16:38:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-07 16:38:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 105 states have internal predecessors, (114), 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:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2024-11-07 16:38:59,259 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 27 [2024-11-07 16:38:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:59,259 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2024-11-07 16:38:59,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2024-11-07 16:38:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:38:59,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:59,260 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] [2024-11-07 16:38:59,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 16:38:59,261 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:38:59,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:59,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1002444452, now seen corresponding path program 1 times [2024-11-07 16:38:59,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:59,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222729487] [2024-11-07 16:38:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:00,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:00,186 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:39:00,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:00,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222729487] [2024-11-07 16:39:00,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222729487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:00,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093745719] [2024-11-07 16:39:00,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:00,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:00,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:00,189 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:39:00,191 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:39:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:00,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-07 16:39:00,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:00,329 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:39:00,352 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:00,357 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:00,487 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-07 16:39:00,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-07 16:39:00,551 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:39:00,559 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:39:00,593 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-07 16:39:00,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-07 16:39:00,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:39:00,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:39:00,739 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:39:00,746 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:39:00,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:00,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2024-11-07 16:39:00,804 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 29 treesize of output 13 [2024-11-07 16:39:00,987 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:39:00,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:02,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:02,483 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 25 treesize of output 26 [2024-11-07 16:39:02,487 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 140 treesize of output 122 [2024-11-07 16:39:02,494 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 28 treesize of output 20 [2024-11-07 16:39:02,498 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 17 treesize of output 13 [2024-11-07 16:39:02,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:02,533 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 25 treesize of output 26 [2024-11-07 16:39:02,536 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 70 treesize of output 58 [2024-11-07 16:39:02,541 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 46 treesize of output 38 [2024-11-07 16:39:02,545 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 24 treesize of output 20 [2024-11-07 16:39:02,681 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:39:02,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093745719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:39:02,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:39:02,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 39 [2024-11-07 16:39:02,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928005972] [2024-11-07 16:39:02,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:02,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-07 16:39:02,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:02,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-07 16:39:02,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1330, Unknown=21, NotChecked=0, Total=1482 [2024-11-07 16:39:02,684 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 35 states have internal predecessors, (68), 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:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:03,693 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-11-07 16:39:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 16:39:03,693 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 35 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-07 16:39:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:03,694 INFO L225 Difference]: With dead ends: 112 [2024-11-07 16:39:03,694 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 16:39:03,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=197, Invalid=1761, Unknown=22, NotChecked=0, Total=1980 [2024-11-07 16:39:03,695 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:03,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1182 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 16:39:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 16:39:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-07 16:39:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 107 states have internal predecessors, (116), 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:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2024-11-07 16:39:03,698 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 28 [2024-11-07 16:39:03,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:03,698 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2024-11-07 16:39:03,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 35 states have internal predecessors, (68), 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:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2024-11-07 16:39:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:39:03,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:03,699 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:03,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 16:39:03,901 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,SelfDestructingSolverStorable15 [2024-11-07 16:39:03,902 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:03,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash 672845527, now seen corresponding path program 1 times [2024-11-07 16:39:03,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:03,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304198292] [2024-11-07 16:39:03,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:04,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:04,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 16:39:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:04,144 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:39:04,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:04,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304198292] [2024-11-07 16:39:04,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304198292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:04,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:04,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:39:04,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732685712] [2024-11-07 16:39:04,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:04,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:39:04,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:04,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:39:04,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:39:04,147 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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:39:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:04,376 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2024-11-07 16:39:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 16:39:04,377 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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 30 [2024-11-07 16:39:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:04,378 INFO L225 Difference]: With dead ends: 113 [2024-11-07 16:39:04,378 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 16:39:04,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:39:04,378 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 23 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:04,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 535 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:04,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 16:39:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-07 16:39:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 107 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:39:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2024-11-07 16:39:04,383 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 30 [2024-11-07 16:39:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:04,384 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-07 16:39:04,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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:39:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2024-11-07 16:39:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:39:04,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:04,384 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:04,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 16:39:04,384 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:04,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:04,385 INFO L85 PathProgramCache]: Analyzing trace with hash 672845528, now seen corresponding path program 1 times [2024-11-07 16:39:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:04,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812936839] [2024-11-07 16:39:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:04,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:04,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:04,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 16:39:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:04,746 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:39:04,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812936839] [2024-11-07 16:39:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812936839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:04,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:04,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:39:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861156220] [2024-11-07 16:39:04,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:04,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:39:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:04,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:39:04,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:39:04,748 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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:39:05,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:05,031 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-11-07 16:39:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:39:05,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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 30 [2024-11-07 16:39:05,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:05,033 INFO L225 Difference]: With dead ends: 112 [2024-11-07 16:39:05,033 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 16:39:05,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:39:05,033 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 20 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:05,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 475 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:05,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 16:39:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-07 16:39:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 107 states have internal predecessors, (114), 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:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2024-11-07 16:39:05,037 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 30 [2024-11-07 16:39:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:05,037 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2024-11-07 16:39:05,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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:39:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2024-11-07 16:39:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:39:05,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:05,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:05,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 16:39:05,039 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:05,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:05,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1276486289, now seen corresponding path program 1 times [2024-11-07 16:39:05,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:05,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599423241] [2024-11-07 16:39:05,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:05,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:05,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:05,143 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:05,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:05,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599423241] [2024-11-07 16:39:05,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599423241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:05,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:05,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:39:05,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153006362] [2024-11-07 16:39:05,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:05,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:39:05,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:05,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:39:05,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:39:05,145 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:39:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:05,349 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2024-11-07 16:39:05,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:39:05,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-07 16:39:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:05,350 INFO L225 Difference]: With dead ends: 128 [2024-11-07 16:39:05,350 INFO L226 Difference]: Without dead ends: 128 [2024-11-07 16:39:05,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:39:05,351 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 44 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:05,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 271 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-07 16:39:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2024-11-07 16:39:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 118 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:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 140 transitions. [2024-11-07 16:39:05,355 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 140 transitions. Word has length 30 [2024-11-07 16:39:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:05,356 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 140 transitions. [2024-11-07 16:39:05,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:39:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2024-11-07 16:39:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:39:05,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:05,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:05,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 16:39:05,358 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:05,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:05,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1276486288, now seen corresponding path program 1 times [2024-11-07 16:39:05,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:05,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963790432] [2024-11-07 16:39:05,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:05,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:05,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:05,606 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:05,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:05,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963790432] [2024-11-07 16:39:05,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963790432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:05,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925237717] [2024-11-07 16:39:05,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:05,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:05,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:05,610 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:05,612 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:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:05,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 16:39:05,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:05,929 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:05,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:06,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:06,118 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:06,189 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:06,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925237717] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:06,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:06,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 7] total 23 [2024-11-07 16:39:06,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869507150] [2024-11-07 16:39:06,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:06,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:39:06,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:06,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:39:06,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2024-11-07 16:39:06,191 INFO L87 Difference]: Start difference. First operand 123 states and 140 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:39:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:06,412 INFO L93 Difference]: Finished difference Result 132 states and 156 transitions. [2024-11-07 16:39:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:39:06,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-07 16:39:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:06,414 INFO L225 Difference]: With dead ends: 132 [2024-11-07 16:39:06,414 INFO L226 Difference]: Without dead ends: 132 [2024-11-07 16:39:06,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2024-11-07 16:39:06,415 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 31 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:06,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 293 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:06,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-07 16:39:06,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-11-07 16:39:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 96 states have (on average 1.4375) internal successors, (138), 121 states have internal predecessors, (138), 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,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2024-11-07 16:39:06,420 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 30 [2024-11-07 16:39:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:06,420 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2024-11-07 16:39:06,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:39:06,420 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2024-11-07 16:39:06,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:39:06,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:06,421 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:06,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 16:39:06,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:06,626 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:06,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:06,626 INFO L85 PathProgramCache]: Analyzing trace with hash -916349114, now seen corresponding path program 1 times [2024-11-07 16:39:06,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:06,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986829086] [2024-11-07 16:39:06,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:06,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:06,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:06,748 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:06,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:06,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986829086] [2024-11-07 16:39:06,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986829086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:06,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:06,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:39:06,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879222281] [2024-11-07 16:39:06,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:06,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:39:06,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:06,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:39:06,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:39:06,750 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 8 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:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:06,887 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2024-11-07 16:39:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:39:06,888 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 8 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:06,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:06,889 INFO L225 Difference]: With dead ends: 131 [2024-11-07 16:39:06,889 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 16:39:06,890 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:06,890 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 43 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:06,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 474 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:39:06,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 16:39:06,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2024-11-07 16:39:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 120 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:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2024-11-07 16:39:06,896 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 31 [2024-11-07 16:39:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:06,896 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2024-11-07 16:39:06,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 8 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:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2024-11-07 16:39:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:39:06,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:06,897 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:06,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 16:39:06,897 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:06,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:06,897 INFO L85 PathProgramCache]: Analyzing trace with hash -916369230, now seen corresponding path program 1 times [2024-11-07 16:39:06,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:06,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553310418] [2024-11-07 16:39:06,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:06,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,140 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,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:07,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553310418] [2024-11-07 16:39:07,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553310418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:07,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522382575] [2024-11-07 16:39:07,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:07,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:07,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:07,144 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:07,145 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:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 16:39:07,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:07,309 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:07,317 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 16:39:07,339 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,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:39:07,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522382575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:07,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:39:07,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2024-11-07 16:39:07,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520593128] [2024-11-07 16:39:07,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:07,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:39:07,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:07,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:39:07,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:39:07,341 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 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:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:07,525 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2024-11-07 16:39:07,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:39:07,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 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:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:07,527 INFO L225 Difference]: With dead ends: 141 [2024-11-07 16:39:07,527 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 16:39:07,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:39:07,528 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 32 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:07,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 410 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:07,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 16:39:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 126. [2024-11-07 16:39:07,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 121 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:39:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2024-11-07 16:39:07,535 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 31 [2024-11-07 16:39:07,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:07,535 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2024-11-07 16:39:07,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 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:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2024-11-07 16:39:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 16:39:07,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:07,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:07,552 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:07,736 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,SelfDestructingSolverStorable21 [2024-11-07 16:39:07,736 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:07,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:07,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1657325071, now seen corresponding path program 1 times [2024-11-07 16:39:07,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:07,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175968002] [2024-11-07 16:39:07,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:07,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,007 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:08,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:08,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175968002] [2024-11-07 16:39:08,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175968002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:08,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488343939] [2024-11-07 16:39:08,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:08,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:08,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:08,009 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:08,011 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:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 16:39:08,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:08,185 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:08,192 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 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-07 16:39:08,222 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:08,225 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,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:39:08,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488343939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:08,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:39:08,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2024-11-07 16:39:08,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320248654] [2024-11-07 16:39:08,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:08,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:39:08,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:08,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:39:08,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:39:08,226 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:39:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:08,461 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2024-11-07 16:39:08,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:39:08,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-07 16:39:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:08,462 INFO L225 Difference]: With dead ends: 140 [2024-11-07 16:39:08,462 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 16:39:08,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:39:08,463 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 32 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:08,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 329 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 16:39:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2024-11-07 16:39:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 122 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:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2024-11-07 16:39:08,466 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 32 [2024-11-07 16:39:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:08,466 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2024-11-07 16:39:08,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:39:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2024-11-07 16:39:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:39:08,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:08,466 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] [2024-11-07 16:39:08,483 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:08,670 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,SelfDestructingSolverStorable22 [2024-11-07 16:39:08,671 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:08,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:08,671 INFO L85 PathProgramCache]: Analyzing trace with hash -162530220, now seen corresponding path program 1 times [2024-11-07 16:39:08,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:08,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731849230] [2024-11-07 16:39:08,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:08,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,994 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:08,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:08,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731849230] [2024-11-07 16:39:08,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731849230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:08,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565810917] [2024-11-07 16:39:08,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:08,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:08,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:08,997 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:08,998 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:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 16:39:09,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:09,152 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:39:09,180 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-07 16:39:09,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-07 16:39:09,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 15 treesize of output 1 [2024-11-07 16:39:09,209 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 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-07 16:39:09,237 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:09,241 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,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:39:09,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565810917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:09,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:39:09,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 12 [2024-11-07 16:39:09,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831651841] [2024-11-07 16:39:09,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:09,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:39:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:39:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:39:09,243 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:09,441 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2024-11-07 16:39:09,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:39:09,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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 33 [2024-11-07 16:39:09,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:09,442 INFO L225 Difference]: With dead ends: 128 [2024-11-07 16:39:09,442 INFO L226 Difference]: Without dead ends: 128 [2024-11-07 16:39:09,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:39:09,443 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 11 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:09,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 352 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:09,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-07 16:39:09,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-07 16:39:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 123 states have internal predecessors, (135), 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,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2024-11-07 16:39:09,446 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 33 [2024-11-07 16:39:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:09,446 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2024-11-07 16:39:09,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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,447 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2024-11-07 16:39:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:39:09,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:09,448 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:09,465 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:09,648 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,SelfDestructingSolverStorable23 [2024-11-07 16:39:09,649 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:09,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:09,649 INFO L85 PathProgramCache]: Analyzing trace with hash -743469390, now seen corresponding path program 1 times [2024-11-07 16:39:09,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:09,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868311666] [2024-11-07 16:39:09,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:09,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,995 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:09,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:09,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868311666] [2024-11-07 16:39:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868311666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:09,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974482250] [2024-11-07 16:39:09,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:09,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:09,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:09,998 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:10,000 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:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:10,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-07 16:39:10,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:10,161 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:39:10,180 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:10,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:39:10,214 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 15 treesize of output 1 [2024-11-07 16:39:10,241 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 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-07 16:39:10,348 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 16 treesize of output 8 [2024-11-07 16:39:10,362 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:10,364 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,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:39:10,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974482250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:10,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:39:10,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14] total 19 [2024-11-07 16:39:10,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922445805] [2024-11-07 16:39:10,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:10,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:39:10,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:39:10,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-07 16:39:10,365 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:10,635 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2024-11-07 16:39:10,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:39:10,635 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:10,636 INFO L225 Difference]: With dead ends: 139 [2024-11-07 16:39:10,636 INFO L226 Difference]: Without dead ends: 139 [2024-11-07 16:39:10,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-07 16:39:10,637 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 53 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:10,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 437 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-07 16:39:10,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2024-11-07 16:39:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 124 states have internal predecessors, (137), 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,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2024-11-07 16:39:10,640 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 34 [2024-11-07 16:39:10,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:10,640 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2024-11-07 16:39:10,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2024-11-07 16:39:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:39:10,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:10,641 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:10,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 16:39:10,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:10,845 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:10,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:10,846 INFO L85 PathProgramCache]: Analyzing trace with hash -743469389, now seen corresponding path program 1 times [2024-11-07 16:39:10,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:10,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056800560] [2024-11-07 16:39:10,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:10,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:11,072 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,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:11,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056800560] [2024-11-07 16:39:11,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056800560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:11,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262112501] [2024-11-07 16:39:11,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:11,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:11,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:11,075 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:11,076 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:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:11,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 16:39:11,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:11,396 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,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:39:11,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262112501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:11,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:39:11,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2024-11-07 16:39:11,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237640491] [2024-11-07 16:39:11,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:11,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:39:11,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:11,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:39:11,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-11-07 16:39:11,398 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) 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,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:11,571 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2024-11-07 16:39:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:39:11,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) 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,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:11,573 INFO L225 Difference]: With dead ends: 142 [2024-11-07 16:39:11,573 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 16:39:11,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-11-07 16:39:11,574 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 42 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:11,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 282 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 16:39:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2024-11-07 16:39:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 129 states have internal predecessors, (145), 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,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2024-11-07 16:39:11,582 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 34 [2024-11-07 16:39:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:11,582 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2024-11-07 16:39:11,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) 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,582 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2024-11-07 16:39:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 16:39:11,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:11,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:11,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 16:39:11,783 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,SelfDestructingSolverStorable25 [2024-11-07 16:39:11,783 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:11,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:11,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1572714536, now seen corresponding path program 1 times [2024-11-07 16:39:11,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:11,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251990147] [2024-11-07 16:39:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:11,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:12,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:12,065 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:12,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:12,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251990147] [2024-11-07 16:39:12,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251990147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:12,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:12,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 16:39:12,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660841852] [2024-11-07 16:39:12,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:12,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:39:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:12,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:39:12,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:39:12,067 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:39:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:12,288 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2024-11-07 16:39:12,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:39:12,289 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-07 16:39:12,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:12,290 INFO L225 Difference]: With dead ends: 138 [2024-11-07 16:39:12,290 INFO L226 Difference]: Without dead ends: 138 [2024-11-07 16:39:12,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:39:12,290 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:12,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 569 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-07 16:39:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2024-11-07 16:39:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 131 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:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2024-11-07 16:39:12,294 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 35 [2024-11-07 16:39:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:12,294 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2024-11-07 16:39:12,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:39:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2024-11-07 16:39:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 16:39:12,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:12,295 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] [2024-11-07 16:39:12,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 16:39:12,296 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:12,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:12,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1509510222, now seen corresponding path program 1 times [2024-11-07 16:39:12,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:12,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737818617] [2024-11-07 16:39:12,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:12,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:12,579 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:12,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:12,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737818617] [2024-11-07 16:39:12,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737818617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:12,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:12,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 16:39:12,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811748940] [2024-11-07 16:39:12,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:12,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:39:12,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:12,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:39:12,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:39:12,583 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:12,822 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2024-11-07 16:39:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 16:39:12,822 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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 36 [2024-11-07 16:39:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:12,823 INFO L225 Difference]: With dead ends: 137 [2024-11-07 16:39:12,823 INFO L226 Difference]: Without dead ends: 137 [2024-11-07 16:39:12,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:39:12,824 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 22 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:12,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 545 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-07 16:39:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-11-07 16:39:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 131 states have internal predecessors, (145), 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:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2024-11-07 16:39:12,827 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 36 [2024-11-07 16:39:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:12,827 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2024-11-07 16:39:12,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2024-11-07 16:39:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 16:39:12,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:12,827 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] [2024-11-07 16:39:12,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 16:39:12,827 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:12,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash 449823514, now seen corresponding path program 1 times [2024-11-07 16:39:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:12,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204381911] [2024-11-07 16:39:12,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:12,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:13,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:13,311 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:13,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:13,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204381911] [2024-11-07 16:39:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204381911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:13,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361798392] [2024-11-07 16:39:13,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:13,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:13,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:13,313 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:13,314 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:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:13,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-07 16:39:13,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:13,519 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:39:13,561 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-07 16:39:13,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-07 16:39:13,622 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 15 treesize of output 1 [2024-11-07 16:39:13,651 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 23 [2024-11-07 16:39:13,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2024-11-07 16:39:13,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:13,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2024-11-07 16:39:13,963 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:13,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:14,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:14,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 449 treesize of output 409 [2024-11-07 16:39:17,270 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:17,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361798392] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:17,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:17,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [18, 15] total 40 [2024-11-07 16:39:17,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777833715] [2024-11-07 16:39:17,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:17,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:39:17,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:17,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:39:17,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 16:39:17,272 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 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:23,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:23,145 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2024-11-07 16:39:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:39:23,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 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 37 [2024-11-07 16:39:23,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:23,147 INFO L225 Difference]: With dead ends: 136 [2024-11-07 16:39:23,147 INFO L226 Difference]: Without dead ends: 136 [2024-11-07 16:39:23,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=169, Invalid=1993, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 16:39:23,148 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 26 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:23,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 452 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 16:39:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-07 16:39:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-07 16:39:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 131 states have internal predecessors, (144), 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:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2024-11-07 16:39:23,151 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 37 [2024-11-07 16:39:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:23,151 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2024-11-07 16:39:23,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 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:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2024-11-07 16:39:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 16:39:23,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:23,152 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] [2024-11-07 16:39:23,168 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:23,355 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:23,356 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:23,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash 970674154, now seen corresponding path program 1 times [2024-11-07 16:39:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:23,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812206573] [2024-11-07 16:39:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:23,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:23,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:23,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 16:39:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:23,566 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:23,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:23,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812206573] [2024-11-07 16:39:23,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812206573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:23,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600489970] [2024-11-07 16:39:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:23,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:23,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:23,569 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:23,570 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,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:23,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-07 16:39:23,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:23,843 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:23,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:23,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-07 16:39:23,865 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:23,865 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,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-07 16:39:23,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:24,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600489970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:24,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:24,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2024-11-07 16:39:24,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721602806] [2024-11-07 16:39:24,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:24,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 16:39:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:24,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 16:39:24,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=535, Unknown=1, NotChecked=46, Total=650 [2024-11-07 16:39:24,172 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 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:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:24,589 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2024-11-07 16:39:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 16:39:24,589 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 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:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:24,590 INFO L225 Difference]: With dead ends: 169 [2024-11-07 16:39:24,590 INFO L226 Difference]: Without dead ends: 169 [2024-11-07 16:39:24,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=995, Unknown=3, NotChecked=64, Total=1190 [2024-11-07 16:39:24,591 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 60 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:24,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 838 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 603 Invalid, 0 Unknown, 133 Unchecked, 0.3s Time] [2024-11-07 16:39:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-07 16:39:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2024-11-07 16:39:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.353846153846154) internal successors, (176), 155 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:39:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2024-11-07 16:39:24,595 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 39 [2024-11-07 16:39:24,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:24,595 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2024-11-07 16:39:24,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 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:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2024-11-07 16:39:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 16:39:24,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:24,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:24,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-07 16:39:24,797 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:24,797 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:24,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:24,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1511295107, now seen corresponding path program 1 times [2024-11-07 16:39:24,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:24,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869300388] [2024-11-07 16:39:24,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:24,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:25,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:25,199 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:25,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:25,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869300388] [2024-11-07 16:39:25,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869300388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:25,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:25,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 16:39:25,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912742863] [2024-11-07 16:39:25,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:25,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 16:39:25,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:25,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 16:39:25,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:39:25,201 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:25,468 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2024-11-07 16:39:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 16:39:25,468 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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 39 [2024-11-07 16:39:25,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:25,469 INFO L225 Difference]: With dead ends: 161 [2024-11-07 16:39:25,469 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 16:39:25,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-07 16:39:25,470 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 44 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:25,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 560 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:25,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 16:39:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-07 16:39:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 155 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:39:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2024-11-07 16:39:25,473 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 39 [2024-11-07 16:39:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:25,473 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2024-11-07 16:39:25,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2024-11-07 16:39:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:39:25,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:25,474 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, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:25,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 16:39:25,474 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:25,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash -173419745, now seen corresponding path program 1 times [2024-11-07 16:39:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:25,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386297062] [2024-11-07 16:39:25,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:25,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:25,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 16:39:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:25,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 16:39:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:25,867 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:25,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:25,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386297062] [2024-11-07 16:39:25,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386297062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:25,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254285175] [2024-11-07 16:39:25,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:25,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:25,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:25,870 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,873 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,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:26,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 16:39:26,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:26,085 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:26,085 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,098 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,135 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:39:26,135 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:26,173 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:39:26,173 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:26,189 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,203 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-07 16:39:26,231 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-07 16:39:26,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-07 16:39:26,234 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:26,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:26,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254285175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:26,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:26,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2024-11-07 16:39:26,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298635541] [2024-11-07 16:39:26,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:26,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 16:39:26,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:26,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 16:39:26,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2024-11-07 16:39:26,284 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 16:39:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:26,576 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2024-11-07 16:39:26,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 16:39:26,576 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-07 16:39:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:26,577 INFO L225 Difference]: With dead ends: 159 [2024-11-07 16:39:26,577 INFO L226 Difference]: Without dead ends: 159 [2024-11-07 16:39:26,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=652, Unknown=1, NotChecked=52, Total=812 [2024-11-07 16:39:26,577 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 13 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:26,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 560 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 392 Invalid, 0 Unknown, 78 Unchecked, 0.2s Time] [2024-11-07 16:39:26,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-07 16:39:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-07 16:39:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 130 states have (on average 1.3153846153846154) internal successors, (171), 153 states have internal predecessors, (171), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:39:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 179 transitions. [2024-11-07 16:39:26,582 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 179 transitions. Word has length 42 [2024-11-07 16:39:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:26,583 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 179 transitions. [2024-11-07 16:39:26,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 16:39:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2024-11-07 16:39:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:39:26,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:26,583 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, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:26,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-07 16:39:26,783 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,SelfDestructingSolverStorable31 [2024-11-07 16:39:26,784 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:26,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:26,784 INFO L85 PathProgramCache]: Analyzing trace with hash -173419744, now seen corresponding path program 1 times [2024-11-07 16:39:26,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:26,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152995347] [2024-11-07 16:39:26,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:26,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:27,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:27,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 16:39:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:27,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 16:39:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:39:27,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:27,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152995347] [2024-11-07 16:39:27,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152995347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:27,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709049183] [2024-11-07 16:39:27,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:27,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:27,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:27,312 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:27,314 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:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:27,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-07 16:39:27,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:27,530 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:27,584 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:27,584 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:27,606 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:27,611 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:27,672 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:39:27,672 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:27,675 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:27,756 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:39:27,756 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:27,764 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:27,785 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:27,792 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:27,871 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:27,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:27,885 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:27,890 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:27,890 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:27,912 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:27,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:27,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709049183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:27,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:27,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2024-11-07 16:39:27,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101159586] [2024-11-07 16:39:27,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:27,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 16:39:27,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:27,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 16:39:27,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=732, Unknown=1, NotChecked=54, Total=870 [2024-11-07 16:39:27,994 INFO L87 Difference]: Start difference. First operand 159 states and 179 transitions. Second operand has 28 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:39:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:28,657 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2024-11-07 16:39:28,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 16:39:28,658 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2024-11-07 16:39:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:28,658 INFO L225 Difference]: With dead ends: 155 [2024-11-07 16:39:28,658 INFO L226 Difference]: Without dead ends: 155 [2024-11-07 16:39:28,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=1512, Unknown=1, NotChecked=80, Total=1806 [2024-11-07 16:39:28,659 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 35 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:28,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 831 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 673 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2024-11-07 16:39:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-07 16:39:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-07 16:39:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 149 states have internal predecessors, (163), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:39:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2024-11-07 16:39:28,662 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 42 [2024-11-07 16:39:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:28,662 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2024-11-07 16:39:28,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:39:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2024-11-07 16:39:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:39:28,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:28,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:28,681 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:28,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:28,863 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:28,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1149725730, now seen corresponding path program 1 times [2024-11-07 16:39:28,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:28,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222492106] [2024-11-07 16:39:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:28,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:28,992 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:28,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:28,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222492106] [2024-11-07 16:39:28,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222492106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:28,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:28,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:39:28,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364279388] [2024-11-07 16:39:28,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:28,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:39:28,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:28,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:39:28,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:39:28,993 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 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:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:29,173 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2024-11-07 16:39:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:39:29,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 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 42 [2024-11-07 16:39:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:29,174 INFO L225 Difference]: With dead ends: 160 [2024-11-07 16:39:29,174 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 16:39:29,175 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:29,176 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 24 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:29,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 389 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:29,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 16:39:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2024-11-07 16:39:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 153 states have internal predecessors, (170), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:39:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 178 transitions. [2024-11-07 16:39:29,179 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 178 transitions. Word has length 42 [2024-11-07 16:39:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:29,180 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 178 transitions. [2024-11-07 16:39:29,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 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:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 178 transitions. [2024-11-07 16:39:29,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 16:39:29,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:29,181 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:29,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 16:39:29,181 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:29,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash -884803614, now seen corresponding path program 1 times [2024-11-07 16:39:29,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:29,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176049402] [2024-11-07 16:39:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:29,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:29,954 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:29,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176049402] [2024-11-07 16:39:29,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176049402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429918266] [2024-11-07 16:39:29,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:29,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:29,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:29,957 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,959 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:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:30,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-07 16:39:30,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:30,147 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:39:30,167 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,171 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,198 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:30,198 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,220 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,223 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,241 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:30,287 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:39:30,287 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-07 16:39:30,306 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:39:30,307 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-07 16:39:30,391 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 42 treesize of output 30 [2024-11-07 16:39:30,396 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 42 treesize of output 30 [2024-11-07 16:39:30,465 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 42 treesize of output 30 [2024-11-07 16:39:30,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:30,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2024-11-07 16:39:30,669 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:30,669 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,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:30,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:30,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 19 [2024-11-07 16:39:30,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:30,860 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 17 treesize of output 15 [2024-11-07 16:39:30,931 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:30,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:31,436 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:31,455 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_~data2~0#1.base_17| Int)) (or (= |c_ULTIMATE.start_create_~sll~0#1.base| |v_ULTIMATE.start_create_~data2~0#1.base_17|) (forall ((v_ArrVal_2276 Int) (v_ArrVal_2272 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_~data2~0#1.base_17| v_ArrVal_2272))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |c_ULTIMATE.start_create_~data1~0#1.base|) .cse1 v_ArrVal_2276))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0)))) (or (< 0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 20)) (and (forall ((|v_ULTIMATE.start_create_~data2~0#1.base_17| Int) (v_ArrVal_2273 Int) (v_ArrVal_2278 Int) (v_ArrVal_2271 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_create_~data2~0#1.base_17| v_ArrVal_2271))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_2273) .cse1 v_ArrVal_2278))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0)) (forall ((|v_ULTIMATE.start_create_~data2~0#1.base_17| Int) (v_ArrVal_2276 Int) (v_ArrVal_2272 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_~data2~0#1.base_17| v_ArrVal_2272))) (store .cse3 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |c_ULTIMATE.start_create_~data1~0#1.base|) .cse1 v_ArrVal_2276))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0)))) (forall ((|v_ULTIMATE.start_create_~data2~0#1.base_17| Int)) (or (forall ((v_ArrVal_2273 Int) (v_ArrVal_2278 Int) (v_ArrVal_2271 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_create_~data2~0#1.base_17| v_ArrVal_2271))) (store .cse4 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_2273) .cse1 v_ArrVal_2278))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0)) (= |c_ULTIMATE.start_create_~sll~0#1.base| |v_ULTIMATE.start_create_~data2~0#1.base_17|))))) is different from false [2024-11-07 16:39:32,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:32,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-07 16:39:32,220 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,221 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 48 treesize of output 44 [2024-11-07 16:39:32,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:32,233 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 66 treesize of output 68 [2024-11-07 16:39:32,241 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 56 treesize of output 54 [2024-11-07 16:39:32,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:32,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-07 16:39:32,280 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,281 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 48 treesize of output 44 [2024-11-07 16:39:32,294 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:39:32,294 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 124 treesize of output 119 [2024-11-07 16:39:32,301 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 56 treesize of output 54 [2024-11-07 16:39:32,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:32,322 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 31 treesize of output 32 [2024-11-07 16:39:32,323 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,325 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:32,329 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,330 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,331 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:32,333 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,333 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,337 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2024-11-07 16:39:32,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:32,343 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 31 treesize of output 32 [2024-11-07 16:39:32,344 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,346 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:32,347 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,350 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2024-11-07 16:39:32,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:32,354 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:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:39:32,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429918266] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:39:32,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:39:32,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 48 [2024-11-07 16:39:32,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286857220] [2024-11-07 16:39:32,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:32,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-07 16:39:32,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:32,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-07 16:39:32,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1953, Unknown=48, NotChecked=90, Total=2256 [2024-11-07 16:39:32,429 INFO L87 Difference]: Start difference. First operand 159 states and 178 transitions. Second operand has 48 states, 48 states have (on average 2.375) internal successors, (114), 45 states have internal predecessors, (114), 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:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:33,708 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2024-11-07 16:39:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 16:39:33,708 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.375) internal successors, (114), 45 states have internal predecessors, (114), 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 45 [2024-11-07 16:39:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:33,709 INFO L225 Difference]: With dead ends: 162 [2024-11-07 16:39:33,709 INFO L226 Difference]: Without dead ends: 162 [2024-11-07 16:39:33,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=266, Invalid=2872, Unknown=58, NotChecked=110, Total=3306 [2024-11-07 16:39:33,710 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 36 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:33,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1136 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1137 Invalid, 0 Unknown, 60 Unchecked, 0.8s Time] [2024-11-07 16:39:33,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-07 16:39:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-07 16:39:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 156 states have internal predecessors, (173), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:39:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 181 transitions. [2024-11-07 16:39:33,714 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 181 transitions. Word has length 45 [2024-11-07 16:39:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:33,714 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 181 transitions. [2024-11-07 16:39:33,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.375) internal successors, (114), 45 states have internal predecessors, (114), 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:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 181 transitions. [2024-11-07 16:39:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-07 16:39:33,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:33,715 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:33,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-07 16:39:33,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:33,916 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:33,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:33,916 INFO L85 PathProgramCache]: Analyzing trace with hash -361567797, now seen corresponding path program 1 times [2024-11-07 16:39:33,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:33,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373220041] [2024-11-07 16:39:33,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:34,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:34,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 16:39:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:34,556 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:34,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:34,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373220041] [2024-11-07 16:39:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373220041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:34,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983786120] [2024-11-07 16:39:34,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:34,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:34,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:34,559 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:34,561 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:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:34,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-07 16:39:34,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:34,843 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:34,843 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:34,873 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:34,945 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:39:34,945 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 31 treesize of output 32 [2024-11-07 16:39:34,978 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:39:34,979 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:35,065 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:35,068 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:35,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:35,170 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-07 16:39:35,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 16:39:35,212 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2426 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2426) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))))) is different from false [2024-11-07 16:39:35,267 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2426 (Array Int Int)) (v_ArrVal_2425 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2425))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2426) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))))))) is different from false [2024-11-07 16:39:35,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:35,279 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 63 treesize of output 44 [2024-11-07 16:39:35,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:35,287 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 420 treesize of output 317 [2024-11-07 16:39:35,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:35,296 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 82 treesize of output 63 [2024-11-07 16:39:35,299 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 80 treesize of output 68 [2024-11-07 16:39:35,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983786120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:35,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:35,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 30 [2024-11-07 16:39:35,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12024803] [2024-11-07 16:39:35,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:35,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-07 16:39:35,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:35,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-07 16:39:35,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1185, Unknown=31, NotChecked=142, Total=1482 [2024-11-07 16:39:35,384 INFO L87 Difference]: Start difference. First operand 162 states and 181 transitions. Second operand has 31 states, 30 states have (on average 2.533333333333333) internal successors, (76), 26 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:39:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:35,994 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2024-11-07 16:39:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:39:35,995 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.533333333333333) internal successors, (76), 26 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2024-11-07 16:39:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:35,995 INFO L225 Difference]: With dead ends: 165 [2024-11-07 16:39:35,996 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 16:39:35,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=1923, Unknown=34, NotChecked=182, Total=2352 [2024-11-07 16:39:35,997 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:35,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1111 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:39:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 16:39:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-07 16:39:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 140 states have (on average 1.2714285714285714) internal successors, (178), 159 states have internal predecessors, (178), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:39:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2024-11-07 16:39:36,003 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 46 [2024-11-07 16:39:36,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:36,003 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2024-11-07 16:39:36,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.533333333333333) internal successors, (76), 26 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:39:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2024-11-07 16:39:36,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-07 16:39:36,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:36,005 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:36,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-07 16:39:36,205 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,SelfDestructingSolverStorable35 [2024-11-07 16:39:36,206 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:36,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:36,207 INFO L85 PathProgramCache]: Analyzing trace with hash -361567796, now seen corresponding path program 1 times [2024-11-07 16:39:36,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:36,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525049744] [2024-11-07 16:39:36,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:36,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:36,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:36,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 16:39:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:39:36,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:36,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525049744] [2024-11-07 16:39:36,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525049744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:36,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657881622] [2024-11-07 16:39:36,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:36,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:36,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:36,926 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:36,927 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:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:37,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-07 16:39:37,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:37,194 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:37,249 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:39:37,249 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:37,278 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:37,281 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:37,365 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:39:37,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 16:39:37,369 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:37,417 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:39:37,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 16:39:37,421 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:37,536 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:37,539 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:37,545 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:37,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:37,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_2574 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0))) (forall ((v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2573 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2573) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0)))))) is different from false [2024-11-07 16:39:37,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_2574 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))) (forall ((v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2573 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2573) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))))) is different from false [2024-11-07 16:39:37,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2571))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2572) .cse0 v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2573) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2572 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2572) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2571) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))))) is different from false [2024-11-07 16:39:37,749 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2572 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2572) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2571) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))) (forall ((v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2571))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2572) .cse3 v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2573) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))))))))) is different from false [2024-11-07 16:39:37,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:37,759 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 44 treesize of output 45 [2024-11-07 16:39:37,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:37,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-07 16:39:37,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2024-11-07 16:39:37,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:37,772 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 122 treesize of output 115 [2024-11-07 16:39:37,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2024-11-07 16:39:37,778 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 84 treesize of output 72 [2024-11-07 16:39:37,781 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 50 treesize of output 46 [2024-11-07 16:39:37,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:37,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-07 16:39:37,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:37,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-07 16:39:37,829 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:37,829 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:37,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:37,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2024-11-07 16:39:37,834 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:37,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:37,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2024-11-07 16:39:37,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657881622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:37,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:37,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2024-11-07 16:39:37,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293176804] [2024-11-07 16:39:37,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:37,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-07 16:39:37,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:37,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-07 16:39:37,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1349, Unknown=4, NotChecked=308, Total=1806 [2024-11-07 16:39:37,936 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 27 states have internal predecessors, (79), 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:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:38,624 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2024-11-07 16:39:38,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 16:39:38,624 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 27 states have internal predecessors, (79), 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 46 [2024-11-07 16:39:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:38,625 INFO L225 Difference]: With dead ends: 169 [2024-11-07 16:39:38,625 INFO L226 Difference]: Without dead ends: 169 [2024-11-07 16:39:38,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=218, Invalid=1864, Unknown=4, NotChecked=364, Total=2450 [2024-11-07 16:39:38,626 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 27 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:38,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1073 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 16:39:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-07 16:39:38,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-07 16:39:38,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 144 states have (on average 1.2569444444444444) internal successors, (181), 163 states have internal predecessors, (181), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:39:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 189 transitions. [2024-11-07 16:39:38,629 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 189 transitions. Word has length 46 [2024-11-07 16:39:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:38,629 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 189 transitions. [2024-11-07 16:39:38,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 27 states have internal predecessors, (79), 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:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 189 transitions. [2024-11-07 16:39:38,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-07 16:39:38,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:38,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:38,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-07 16:39:38,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-07 16:39:38,830 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:39:38,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:38,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1659109671, now seen corresponding path program 1 times [2024-11-07 16:39:38,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:38,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564273303] [2024-11-07 16:39:38,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:38,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:39,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:39:40,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:40,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564273303] [2024-11-07 16:39:40,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564273303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:40,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738326429] [2024-11-07 16:39:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:40,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:40,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:40,079 INFO L229 MonitoredProcess]: Starting monitored process 17 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:40,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-07 16:39:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:40,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-07 16:39:40,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:40,969 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:41,203 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 458 treesize of output 342 [2024-11-07 16:39:44,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:44,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:44,230 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 1632 treesize of output 818 [2024-11-07 16:40:08,440 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse5 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| 1))) (let ((.cse10 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int)) (let ((.cse76 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (let ((.cse75 (store .cse76 v_arrayElimCell_132 0))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse75 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse75 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= 0 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse76 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 v_prenex_14) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|))))))) (.cse27 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int)) (let ((.cse72 (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)))) (let ((.cse74 (store (store .cse72 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (= |c_#valid| (store (store .cse72 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (let ((.cse73 (store (store .cse5 v_arrayElimCell_134 (select .cse74 v_arrayElimCell_134)) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse73 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse73 v_arrayElimCell_134))) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select .cse74 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))))) (.cse13 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_7 Int)) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select (let ((.cse71 (store (store .cse5 v_arrayElimCell_132 v_DerPreprocessor_7) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse71 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 (select .cse71 v_arrayElimCell_132))) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0)))) (.cse7 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (.cse16 (not (= |c_ULTIMATE.start_destroy_~l#1.base| 0))) (.cse1 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 16))) (.cse37 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 0)))) (or (and (let ((.cse0 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_135 Int)) (let ((.cse36 (store .cse5 v_arrayElimCell_135 0))) (and (= (select .cse36 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse36 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse36 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))))) (or .cse0 (and .cse1 (or (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1)) (.cse6 (select |c_#valid| v_arrayElimCell_135))) (let ((.cse2 (store (store .cse4 v_arrayElimCell_135 .cse6) v_arrayElimCell_132 0))) (and (= (select .cse2 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse3 (store .cse4 v_arrayElimCell_135 (select .cse2 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse3 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| (select .cse3 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|))) v_arrayElimCell_135) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_135 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= |c_#valid| (store (store (store .cse5 v_arrayElimCell_135 .cse6) v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_135 0)))))) .cse7 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse8 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse8 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= |c_#valid| (store .cse8 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0)) (= (select .cse8 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) .cse0 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse9 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse9 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_135 (select .cse9 v_arrayElimCell_135)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 v_prenex_14) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= |c_#valid| (store .cse9 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_135 0)) (= (select .cse9 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) .cse10 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int)) (let ((.cse11 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store .cse11 v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse11 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_14) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse12 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse12 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= |c_#valid| (store .cse12 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_135 (select .cse12 v_arrayElimCell_135)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_14) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0)) (= (select .cse12 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) .cse13 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse15 (store (store (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select (let ((.cse14 (store (store .cse5 v_arrayElimCell_134 (select .cse15 v_arrayElimCell_134)) v_arrayElimCell_135 (select .cse15 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse14 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse14 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (= (select .cse15 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse15 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse15 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_135 0))))) (and .cse16 (or (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_prenex_9 Int)) (let ((.cse17 (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| 1))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store .cse17 v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| (select .cse17 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse18 (store .cse5 v_arrayElimCell_132 0))) (and (= |c_#valid| (store .cse18 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse18 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select .cse18 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_11 Int) (v_DerPreprocessor_9 Int) (v_arrayElimCell_132 Int)) (let ((.cse19 (store .cse5 v_arrayElimCell_132 0))) (and (= |c_#valid| (store .cse19 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_132 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 v_DerPreprocessor_9) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select .cse19 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int) (v_prenex_9 Int)) (let ((.cse20 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) v_arrayElimCell_134 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select .cse20 v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select .cse20 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (= |c_#valid| (store .cse20 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse20 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse21 (store .cse5 v_arrayElimCell_132 0))) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store .cse21 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select .cse21 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select .cse21 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_DerPreprocessor_7 Int)) (let ((.cse22 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse22 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= |c_#valid| (store .cse22 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (let ((.cse23 (store (store .cse5 v_arrayElimCell_132 v_DerPreprocessor_7) v_arrayElimCell_135 (select .cse22 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse23 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 (select .cse23 v_arrayElimCell_132))) v_arrayElimCell_135) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_135 0)) (= (select .cse22 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (exists ((v_prenex_7 Int) (|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int) (v_DerPreprocessor_5 Int)) (let ((.cse24 (store .cse5 v_arrayElimCell_135 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select .cse24 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse24 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse24 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_135 v_DerPreprocessor_5) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_7) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int)) (let ((.cse25 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_135 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store .cse25 v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse26 (store .cse25 v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse26 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| (select .cse26 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|))) v_arrayElimCell_135) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_135 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)))) .cse27 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse28 (store (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_132 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= (select .cse28 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select .cse28 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (= |c_#valid| (store .cse28 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (let ((.cse29 (store (store .cse5 v_arrayElimCell_134 (select .cse28 v_arrayElimCell_134)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse29 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse29 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse30 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse30 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select .cse30 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse30 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_135 0))))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int)) (let ((.cse32 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (let ((.cse33 (store .cse32 v_arrayElimCell_135 0))) (and (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (let ((.cse31 (store .cse32 v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse31 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| (select .cse31 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|))) v_arrayElimCell_135) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_135 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse33 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select .cse33 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_135 0)))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse35 (store (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_135 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= (select (let ((.cse34 (store (store .cse5 v_arrayElimCell_134 (select .cse35 v_arrayElimCell_134)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse34 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse34 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select .cse35 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse35 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_135 0)) (= (select .cse35 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))))) .cse37) (and (or .cse10 (and .cse37 (or .cse13 .cse27)) .cse13 (and (or .cse7 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse38 (store (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 0))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select .cse38 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse38 |c_ULTIMATE.start_destroy_~l#1.base|) 1))))) .cse37) (and .cse16 (let ((.cse39 (exists ((v_prenex_11 Int) (v_DerPreprocessor_9 Int) (v_arrayElimCell_132 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_132 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 v_DerPreprocessor_9) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0))))) (or .cse39 (and (or (exists ((v_arrayElimCell_132 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store .cse5 v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1))) .cse39 (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int) (v_prenex_9 Int)) (let ((.cse41 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)))) (let ((.cse40 (store (store .cse41 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) v_arrayElimCell_134 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select .cse40 v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= |c_#valid| (store (store .cse41 v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (= (select .cse40 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))))) .cse37)))) (and .cse37 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int)) (let ((.cse43 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (let ((.cse42 (store .cse43 v_arrayElimCell_132 0))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select .cse42 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse42 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse43 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_14) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0))))))) .cse1) (and (let ((.cse46 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse65 (exists ((v_arrayElimCell_135 Int)) (let ((.cse70 (store .cse5 v_arrayElimCell_135 0))) (and (= |c_#valid| (store .cse70 0 0)) (= (select .cse70 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))))) (or (and (exists ((v_DerPreprocessor_25 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int)) (let ((.cse44 (store (store .cse5 0 v_DerPreprocessor_25) v_arrayElimCell_135 0))) (and (= (select .cse44 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse45 (store (store .cse5 0 (select .cse44 0)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse45 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse45 0))) v_arrayElimCell_135) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_135 0) 0 0)) (not (= v_arrayElimCell_135 0))))) .cse46 .cse16) (and (or (exists ((v_arrayElimCell_132 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse47 (store (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_132 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= (select .cse47 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse47 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (not (= v_arrayElimCell_134 0)) (= (select (let ((.cse48 (store (store .cse5 v_arrayElimCell_134 (select .cse47 v_arrayElimCell_134)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse48 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse48 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse49 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse49 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse49 0 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse50 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= |c_#valid| (store .cse50 0 0)) (= (select .cse50 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((v_prenex_7 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int) (v_DerPreprocessor_5 Int)) (let ((.cse51 (store .cse5 v_arrayElimCell_135 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= |c_#valid| (store .cse51 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select .cse51 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_135 v_DerPreprocessor_5) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_7) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (exists ((v_arrayElimCell_132 Int)) (let ((.cse52 (store .cse5 v_arrayElimCell_132 0))) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store .cse52 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select .cse52 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (and .cse16 (or (and .cse46 (exists ((v_DerPreprocessor_23 Int) (v_arrayElimCell_132 Int) (v_prenex_9 Int)) (let ((.cse53 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_23) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132 0))) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) 0 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select .cse53 0)) |c_ULTIMATE.start_destroy_~l#1.base| 1) 0)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select .cse53 |c_ULTIMATE.start_destroy_~l#1.base|) 1))))) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int) (v_prenex_9 Int)) (let ((.cse54 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) v_arrayElimCell_134 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select .cse54 v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= |c_#valid| (store .cse54 0 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (not (= v_arrayElimCell_134 0)) (= (select .cse54 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((v_prenex_11 Int) (v_DerPreprocessor_9 Int) (v_arrayElimCell_132 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_132 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 v_DerPreprocessor_9) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0))) (exists ((v_arrayElimCell_132 Int)) (let ((.cse55 (store .cse5 v_arrayElimCell_132 0))) (and (= |c_#valid| (store .cse55 0 0)) (= (select .cse55 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))))) (exists ((v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse56 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse56 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse56 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_135 (select .cse56 v_arrayElimCell_135)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 v_prenex_14) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_135 0))))) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_DerPreprocessor_7 Int)) (let ((.cse57 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse57 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse57 0 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= (select (let ((.cse58 (store (store .cse5 v_arrayElimCell_132 v_DerPreprocessor_7) v_arrayElimCell_135 (select .cse57 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse58 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 (select .cse58 v_arrayElimCell_132))) v_arrayElimCell_135) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_135 0))))) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse60 (store (store (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select (let ((.cse59 (store (store .cse5 v_arrayElimCell_134 (select .cse60 v_arrayElimCell_134)) v_arrayElimCell_135 (select .cse60 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse59 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse59 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= |c_#valid| (store .cse60 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (not (= v_arrayElimCell_134 0)) (= (select .cse60 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_135 0))))) (exists ((v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse61 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse61 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse61 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_135 (select .cse61 v_arrayElimCell_135)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_14) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (and .cse46 (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_DerPreprocessor_19 Int)) (let ((.cse62 (select |c_#valid| v_arrayElimCell_135))) (let ((.cse63 (store (store (store .cse5 0 v_DerPreprocessor_19) v_arrayElimCell_135 .cse62) v_arrayElimCell_132 0))) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store (store .cse5 v_arrayElimCell_135 .cse62) v_arrayElimCell_132 0) 0 0)) (= (select .cse63 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= (select (let ((.cse64 (store (store .cse5 0 (select .cse63 0)) v_arrayElimCell_135 (select .cse63 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse64 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse64 0))) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0)))))) .cse16) .cse65 (and .cse46 (exists ((v_DerPreprocessor_24 Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int)) (let ((.cse67 (store (store .cse5 0 v_DerPreprocessor_24) v_arrayElimCell_132 0))) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (= (select (let ((.cse66 (store (store .cse5 0 (select .cse67 0)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse66 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse66 0))) v_arrayElimCell_135) 0) (= (select .cse67 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_135 0))))) .cse16)) .cse1) (exists ((v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse69 (store (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_135 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= (select (let ((.cse68 (store (store .cse5 v_arrayElimCell_134 (select .cse69 v_arrayElimCell_134)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse68 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse68 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select .cse69 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_134 0)) (not (= v_arrayElimCell_135 0)) (= |c_#valid| (store .cse69 0 0))))) .cse65)) .cse37)))) (<= 0 |c_ULTIMATE.start_destroy_~l#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base|) 0)) is different from false