./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.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-nested-sll-twice.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', 'f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057'] 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-nested-sll-twice.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 f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:38:52,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:38:52,574 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:52,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:38:52,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:38:52,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:38:52,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:38:52,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:38:52,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:38:52,597 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:38:52,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:38:52,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:38:52,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:38:52,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:38:52,598 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:38:52,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:38:52,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:38:52,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:38:52,598 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:38:52,598 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:38:52,598 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:38:52,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:38:52,598 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:38:52,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:38:52,599 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:38:52,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:38:52,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:38:52,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:38:52,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:38:52,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:38:52,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:38:52,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:38:52,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:38:52,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:38:52,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:38:52,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:38:52,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:38:52,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:38:52,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:38:52,601 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 -> f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 [2024-11-07 16:38:52,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:38:52,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:38:52,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:38:52,831 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:38:52,831 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:38:52,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i [2024-11-07 16:38:53,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:38:54,182 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:38:54,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i [2024-11-07 16:38:54,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/817dde4db/bde0079258df49a09f3c9316c185bd24/FLAGfa6d16d08 [2024-11-07 16:38:54,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/817dde4db/bde0079258df49a09f3c9316c185bd24 [2024-11-07 16:38:54,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:38:54,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:38:54,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:38:54,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:38:54,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:38:54,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:38:54" (1/1) ... [2024-11-07 16:38:54,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ecb61cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:54, skipping insertion in model container [2024-11-07 16:38:54,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:38:54" (1/1) ... [2024-11-07 16:38:54,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:38:54,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:38:54,759 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:38:54,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:38:54,819 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:38:54,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:54 WrapperNode [2024-11-07 16:38:54,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:38:54,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:38:54,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:38:54,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:38:54,825 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:54" (1/1) ... [2024-11-07 16:38:54,834 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:54" (1/1) ... [2024-11-07 16:38:54,845 INFO L138 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 81 [2024-11-07 16:38:54,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:38:54,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:38:54,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:38:54,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:38:54,852 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:54" (1/1) ... [2024-11-07 16:38:54,852 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:54" (1/1) ... [2024-11-07 16:38:54,854 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:54" (1/1) ... [2024-11-07 16:38:54,866 INFO L175 MemorySlicer]: Split 22 memory accesses to 1 slices as follows [22]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 10 writes are split as follows [10]. [2024-11-07 16:38:54,866 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:54" (1/1) ... [2024-11-07 16:38:54,866 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:54" (1/1) ... [2024-11-07 16:38:54,873 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:54" (1/1) ... [2024-11-07 16:38:54,879 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:54" (1/1) ... [2024-11-07 16:38:54,879 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:54" (1/1) ... [2024-11-07 16:38:54,880 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:54" (1/1) ... [2024-11-07 16:38:54,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:38:54,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:38:54,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:38:54,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:38:54,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:54" (1/1) ... [2024-11-07 16:38:54,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:38:54,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:38:54,908 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:54,912 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:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure loop_internal [2024-11-07 16:38:54,926 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_internal [2024-11-07 16:38:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2024-11-07 16:38:54,926 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2024-11-07 16:38:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2024-11-07 16:38:54,926 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2024-11-07 16:38:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-07 16:38:54,926 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-07 16:38:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:38:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:38:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_internal [2024-11-07 16:38:54,927 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_internal [2024-11-07 16:38:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:38:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:38:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:38:54,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:38:55,005 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:38:55,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:38:55,309 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-07 16:38:55,309 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:38:55,322 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:38:55,323 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-07 16:38:55,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:38:55 BoogieIcfgContainer [2024-11-07 16:38:55,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:38:55,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:38:55,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:38:55,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:38:55,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:38:54" (1/3) ... [2024-11-07 16:38:55,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:38:55, skipping insertion in model container [2024-11-07 16:38:55,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:54" (2/3) ... [2024-11-07 16:38:55,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:38:55, skipping insertion in model container [2024-11-07 16:38:55,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:38:55" (3/3) ... [2024-11-07 16:38:55,332 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-nested-sll-twice.i [2024-11-07 16:38:55,341 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:38:55,342 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2024-11-07 16:38:55,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:38:55,380 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;@654cc9b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:38:55,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-07 16:38:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 125 states have internal predecessors, (137), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 16:38:55,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:38:55,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:55,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:38:55,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:38:55,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:55,390 INFO L85 PathProgramCache]: Analyzing trace with hash 57486637, now seen corresponding path program 1 times [2024-11-07 16:38:55,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:55,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017924568] [2024-11-07 16:38:55,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:55,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:55,514 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,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:55,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017924568] [2024-11-07 16:38:55,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017924568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:55,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:55,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:38:55,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140597114] [2024-11-07 16:38:55,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:55,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:38:55,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:55,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:38:55,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:38:55,541 INFO L87 Difference]: Start difference. First operand has 143 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 125 states have internal predecessors, (137), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:55,641 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2024-11-07 16:38:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:38:55,643 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:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:55,647 INFO L225 Difference]: With dead ends: 140 [2024-11-07 16:38:55,648 INFO L226 Difference]: Without dead ends: 138 [2024-11-07 16:38:55,649 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:55,651 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:55,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 242 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-07 16:38:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-07 16:38:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 73 states have (on average 1.726027397260274) internal successors, (126), 120 states have internal predecessors, (126), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 16:38:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2024-11-07 16:38:55,688 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 5 [2024-11-07 16:38:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:55,688 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2024-11-07 16:38:55,688 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:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2024-11-07 16:38:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:38:55,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:55,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:38:55,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:38:55,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:38:55,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash 57486638, now seen corresponding path program 1 times [2024-11-07 16:38:55,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:55,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219717623] [2024-11-07 16:38:55,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:55,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:55,757 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,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:55,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219717623] [2024-11-07 16:38:55,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219717623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:55,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:55,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:38:55,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715988597] [2024-11-07 16:38:55,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:55,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:38:55,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:55,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:38:55,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:38:55,780 INFO L87 Difference]: Start difference. First operand 138 states and 150 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:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:55,853 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2024-11-07 16:38:55,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:38:55,854 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:55,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:55,855 INFO L225 Difference]: With dead ends: 135 [2024-11-07 16:38:55,855 INFO L226 Difference]: Without dead ends: 135 [2024-11-07 16:38:55,855 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:55,855 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:55,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 246 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:55,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-07 16:38:55,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-07 16:38:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 117 states have internal predecessors, (123), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 16:38:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2024-11-07 16:38:55,862 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 5 [2024-11-07 16:38:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:55,862 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2024-11-07 16:38:55,862 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:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2024-11-07 16:38:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 16:38:55,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:55,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:55,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:38:55,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:38:55,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:55,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1628966071, now seen corresponding path program 1 times [2024-11-07 16:38:55,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:55,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435382779] [2024-11-07 16:38:55,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:55,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:55,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:55,977 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,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:55,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435382779] [2024-11-07 16:38:55,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435382779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:55,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:55,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:38:55,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749793171] [2024-11-07 16:38:55,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:55,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:38:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:55,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:38:55,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:38:55,979 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:38:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:56,134 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2024-11-07 16:38:56,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:38:56,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-07 16:38:56,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:56,136 INFO L225 Difference]: With dead ends: 147 [2024-11-07 16:38:56,136 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 16:38:56,136 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:56,140 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 22 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:56,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 239 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 16:38:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2024-11-07 16:38:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 116 states have internal predecessors, (122), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 16:38:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2024-11-07 16:38:56,153 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 15 [2024-11-07 16:38:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:56,153 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2024-11-07 16:38:56,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:38:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2024-11-07 16:38:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 16:38:56,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:56,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:56,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:38:56,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:38:56,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1628966072, now seen corresponding path program 1 times [2024-11-07 16:38:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:56,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110928419] [2024-11-07 16:38:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:56,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:56,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:56,249 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,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:56,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110928419] [2024-11-07 16:38:56,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110928419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:56,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:56,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:38:56,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235124577] [2024-11-07 16:38:56,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:56,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:38:56,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:56,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:38:56,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:38:56,250 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:38:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:56,403 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2024-11-07 16:38:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:38:56,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-07 16:38:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:56,404 INFO L225 Difference]: With dead ends: 146 [2024-11-07 16:38:56,404 INFO L226 Difference]: Without dead ends: 146 [2024-11-07 16:38:56,405 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:56,405 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 22 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:56,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 244 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:38:56,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-07 16:38:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2024-11-07 16:38:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 115 states have internal predecessors, (121), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 16:38:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2024-11-07 16:38:56,411 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 15 [2024-11-07 16:38:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:56,411 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2024-11-07 16:38:56,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:38:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2024-11-07 16:38:56,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:38:56,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:56,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:56,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:38:56,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:38:56,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:56,412 INFO L85 PathProgramCache]: Analyzing trace with hash -614116727, now seen corresponding path program 1 times [2024-11-07 16:38:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:56,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819538619] [2024-11-07 16:38:56,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:56,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:56,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:56,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:38:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:56,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:38:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:56,775 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,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:56,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819538619] [2024-11-07 16:38:56,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819538619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:56,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:56,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:38:56,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815335267] [2024-11-07 16:38:56,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:56,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:38:56,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:56,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:38:56,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:38:56,777 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:38:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:57,272 INFO L93 Difference]: Finished difference Result 169 states and 195 transitions. [2024-11-07 16:38:57,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:38:57,272 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), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-11-07 16:38:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:57,273 INFO L225 Difference]: With dead ends: 169 [2024-11-07 16:38:57,273 INFO L226 Difference]: Without dead ends: 169 [2024-11-07 16:38:57,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:38:57,274 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 51 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:57,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 488 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:38:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-07 16:38:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 149. [2024-11-07 16:38:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 88 states have (on average 1.6590909090909092) internal successors, (146), 126 states have internal predecessors, (146), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (17), 17 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-07 16:38:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 176 transitions. [2024-11-07 16:38:57,280 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 176 transitions. Word has length 25 [2024-11-07 16:38:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:57,280 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 176 transitions. [2024-11-07 16:38:57,280 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), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:38:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 176 transitions. [2024-11-07 16:38:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:38:57,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:57,281 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] [2024-11-07 16:38:57,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:38:57,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:38:57,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:57,282 INFO L85 PathProgramCache]: Analyzing trace with hash -614116726, now seen corresponding path program 1 times [2024-11-07 16:38:57,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:57,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273676463] [2024-11-07 16:38:57,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:57,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:57,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:57,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:38:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:57,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:38:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:57,674 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:57,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:57,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273676463] [2024-11-07 16:38:57,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273676463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:38:57,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:38:57,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:38:57,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778452381] [2024-11-07 16:38:57,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:38:57,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:38:57,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:57,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:38:57,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:38:57,676 INFO L87 Difference]: Start difference. First operand 149 states and 176 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:38:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:58,126 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2024-11-07 16:38:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:38:58,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-11-07 16:38:58,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:58,128 INFO L225 Difference]: With dead ends: 187 [2024-11-07 16:38:58,128 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 16:38:58,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:38:58,128 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 71 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:58,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 529 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:38:58,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 16:38:58,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 167. [2024-11-07 16:38:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 102 states have (on average 1.607843137254902) internal successors, (164), 140 states have internal predecessors, (164), 17 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (24), 21 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-07 16:38:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2024-11-07 16:38:58,140 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 25 [2024-11-07 16:38:58,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:58,140 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2024-11-07 16:38:58,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:38:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2024-11-07 16:38:58,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:38:58,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:58,141 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:58,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:38:58,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:38:58,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:58,142 INFO L85 PathProgramCache]: Analyzing trace with hash -687002123, now seen corresponding path program 1 times [2024-11-07 16:38:58,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:58,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891211204] [2024-11-07 16:38:58,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:58,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:58,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:58,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 16:38:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:58,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 16:38:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:38:58,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:58,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891211204] [2024-11-07 16:38:58,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891211204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:38:58,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641295103] [2024-11-07 16:38:58,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:58,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:38:58,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:38:58,312 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:58,314 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:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:58,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 16:38:58,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:38:58,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:38:58,460 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-07 16:38:58,492 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-07 16:38:58,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-07 16:38:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-07 16:38:58,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:38:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:38:58,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641295103] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:38:58,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:38:58,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-07 16:38:58,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430553372] [2024-11-07 16:38:58,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:38:58,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:38:58,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:58,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:38:58,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-07 16:38:58,609 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 16:38:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:38:58,993 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2024-11-07 16:38:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:38:58,994 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 28 [2024-11-07 16:38:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:38:58,995 INFO L225 Difference]: With dead ends: 181 [2024-11-07 16:38:58,995 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 16:38:58,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=188, Unknown=1, NotChecked=28, Total=272 [2024-11-07 16:38:58,995 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 93 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:38:58,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 477 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 509 Invalid, 0 Unknown, 167 Unchecked, 0.3s Time] [2024-11-07 16:38:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 16:38:59,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 168. [2024-11-07 16:38:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 103 states have (on average 1.6019417475728155) internal successors, (165), 140 states have internal predecessors, (165), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-07 16:38:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2024-11-07 16:38:59,011 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 28 [2024-11-07 16:38:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:38:59,011 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2024-11-07 16:38:59,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 16:38:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2024-11-07 16:38:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:38:59,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:38:59,012 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:38:59,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 16:38:59,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:38:59,217 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:38:59,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:38:59,217 INFO L85 PathProgramCache]: Analyzing trace with hash -687002122, now seen corresponding path program 1 times [2024-11-07 16:38:59,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:38:59,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769629681] [2024-11-07 16:38:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:59,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:38:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:59,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:38:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:59,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 16:38:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:59,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 16:38:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:59,478 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:59,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:38:59,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769629681] [2024-11-07 16:38:59,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769629681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:38:59,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257570720] [2024-11-07 16:38:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:38:59,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:38:59,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:38:59,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:38:59,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 16:38:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:38:59,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 16:38:59,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:38:59,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:38:59,626 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-11-07 16:38:59,644 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-07 16:38:59,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-07 16:38:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-07 16:38:59,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:38:59,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257570720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:38:59,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:38:59,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-11-07 16:38:59,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087708628] [2024-11-07 16:38:59,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:38:59,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 16:38:59,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:38:59,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 16:38:59,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=199, Unknown=1, NotChecked=28, Total=272 [2024-11-07 16:38:59,722 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 16:39:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:00,151 INFO L93 Difference]: Finished difference Result 183 states and 224 transitions. [2024-11-07 16:39:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 16:39:00,151 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-11-07 16:39:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:00,152 INFO L225 Difference]: With dead ends: 183 [2024-11-07 16:39:00,152 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 16:39:00,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2024-11-07 16:39:00,153 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 76 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:00,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 599 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 622 Invalid, 0 Unknown, 168 Unchecked, 0.3s Time] [2024-11-07 16:39:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 16:39:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2024-11-07 16:39:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 105 states have (on average 1.5809523809523809) internal successors, (166), 142 states have internal predecessors, (166), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-07 16:39:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2024-11-07 16:39:00,158 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 28 [2024-11-07 16:39:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:00,158 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2024-11-07 16:39:00,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 16:39:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2024-11-07 16:39:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 16:39:00,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:00,159 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] [2024-11-07 16:39:00,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 16:39:00,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:00,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:00,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:00,364 INFO L85 PathProgramCache]: Analyzing trace with hash -742476013, now seen corresponding path program 1 times [2024-11-07 16:39:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:00,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31515428] [2024-11-07 16:39:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:00,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:00,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:00,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:39:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:00,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:00,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:39:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:00,888 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:00,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:00,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31515428] [2024-11-07 16:39:00,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31515428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:00,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583177825] [2024-11-07 16:39:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:00,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:00,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:00,891 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:00,892 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:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:00,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 16:39:00,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:00,979 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:01,006 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-07 16:39:01,044 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-07 16:39:01,256 INFO L349 Elim1Store]: treesize reduction 104, result has 34.2 percent of original size [2024-11-07 16:39:01,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 104 [2024-11-07 16:39:01,437 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:01,443 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-07 16:39:01,443 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 3 case distinctions, treesize of input 22 treesize of output 12 [2024-11-07 16:39:01,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:01,501 INFO L349 Elim1Store]: treesize reduction 425, result has 0.2 percent of original size [2024-11-07 16:39:01,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 75 treesize of output 1 [2024-11-07 16:39:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-07 16:39:01,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583177825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:01,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:01,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2024-11-07 16:39:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013620605] [2024-11-07 16:39:01,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:01,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 16:39:01,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:01,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 16:39:01,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=222, Unknown=2, NotChecked=62, Total=342 [2024-11-07 16:39:01,672 INFO L87 Difference]: Start difference. First operand 170 states and 209 transitions. Second operand has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 6 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-07 16:39:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:02,505 INFO L93 Difference]: Finished difference Result 204 states and 257 transitions. [2024-11-07 16:39:02,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:39:02,505 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 6 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 37 [2024-11-07 16:39:02,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:02,507 INFO L225 Difference]: With dead ends: 204 [2024-11-07 16:39:02,507 INFO L226 Difference]: Without dead ends: 204 [2024-11-07 16:39:02,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=309, Unknown=2, NotChecked=74, Total=462 [2024-11-07 16:39:02,508 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 99 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 406 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:02,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 633 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1004 Invalid, 0 Unknown, 406 Unchecked, 0.7s Time] [2024-11-07 16:39:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-07 16:39:02,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 177. [2024-11-07 16:39:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 111 states have (on average 1.5675675675675675) internal successors, (174), 148 states have internal predecessors, (174), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 23 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-07 16:39:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 224 transitions. [2024-11-07 16:39:02,517 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 224 transitions. Word has length 37 [2024-11-07 16:39:02,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:02,517 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 224 transitions. [2024-11-07 16:39:02,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 6 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-07 16:39:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 224 transitions. [2024-11-07 16:39:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 16:39:02,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:02,518 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] [2024-11-07 16:39:02,531 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:02,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:02,723 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:02,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:02,723 INFO L85 PathProgramCache]: Analyzing trace with hash -742476012, now seen corresponding path program 1 times [2024-11-07 16:39:02,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:02,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281820541] [2024-11-07 16:39:02,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:02,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:02,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:39:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:03,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:03,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:39:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:03,316 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:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281820541] [2024-11-07 16:39:03,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281820541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051981294] [2024-11-07 16:39:03,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:03,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:03,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:03,319 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:03,320 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:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:03,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-07 16:39:03,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:03,407 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:03,410 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:03,639 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-07 16:39:03,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:03,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:03,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 9 [2024-11-07 16:39:03,778 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-07 16:39:03,778 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:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-07 16:39:03,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:03,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051981294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:03,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:03,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2024-11-07 16:39:03,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205037514] [2024-11-07 16:39:03,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:03,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 16:39:03,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:03,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 16:39:03,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=649, Unknown=1, NotChecked=52, Total=812 [2024-11-07 16:39:03,960 INFO L87 Difference]: Start difference. First operand 177 states and 224 transitions. Second operand has 27 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 states have internal predecessors, (56), 7 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-07 16:39:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:04,706 INFO L93 Difference]: Finished difference Result 226 states and 286 transitions. [2024-11-07 16:39:04,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 16:39:04,706 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 states have internal predecessors, (56), 7 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 37 [2024-11-07 16:39:04,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:04,708 INFO L225 Difference]: With dead ends: 226 [2024-11-07 16:39:04,708 INFO L226 Difference]: Without dead ends: 226 [2024-11-07 16:39:04,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=854, Unknown=1, NotChecked=60, Total=1056 [2024-11-07 16:39:04,709 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 191 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:04,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 646 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1226 Invalid, 0 Unknown, 228 Unchecked, 0.6s Time] [2024-11-07 16:39:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-07 16:39:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 173. [2024-11-07 16:39:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 108 states have (on average 1.5740740740740742) internal successors, (170), 145 states have internal predecessors, (170), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-07 16:39:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 213 transitions. [2024-11-07 16:39:04,717 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 213 transitions. Word has length 37 [2024-11-07 16:39:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:04,718 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 213 transitions. [2024-11-07 16:39:04,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 states have internal predecessors, (56), 7 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-07 16:39:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 213 transitions. [2024-11-07 16:39:04,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 16:39:04,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:04,720 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] [2024-11-07 16:39:04,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 16:39:04,924 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,SelfDestructingSolverStorable9 [2024-11-07 16:39:04,925 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:04,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:04,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2117597909, now seen corresponding path program 1 times [2024-11-07 16:39:04,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:04,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653277996] [2024-11-07 16:39:04,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:04,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:05,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 16:39:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:05,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 16:39:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 16:39:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:39:05,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:05,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653277996] [2024-11-07 16:39:05,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653277996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:05,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014826269] [2024-11-07 16:39:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:05,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:05,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:05,094 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:05,099 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:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:05,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 16:39:05,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:05,190 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:05,199 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:05,207 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:05,222 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-07 16:39:05,238 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-07 16:39:05,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-07 16:39:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-07 16:39:05,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:39:05,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014826269] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:39:05,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:39:05,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 13 [2024-11-07 16:39:05,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126137979] [2024-11-07 16:39:05,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:05,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 16:39:05,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:05,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 16:39:05,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2024-11-07 16:39:05,336 INFO L87 Difference]: Start difference. First operand 173 states and 213 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 16:39:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:05,770 INFO L93 Difference]: Finished difference Result 188 states and 236 transitions. [2024-11-07 16:39:05,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:39:05,771 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2024-11-07 16:39:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:05,772 INFO L225 Difference]: With dead ends: 188 [2024-11-07 16:39:05,772 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 16:39:05,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=314, Unknown=1, NotChecked=36, Total=420 [2024-11-07 16:39:05,773 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 101 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:05,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 594 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 672 Invalid, 0 Unknown, 165 Unchecked, 0.3s Time] [2024-11-07 16:39:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 16:39:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 172. [2024-11-07 16:39:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 144 states have internal predecessors, (169), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-07 16:39:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 212 transitions. [2024-11-07 16:39:05,780 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 212 transitions. Word has length 40 [2024-11-07 16:39:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:05,780 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 212 transitions. [2024-11-07 16:39:05,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 16:39:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 212 transitions. [2024-11-07 16:39:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 16:39:05,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:05,783 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] [2024-11-07 16:39:05,798 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:05,983 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,SelfDestructingSolverStorable10 [2024-11-07 16:39:05,984 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:05,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2117597908, now seen corresponding path program 1 times [2024-11-07 16:39:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:05,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702481895] [2024-11-07 16:39:05,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:05,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:06,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 16:39:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:06,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 16:39:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:06,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 16:39:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:39:06,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:06,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702481895] [2024-11-07 16:39:06,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702481895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:06,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119190138] [2024-11-07 16:39:06,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:06,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:06,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:06,268 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:06,269 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:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:06,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 16:39:06,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:06,373 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:06,422 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:06,424 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:06,447 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:06,505 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-11-07 16:39:06,520 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-07 16:39:06,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-07 16:39:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-07 16:39:06,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:39:06,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119190138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:39:06,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:39:06,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-11-07 16:39:06,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899617906] [2024-11-07 16:39:06,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:06,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 16:39:06,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:06,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 16:39:06,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=628, Unknown=1, NotChecked=50, Total=756 [2024-11-07 16:39:06,779 INFO L87 Difference]: Start difference. First operand 172 states and 212 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 16:39:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:07,662 INFO L93 Difference]: Finished difference Result 186 states and 234 transitions. [2024-11-07 16:39:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:39:07,662 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 40 [2024-11-07 16:39:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:07,663 INFO L225 Difference]: With dead ends: 186 [2024-11-07 16:39:07,663 INFO L226 Difference]: Without dead ends: 186 [2024-11-07 16:39:07,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=1114, Unknown=1, NotChecked=68, Total=1332 [2024-11-07 16:39:07,665 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 137 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:07,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 881 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 892 Invalid, 0 Unknown, 165 Unchecked, 0.6s Time] [2024-11-07 16:39:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-07 16:39:07,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2024-11-07 16:39:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 142 states have internal predecessors, (167), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-07 16:39:07,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 210 transitions. [2024-11-07 16:39:07,673 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 210 transitions. Word has length 40 [2024-11-07 16:39:07,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:07,673 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 210 transitions. [2024-11-07 16:39:07,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 16:39:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 210 transitions. [2024-11-07 16:39:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 16:39:07,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:07,675 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:07,687 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:07,875 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,SelfDestructingSolverStorable11 [2024-11-07 16:39:07,876 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:07,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:07,876 INFO L85 PathProgramCache]: Analyzing trace with hash 43201550, now seen corresponding path program 1 times [2024-11-07 16:39:07,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:07,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964414590] [2024-11-07 16:39:07,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:07,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:39:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 16:39:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:39:07,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:07,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964414590] [2024-11-07 16:39:07,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964414590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:07,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:07,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:39:07,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693727876] [2024-11-07 16:39:07,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:07,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:39:07,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:07,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:39:07,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:39:07,957 INFO L87 Difference]: Start difference. First operand 170 states and 210 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:39:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:08,177 INFO L93 Difference]: Finished difference Result 211 states and 271 transitions. [2024-11-07 16:39:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:39:08,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-11-07 16:39:08,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:08,178 INFO L225 Difference]: With dead ends: 211 [2024-11-07 16:39:08,178 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 16:39:08,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:39:08,179 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 49 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:08,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 355 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:39:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 16:39:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2024-11-07 16:39:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.5813953488372092) internal successors, (204), 159 states have internal predecessors, (204), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (29), 26 states have call predecessors, (29), 20 states have call successors, (29) [2024-11-07 16:39:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 253 transitions. [2024-11-07 16:39:08,187 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 253 transitions. Word has length 47 [2024-11-07 16:39:08,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:08,187 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 253 transitions. [2024-11-07 16:39:08,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:39:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 253 transitions. [2024-11-07 16:39:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 16:39:08,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:08,189 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:08,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 16:39:08,189 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:08,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:08,190 INFO L85 PathProgramCache]: Analyzing trace with hash 43201551, now seen corresponding path program 1 times [2024-11-07 16:39:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:08,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844933227] [2024-11-07 16:39:08,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:08,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:39:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 16:39:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:39:08,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:08,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844933227] [2024-11-07 16:39:08,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844933227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:08,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:08,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:39:08,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629471671] [2024-11-07 16:39:08,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:08,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:39:08,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:08,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:39:08,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:39:08,375 INFO L87 Difference]: Start difference. First operand 191 states and 253 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:39:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:08,671 INFO L93 Difference]: Finished difference Result 218 states and 281 transitions. [2024-11-07 16:39:08,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:39:08,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-11-07 16:39:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:08,673 INFO L225 Difference]: With dead ends: 218 [2024-11-07 16:39:08,673 INFO L226 Difference]: Without dead ends: 218 [2024-11-07 16:39:08,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:39:08,673 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 43 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:08,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 618 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:39:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-07 16:39:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 201. [2024-11-07 16:39:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 137 states have (on average 1.5547445255474452) internal successors, (213), 167 states have internal predecessors, (213), 22 states have call successors, (22), 5 states have call predecessors, (22), 6 states have return successors, (31), 28 states have call predecessors, (31), 22 states have call successors, (31) [2024-11-07 16:39:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 266 transitions. [2024-11-07 16:39:08,679 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 266 transitions. Word has length 47 [2024-11-07 16:39:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:08,680 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 266 transitions. [2024-11-07 16:39:08,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:39:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 266 transitions. [2024-11-07 16:39:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 16:39:08,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:08,681 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:08,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 16:39:08,681 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:08,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1433023742, now seen corresponding path program 1 times [2024-11-07 16:39:08,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:08,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586150717] [2024-11-07 16:39:08,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:08,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:39:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 16:39:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:39:08,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586150717] [2024-11-07 16:39:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586150717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:08,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:08,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:39:08,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683232761] [2024-11-07 16:39:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:08,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:39:08,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:08,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:39:08,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:39:08,789 INFO L87 Difference]: Start difference. First operand 201 states and 266 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:39:08,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:08,947 INFO L93 Difference]: Finished difference Result 222 states and 293 transitions. [2024-11-07 16:39:08,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:39:08,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2024-11-07 16:39:08,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:08,948 INFO L225 Difference]: With dead ends: 222 [2024-11-07 16:39:08,948 INFO L226 Difference]: Without dead ends: 222 [2024-11-07 16:39:08,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:39:08,949 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 52 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:08,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 690 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:39:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-07 16:39:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2024-11-07 16:39:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 138 states have (on average 1.536231884057971) internal successors, (212), 168 states have internal predecessors, (212), 22 states have call successors, (22), 5 states have call predecessors, (22), 6 states have return successors, (31), 28 states have call predecessors, (31), 22 states have call successors, (31) [2024-11-07 16:39:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 265 transitions. [2024-11-07 16:39:08,957 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 265 transitions. Word has length 49 [2024-11-07 16:39:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:08,958 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 265 transitions. [2024-11-07 16:39:08,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:39:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 265 transitions. [2024-11-07 16:39:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 16:39:08,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:08,958 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:08,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 16:39:08,958 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:08,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1593016213, now seen corresponding path program 1 times [2024-11-07 16:39:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013143044] [2024-11-07 16:39:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:39:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 16:39:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:39:09,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:09,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013143044] [2024-11-07 16:39:09,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013143044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:09,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235813974] [2024-11-07 16:39:09,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:09,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:09,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:09,690 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:09,691 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:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:09,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-07 16:39:09,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:09,822 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,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:39:09,950 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))))) is different from true [2024-11-07 16:39:09,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:09,997 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 20 treesize of output 15 [2024-11-07 16:39:10,019 INFO L349 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2024-11-07 16:39:10,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 40 [2024-11-07 16:39:10,032 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 31 treesize of output 15 [2024-11-07 16:39:10,114 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 21 treesize of output 9 [2024-11-07 16:39:10,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-07 16:39:10,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:10,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235813974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:10,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:10,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 32 [2024-11-07 16:39:10,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876160237] [2024-11-07 16:39:10,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:10,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-07 16:39:10,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:10,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-07 16:39:10,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1226, Unknown=1, NotChecked=70, Total=1406 [2024-11-07 16:39:10,745 INFO L87 Difference]: Start difference. First operand 202 states and 265 transitions. Second operand has 33 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 25 states have internal predecessors, (68), 8 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-07 16:39:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:12,238 INFO L93 Difference]: Finished difference Result 253 states and 330 transitions. [2024-11-07 16:39:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 16:39:12,240 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 25 states have internal predecessors, (68), 8 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 51 [2024-11-07 16:39:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:12,241 INFO L225 Difference]: With dead ends: 253 [2024-11-07 16:39:12,241 INFO L226 Difference]: Without dead ends: 253 [2024-11-07 16:39:12,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=203, Invalid=2452, Unknown=1, NotChecked=100, Total=2756 [2024-11-07 16:39:12,242 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 101 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 2767 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:12,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1713 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2767 Invalid, 0 Unknown, 218 Unchecked, 1.0s Time] [2024-11-07 16:39:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-07 16:39:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2024-11-07 16:39:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 159 states have (on average 1.5157232704402517) internal successors, (241), 189 states have internal predecessors, (241), 23 states have call successors, (23), 6 states have call predecessors, (23), 8 states have return successors, (41), 30 states have call predecessors, (41), 23 states have call successors, (41) [2024-11-07 16:39:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 305 transitions. [2024-11-07 16:39:12,249 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 305 transitions. Word has length 51 [2024-11-07 16:39:12,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:12,249 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 305 transitions. [2024-11-07 16:39:12,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 25 states have internal predecessors, (68), 8 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-07 16:39:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2024-11-07 16:39:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 16:39:12,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:12,250 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:12,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 16:39:12,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:12,453 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:12,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1593016214, now seen corresponding path program 1 times [2024-11-07 16:39:12,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:12,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378551815] [2024-11-07 16:39:12,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:12,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:12,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:12,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:39:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:13,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:13,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 16:39:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:13,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:39:13,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378551815] [2024-11-07 16:39:13,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378551815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864404198] [2024-11-07 16:39:13,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:13,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:13,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:13,392 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:13,394 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:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:13,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-07 16:39:13,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:13,524 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:13,527 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,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:39:13,594 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:13,665 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2024-11-07 16:39:13,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:13,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-07 16:39:13,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:13,737 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 20 treesize of output 15 [2024-11-07 16:39:13,752 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2024-11-07 16:39:13,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2024-11-07 16:39:13,756 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 18 treesize of output 13 [2024-11-07 16:39:13,790 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 31 treesize of output 15 [2024-11-07 16:39:13,793 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:13,871 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 21 treesize of output 9 [2024-11-07 16:39:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-07 16:39:13,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:14,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864404198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:14,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:14,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 32 [2024-11-07 16:39:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600231566] [2024-11-07 16:39:14,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:14,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-07 16:39:14,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:14,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-07 16:39:14,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1436, Unknown=1, NotChecked=76, Total=1640 [2024-11-07 16:39:14,310 INFO L87 Difference]: Start difference. First operand 226 states and 305 transitions. Second operand has 33 states, 29 states have (on average 2.310344827586207) internal successors, (67), 25 states have internal predecessors, (67), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-07 16:39:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:15,707 INFO L93 Difference]: Finished difference Result 271 states and 356 transitions. [2024-11-07 16:39:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-07 16:39:15,708 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 2.310344827586207) internal successors, (67), 25 states have internal predecessors, (67), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) Word has length 51 [2024-11-07 16:39:15,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:15,709 INFO L225 Difference]: With dead ends: 271 [2024-11-07 16:39:15,709 INFO L226 Difference]: Without dead ends: 271 [2024-11-07 16:39:15,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=2552, Unknown=1, NotChecked=102, Total=2862 [2024-11-07 16:39:15,709 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 100 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:15,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1494 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2127 Invalid, 0 Unknown, 221 Unchecked, 0.8s Time] [2024-11-07 16:39:15,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-07 16:39:15,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 246. [2024-11-07 16:39:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 176 states have (on average 1.4943181818181819) internal successors, (263), 206 states have internal predecessors, (263), 25 states have call successors, (25), 7 states have call predecessors, (25), 9 states have return successors, (45), 32 states have call predecessors, (45), 25 states have call successors, (45) [2024-11-07 16:39:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 333 transitions. [2024-11-07 16:39:15,718 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 333 transitions. Word has length 51 [2024-11-07 16:39:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:15,718 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 333 transitions. [2024-11-07 16:39:15,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 2.310344827586207) internal successors, (67), 25 states have internal predecessors, (67), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-07 16:39:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 333 transitions. [2024-11-07 16:39:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 16:39:15,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:15,719 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:15,731 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:15,919 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,SelfDestructingSolverStorable16 [2024-11-07 16:39:15,919 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:15,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:15,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1842636325, now seen corresponding path program 1 times [2024-11-07 16:39:15,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:15,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752752200] [2024-11-07 16:39:15,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:15,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:16,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:16,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:39:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:16,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:16,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 16:39:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:16,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:39:17,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752752200] [2024-11-07 16:39:17,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752752200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832591163] [2024-11-07 16:39:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:17,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:17,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:17,154 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:17,155 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:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:17,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-11-07 16:39:17,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:17,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:39:17,410 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:17,415 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:17,624 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-07 16:39:17,624 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:17,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-07 16:39:17,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-07 16:39:17,816 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2024-11-07 16:39:17,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:17,862 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-07 16:39:17,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 51 [2024-11-07 16:39:17,874 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-07 16:39:17,874 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 22 treesize of output 24 [2024-11-07 16:39:17,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-07 16:39:17,928 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-07 16:39:17,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 34 [2024-11-07 16:39:17,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-07 16:39:18,345 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:18,350 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2024-11-07 16:39:18,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2024-11-07 16:39:18,356 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:39:18,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2024-11-07 16:39:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-07 16:39:18,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:23,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832591163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:23,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:23,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 50 [2024-11-07 16:39:23,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86781526] [2024-11-07 16:39:23,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:23,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-07 16:39:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:23,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-07 16:39:23,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=3045, Unknown=2, NotChecked=110, Total=3306 [2024-11-07 16:39:23,374 INFO L87 Difference]: Start difference. First operand 246 states and 333 transitions. Second operand has 50 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 37 states have internal predecessors, (81), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-07 16:39:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:26,594 INFO L93 Difference]: Finished difference Result 284 states and 374 transitions. [2024-11-07 16:39:26,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 16:39:26,595 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 37 states have internal predecessors, (81), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 54 [2024-11-07 16:39:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:26,596 INFO L225 Difference]: With dead ends: 284 [2024-11-07 16:39:26,596 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 16:39:26,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=297, Invalid=5711, Unknown=2, NotChecked=152, Total=6162 [2024-11-07 16:39:26,597 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 119 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 3844 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 4121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:26,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 2365 Invalid, 4121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3844 Invalid, 0 Unknown, 232 Unchecked, 1.9s Time] [2024-11-07 16:39:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 16:39:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 245. [2024-11-07 16:39:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 175 states have (on average 1.48) internal successors, (259), 205 states have internal predecessors, (259), 25 states have call successors, (25), 7 states have call predecessors, (25), 9 states have return successors, (45), 32 states have call predecessors, (45), 25 states have call successors, (45) [2024-11-07 16:39:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 329 transitions. [2024-11-07 16:39:26,605 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 329 transitions. Word has length 54 [2024-11-07 16:39:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:26,605 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 329 transitions. [2024-11-07 16:39:26,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 37 states have internal predecessors, (81), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-07 16:39:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 329 transitions. [2024-11-07 16:39:26,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 16:39:26,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:26,606 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:26,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-07 16:39:26,809 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,SelfDestructingSolverStorable17 [2024-11-07 16:39:26,810 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:26,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:26,810 INFO L85 PathProgramCache]: Analyzing trace with hash -809263971, now seen corresponding path program 2 times [2024-11-07 16:39:26,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:26,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516416494] [2024-11-07 16:39:26,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:26,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:26,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:26,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:39:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:27,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:27,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:39:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:27,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 16:39:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:39:27,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:27,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516416494] [2024-11-07 16:39:27,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516416494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:27,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025789482] [2024-11-07 16:39:27,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:39:27,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:27,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:27,790 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:27,791 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:27,915 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:39:27,915 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:39:27,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-07 16:39:27,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:27,926 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:27,949 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-07 16:39:27,968 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) |c_create_internal_#t~ret7.base| (select |c_#valid| |c_create_internal_#t~ret7.base|)))) is different from true [2024-11-07 16:39:27,970 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:27,974 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset))) (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) .cse0 (select |c_#valid| .cse0))))) is different from true [2024-11-07 16:39:27,978 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 27 treesize of output 15 [2024-11-07 16:39:27,982 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) |c_create_internal_#t~mem8.base| (select |c_#valid| |c_create_internal_#t~mem8.base|)))) is different from true [2024-11-07 16:39:27,985 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base)))) is different from true [2024-11-07 16:39:28,002 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) c_create_internal_~now~0.base 1))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_92 Int)) (and (not (= v_alloc_and_zero_internal_~pi~1.base_92 c_create_internal_~now~0.base)) (= |c_#valid| (store (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base)) v_alloc_and_zero_internal_~pi~1.base_92 1))))) is different from true [2024-11-07 16:39:28,147 INFO L349 Elim1Store]: treesize reduction 137, result has 16.0 percent of original size [2024-11-07 16:39:28,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 79 [2024-11-07 16:39:28,252 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:28,283 INFO L349 Elim1Store]: treesize reduction 220, result has 2.2 percent of original size [2024-11-07 16:39:28,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 25 [2024-11-07 16:39:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 19 not checked. [2024-11-07 16:39:28,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:28,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025789482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:28,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:28,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 27 [2024-11-07 16:39:28,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329769180] [2024-11-07 16:39:28,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:28,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 16:39:28,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 16:39:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=459, Unknown=6, NotChecked=306, Total=930 [2024-11-07 16:39:28,494 INFO L87 Difference]: Start difference. First operand 245 states and 329 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 21 states have internal predecessors, (63), 8 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-07 16:39:29,358 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((create_internal_~now~0.base Int) (alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_92 Int)) (and (= |c_#valid| (store (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) create_internal_~now~0.base 1) v_alloc_and_zero_internal_~pi~1.base_92 1)) (not (= create_internal_~now~0.base v_alloc_and_zero_internal_~pi~1.base_92)))) (exists ((create_internal_~now~0.base Int) (alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) create_internal_~now~0.base 1)))) (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) c_create_internal_~now~0.base 1))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_92 Int)) (and (not (= v_alloc_and_zero_internal_~pi~1.base_92 c_create_internal_~now~0.base)) (= |c_#valid| (store (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base)) v_alloc_and_zero_internal_~pi~1.base_92 1)))))) is different from true [2024-11-07 16:39:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:29,687 INFO L93 Difference]: Finished difference Result 299 states and 411 transitions. [2024-11-07 16:39:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 16:39:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 21 states have internal predecessors, (63), 8 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 49 [2024-11-07 16:39:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:29,689 INFO L225 Difference]: With dead ends: 299 [2024-11-07 16:39:29,689 INFO L226 Difference]: Without dead ends: 299 [2024-11-07 16:39:29,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=834, Unknown=7, NotChecked=490, Total=1640 [2024-11-07 16:39:29,690 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 163 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 84 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 2462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 1376 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:29,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 685 Invalid, 2462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 999 Invalid, 3 Unknown, 1376 Unchecked, 0.8s Time] [2024-11-07 16:39:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-07 16:39:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 256. [2024-11-07 16:39:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 184 states have (on average 1.4673913043478262) internal successors, (270), 214 states have internal predecessors, (270), 26 states have call successors, (26), 7 states have call predecessors, (26), 10 states have return successors, (56), 34 states have call predecessors, (56), 26 states have call successors, (56) [2024-11-07 16:39:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 352 transitions. [2024-11-07 16:39:29,695 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 352 transitions. Word has length 49 [2024-11-07 16:39:29,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:29,695 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 352 transitions. [2024-11-07 16:39:29,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 21 states have internal predecessors, (63), 8 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-07 16:39:29,696 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 352 transitions. [2024-11-07 16:39:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 16:39:29,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:29,696 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:29,709 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:29,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:29,896 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:29,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:29,897 INFO L85 PathProgramCache]: Analyzing trace with hash -809263970, now seen corresponding path program 2 times [2024-11-07 16:39:29,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:29,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018787057] [2024-11-07 16:39:29,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:29,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:30,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:30,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:39:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:30,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:30,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:39:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:35,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 16:39:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:39:35,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:35,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018787057] [2024-11-07 16:39:35,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018787057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:35,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703187476] [2024-11-07 16:39:35,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:39:35,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:35,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:35,872 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:35,872 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:35,986 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:39:35,986 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:39:35,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-07 16:39:35,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:35,993 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:35,995 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:36,088 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2024-11-07 16:39:36,121 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-07 16:39:36,217 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-07 16:39:36,489 INFO L349 Elim1Store]: treesize reduction 160, result has 14.4 percent of original size [2024-11-07 16:39:36,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 124 [2024-11-07 16:39:36,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:39:36,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 127 treesize of output 233 [2024-11-07 16:39:38,073 INFO L349 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2024-11-07 16:39:38,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 16 [2024-11-07 16:39:38,111 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-07 16:39:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 17 not checked. [2024-11-07 16:39:38,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:38,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703187476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:38,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:38,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 29 [2024-11-07 16:39:38,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718831342] [2024-11-07 16:39:38,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:38,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-07 16:39:38,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:38,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-07 16:39:38,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=702, Unknown=3, NotChecked=168, Total=992 [2024-11-07 16:39:38,392 INFO L87 Difference]: Start difference. First operand 256 states and 352 transitions. Second operand has 30 states, 27 states have (on average 2.814814814814815) internal successors, (76), 24 states have internal predecessors, (76), 9 states have call successors, (10), 3 states have call predecessors, (10), 10 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-07 16:39:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:43,585 INFO L93 Difference]: Finished difference Result 311 states and 424 transitions. [2024-11-07 16:39:43,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 16:39:43,586 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.814814814814815) internal successors, (76), 24 states have internal predecessors, (76), 9 states have call successors, (10), 3 states have call predecessors, (10), 10 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 49 [2024-11-07 16:39:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:43,587 INFO L225 Difference]: With dead ends: 311 [2024-11-07 16:39:43,587 INFO L226 Difference]: Without dead ends: 311 [2024-11-07 16:39:43,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=155, Invalid=909, Unknown=4, NotChecked=192, Total=1260 [2024-11-07 16:39:43,587 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 119 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 719 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:43,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 851 Invalid, 2226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1449 Invalid, 1 Unknown, 719 Unchecked, 0.9s Time] [2024-11-07 16:39:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-07 16:39:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 252. [2024-11-07 16:39:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 181 states have (on average 1.4696132596685083) internal successors, (266), 211 states have internal predecessors, (266), 26 states have call successors, (26), 7 states have call predecessors, (26), 9 states have return successors, (46), 33 states have call predecessors, (46), 26 states have call successors, (46) [2024-11-07 16:39:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 338 transitions. [2024-11-07 16:39:43,595 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 338 transitions. Word has length 49 [2024-11-07 16:39:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:43,595 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 338 transitions. [2024-11-07 16:39:43,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.814814814814815) internal successors, (76), 24 states have internal predecessors, (76), 9 states have call successors, (10), 3 states have call predecessors, (10), 10 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-07 16:39:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 338 transitions. [2024-11-07 16:39:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 16:39:43,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:43,596 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:43,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-07 16:39:43,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:43,796 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:43,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:43,797 INFO L85 PathProgramCache]: Analyzing trace with hash -611936955, now seen corresponding path program 1 times [2024-11-07 16:39:43,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:43,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996031526] [2024-11-07 16:39:43,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:43,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:44,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:39:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:44,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:44,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 16:39:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:44,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:44,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 16:39:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:39:44,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996031526] [2024-11-07 16:39:44,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996031526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:44,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:44,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 16:39:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909885302] [2024-11-07 16:39:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:44,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 16:39:44,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:44,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 16:39:44,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2024-11-07 16:39:44,114 INFO L87 Difference]: Start difference. First operand 252 states and 338 transitions. Second operand has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-07 16:39:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:44,764 INFO L93 Difference]: Finished difference Result 286 states and 375 transitions. [2024-11-07 16:39:44,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:39:44,764 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2024-11-07 16:39:44,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:44,765 INFO L225 Difference]: With dead ends: 286 [2024-11-07 16:39:44,765 INFO L226 Difference]: Without dead ends: 286 [2024-11-07 16:39:44,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2024-11-07 16:39:44,766 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 54 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:44,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1152 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 16:39:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-07 16:39:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 263. [2024-11-07 16:39:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 220 states have internal predecessors, (280), 27 states have call successors, (27), 8 states have call predecessors, (27), 10 states have return successors, (47), 34 states have call predecessors, (47), 27 states have call successors, (47) [2024-11-07 16:39:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 354 transitions. [2024-11-07 16:39:44,771 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 354 transitions. Word has length 58 [2024-11-07 16:39:44,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:44,772 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 354 transitions. [2024-11-07 16:39:44,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-07 16:39:44,772 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 354 transitions. [2024-11-07 16:39:44,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 16:39:44,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:44,773 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:44,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 16:39:44,773 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:44,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:44,773 INFO L85 PathProgramCache]: Analyzing trace with hash -611936954, now seen corresponding path program 1 times [2024-11-07 16:39:44,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:44,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74550095] [2024-11-07 16:39:44,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:44,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:45,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:45,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:39:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:45,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:45,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 16:39:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:45,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:45,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 16:39:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:39:45,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:45,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74550095] [2024-11-07 16:39:45,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74550095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:39:45,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:39:45,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 16:39:45,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371572057] [2024-11-07 16:39:45,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:39:45,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 16:39:45,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:45,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 16:39:45,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2024-11-07 16:39:45,245 INFO L87 Difference]: Start difference. First operand 263 states and 354 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 14 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-07 16:39:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:39:45,994 INFO L93 Difference]: Finished difference Result 286 states and 374 transitions. [2024-11-07 16:39:45,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:39:45,997 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 14 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2024-11-07 16:39:45,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:39:45,998 INFO L225 Difference]: With dead ends: 286 [2024-11-07 16:39:45,998 INFO L226 Difference]: Without dead ends: 286 [2024-11-07 16:39:45,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2024-11-07 16:39:45,999 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 53 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:39:46,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1240 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 16:39:46,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-07 16:39:46,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 263. [2024-11-07 16:39:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 190 states have (on average 1.4684210526315788) internal successors, (279), 220 states have internal predecessors, (279), 27 states have call successors, (27), 8 states have call predecessors, (27), 10 states have return successors, (47), 34 states have call predecessors, (47), 27 states have call successors, (47) [2024-11-07 16:39:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 353 transitions. [2024-11-07 16:39:46,006 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 353 transitions. Word has length 58 [2024-11-07 16:39:46,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:39:46,006 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 353 transitions. [2024-11-07 16:39:46,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 14 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-07 16:39:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 353 transitions. [2024-11-07 16:39:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 16:39:46,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:39:46,007 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:39:46,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 16:39:46,008 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:39:46,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:39:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1325109, now seen corresponding path program 1 times [2024-11-07 16:39:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:39:46,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306539146] [2024-11-07 16:39:46,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:39:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:46,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:39:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:46,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:39:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:46,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:46,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 16:39:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:47,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:39:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:47,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:39:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:39:47,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:39:47,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306539146] [2024-11-07 16:39:47,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306539146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:47,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573631223] [2024-11-07 16:39:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:39:47,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:39:47,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:39:47,910 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:47,911 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:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:39:48,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-07 16:39:48,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:39:48,067 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:48,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:39:48,383 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))))) is different from true [2024-11-07 16:39:52,822 INFO L349 Elim1Store]: treesize reduction 71, result has 15.5 percent of original size [2024-11-07 16:39:52,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 99 [2024-11-07 16:39:52,956 INFO L349 Elim1Store]: treesize reduction 289, result has 24.9 percent of original size [2024-11-07 16:39:52,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 62 treesize of output 158 [2024-11-07 16:39:53,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:53,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:53,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2024-11-07 16:39:53,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:53,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:53,405 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-07 16:39:53,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 28 [2024-11-07 16:39:53,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:53,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:53,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:53,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:39:53,469 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-07 16:39:53,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 39 [2024-11-07 16:39:53,870 INFO L349 Elim1Store]: treesize reduction 567, result has 20.9 percent of original size [2024-11-07 16:39:53,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 24 case distinctions, treesize of input 84 treesize of output 238 [2024-11-07 16:39:54,541 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:54,555 INFO L349 Elim1Store]: treesize reduction 50, result has 13.8 percent of original size [2024-11-07 16:39:54,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 45 [2024-11-07 16:39:54,575 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:54,580 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-07 16:39:54,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2024-11-07 16:39:54,598 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:54,598 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:54,610 INFO L349 Elim1Store]: treesize reduction 159, result has 0.6 percent of original size [2024-11-07 16:39:54,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 58 treesize of output 1 [2024-11-07 16:39:54,619 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:54,624 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-07 16:39:54,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2024-11-07 16:39:54,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:54,649 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2024-11-07 16:39:54,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 37 [2024-11-07 16:39:54,738 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:54,761 INFO L349 Elim1Store]: treesize reduction 101, result has 16.5 percent of original size [2024-11-07 16:39:54,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 36 [2024-11-07 16:39:54,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:39:54,787 INFO L349 Elim1Store]: treesize reduction 116, result has 0.9 percent of original size [2024-11-07 16:39:54,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 38 treesize of output 1 [2024-11-07 16:39:55,487 INFO L349 Elim1Store]: treesize reduction 392, result has 25.9 percent of original size [2024-11-07 16:39:55,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 467 treesize of output 546 [2024-11-07 16:39:55,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 255 [2024-11-07 16:39:56,843 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 327 treesize of output 249 [2024-11-07 16:39:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-07 16:39:57,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:39:58,116 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_alloc_and_zero_internal_~pi~1.base_143 Int) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2016 (Array Int Int)) (v_ArrVal_2018 Int) (v_ArrVal_1998 Int) (v_create_internal_~sll~0.base_31 Int)) (let ((.cse0 (store |c_#valid| v_create_internal_~sll~0.base_31 v_ArrVal_2018))) (or (not (= (select .cse0 v_alloc_and_zero_internal_~pi~1.base_143) 0)) (= (select (store .cse0 v_alloc_and_zero_internal_~pi~1.base_143 1) (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$#0.base| v_alloc_and_zero_internal_~pi~1.base_143 v_ArrVal_2016) v_create_internal_~sll~0.base_31 v_ArrVal_2017))) (store .cse1 |c_ULTIMATE.start_create_~now~1#1.base| (store (select .cse1 |c_ULTIMATE.start_create_~now~1#1.base|) (+ |c_ULTIMATE.start_create_~now~1#1.offset| 16) v_ArrVal_1998))) |c_ULTIMATE.start_create_~sll~1#1.base|) (+ 8 |c_ULTIMATE.start_create_~sll~1#1.offset|))) 1) (not (= (select |c_#valid| v_create_internal_~sll~0.base_31) 0))))) is different from false [2024-11-07 16:39:58,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573631223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:39:58,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:39:58,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26] total 50 [2024-11-07 16:39:58,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119533323] [2024-11-07 16:39:58,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:39:58,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-07 16:39:58,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:39:58,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-07 16:39:58,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2670, Unknown=10, NotChecked=210, Total=3080 [2024-11-07 16:39:58,119 INFO L87 Difference]: Start difference. First operand 263 states and 353 transitions. Second operand has 51 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 37 states have internal predecessors, (91), 11 states have call successors, (13), 5 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-07 16:40:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:02,617 INFO L93 Difference]: Finished difference Result 314 states and 419 transitions. [2024-11-07 16:40:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-07 16:40:02,617 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 37 states have internal predecessors, (91), 11 states have call successors, (13), 5 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) Word has length 63 [2024-11-07 16:40:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:02,618 INFO L225 Difference]: With dead ends: 314 [2024-11-07 16:40:02,618 INFO L226 Difference]: Without dead ends: 314 [2024-11-07 16:40:02,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=326, Invalid=4502, Unknown=10, NotChecked=274, Total=5112 [2024-11-07 16:40:02,619 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 180 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 61 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:02,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1301 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2480 Invalid, 3 Unknown, 241 Unchecked, 2.7s Time] [2024-11-07 16:40:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-07 16:40:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 287. [2024-11-07 16:40:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 211 states have (on average 1.4597156398104265) internal successors, (308), 241 states have internal predecessors, (308), 28 states have call successors, (28), 9 states have call predecessors, (28), 12 states have return successors, (58), 36 states have call predecessors, (58), 28 states have call successors, (58) [2024-11-07 16:40:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 394 transitions. [2024-11-07 16:40:02,626 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 394 transitions. Word has length 63 [2024-11-07 16:40:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:02,626 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 394 transitions. [2024-11-07 16:40:02,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 37 states have internal predecessors, (91), 11 states have call successors, (13), 5 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-07 16:40:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 394 transitions. [2024-11-07 16:40:02,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 16:40:02,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:02,628 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:02,641 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:40:02,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:02,829 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-07 16:40:02,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1325108, now seen corresponding path program 1 times [2024-11-07 16:40:02,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:02,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383879815] [2024-11-07 16:40:02,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:02,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:03,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:40:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:03,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 16:40:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:03,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:40:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:03,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 16:40:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:05,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 16:40:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:05,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:40:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:40:06,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:06,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383879815] [2024-11-07 16:40:06,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383879815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:40:06,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947109441] [2024-11-07 16:40:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:06,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:06,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:40:06,083 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:40:06,084 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:40:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:06,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-11-07 16:40:06,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:40:06,265 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:40:06,495 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:40:06,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1