./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '3a97724240a87192496d8328468f54cf5b25ba6881d4dae32505036169c4a273'] 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/uthash-2.0.2/uthash_JEN_test5-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a97724240a87192496d8328468f54cf5b25ba6881d4dae32505036169c4a273 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 18:51:24,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 18:51:24,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 18:51:24,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 18:51:24,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 18:51:24,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 18:51:24,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 18:51:24,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 18:51:24,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 18:51:24,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 18:51:24,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 18:51:24,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 18:51:24,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 18:51:24,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 18:51:24,521 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 18:51:24,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 18:51:24,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 18:51:24,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 18:51:24,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 18:51:24,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 18:51:24,523 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 18:51:24,523 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 18:51:24,523 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 18:51:24,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 18:51:24,523 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 18:51:24,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 18:51:24,523 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 18:51:24,523 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 18:51:24,524 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 18:51:24,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 18:51:24,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 18:51:24,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 18:51:24,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 18:51:24,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:51:24,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 18:51:24,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 18:51:24,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 18:51:24,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 18:51:24,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 18:51:24,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 18:51:24,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 18:51:24,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 18:51:24,526 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a97724240a87192496d8328468f54cf5b25ba6881d4dae32505036169c4a273 [2024-11-07 18:51:24,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 18:51:24,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 18:51:24,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 18:51:24,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 18:51:24,828 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 18:51:24,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i [2024-11-07 18:51:26,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 18:51:26,534 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 18:51:26,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i [2024-11-07 18:51:26,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e55af193/7111e24552414f8d8ca4bfd7df87e1d0/FLAGf9bc78d4e [2024-11-07 18:51:26,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e55af193/7111e24552414f8d8ca4bfd7df87e1d0 [2024-11-07 18:51:26,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 18:51:26,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 18:51:26,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 18:51:26,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 18:51:26,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 18:51:26,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:51:26" (1/1) ... [2024-11-07 18:51:26,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27db3b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:26, skipping insertion in model container [2024-11-07 18:51:26,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:51:26" (1/1) ... [2024-11-07 18:51:26,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:51:27,075 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:51:27,114 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:51:27,118 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:51:27,123 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:51:27,130 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:51:27,157 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:51:27,160 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:51:27,162 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:51:27,168 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:51:27,195 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:51:27,195 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:51:27,197 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:51:27,197 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:51:27,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:51:27,224 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 18:51:27,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:51:27,387 INFO L204 MainTranslator]: Completed translation [2024-11-07 18:51:27,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27 WrapperNode [2024-11-07 18:51:27,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 18:51:27,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 18:51:27,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 18:51:27,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 18:51:27,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27" (1/1) ... [2024-11-07 18:51:27,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27" (1/1) ... [2024-11-07 18:51:27,558 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2052 [2024-11-07 18:51:27,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 18:51:27,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 18:51:27,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 18:51:27,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 18:51:27,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27" (1/1) ... [2024-11-07 18:51:27,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27" (1/1) ... [2024-11-07 18:51:27,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27" (1/1) ... [2024-11-07 18:51:27,679 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 1, 82]. [2024-11-07 18:51:27,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27" (1/1) ... [2024-11-07 18:51:27,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27" (1/1) ... [2024-11-07 18:51:27,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27" (1/1) ... [2024-11-07 18:51:27,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27" (1/1) ... [2024-11-07 18:51:27,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27" (1/1) ... [2024-11-07 18:51:27,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27" (1/1) ... [2024-11-07 18:51:27,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 18:51:27,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 18:51:27,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 18:51:27,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 18:51:27,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27" (1/1) ... [2024-11-07 18:51:27,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:51:27,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:51:27,817 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 18:51:27,823 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 18:51:27,843 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-07 18:51:27,843 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-07 18:51:27,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 18:51:27,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 18:51:27,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 18:51:27,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 18:51:27,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 18:51:27,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 18:51:27,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 18:51:27,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 18:51:27,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-07 18:51:27,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-07 18:51:27,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-07 18:51:27,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-07 18:51:27,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-07 18:51:27,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-07 18:51:27,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 18:51:27,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 18:51:27,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 18:51:27,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 18:51:27,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 18:51:27,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 18:51:27,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 18:51:27,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 18:51:27,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 18:51:27,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 18:51:27,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 18:51:27,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 18:51:27,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 18:51:27,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 18:51:27,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 18:51:28,089 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 18:51:28,091 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 18:51:28,109 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:51:28,140 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:51:28,160 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:51:31,344 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-11-07 18:51:31,344 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 18:51:31,396 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 18:51:31,397 INFO L316 CfgBuilder]: Removed 83 assume(true) statements. [2024-11-07 18:51:31,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:51:31 BoogieIcfgContainer [2024-11-07 18:51:31,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 18:51:31,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 18:51:31,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 18:51:31,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 18:51:31,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:51:26" (1/3) ... [2024-11-07 18:51:31,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b702f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:51:31, skipping insertion in model container [2024-11-07 18:51:31,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:27" (2/3) ... [2024-11-07 18:51:31,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b702f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:51:31, skipping insertion in model container [2024-11-07 18:51:31,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:51:31" (3/3) ... [2024-11-07 18:51:31,408 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test5-1.i [2024-11-07 18:51:31,422 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 18:51:31,422 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 712 error locations. [2024-11-07 18:51:31,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 18:51:31,509 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;@58710758, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 18:51:31,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-07 18:51:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 1738 states, 1015 states have (on average 2.0344827586206895) internal successors, (2065), 1728 states have internal predecessors, (2065), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:51:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 18:51:31,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:31,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 18:51:31,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:31,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:31,530 INFO L85 PathProgramCache]: Analyzing trace with hash 63053744, now seen corresponding path program 1 times [2024-11-07 18:51:31,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:31,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746203805] [2024-11-07 18:51:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:31,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:31,694 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 18:51:31,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:31,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746203805] [2024-11-07 18:51:31,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746203805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:31,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:31,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:51:31,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823875625] [2024-11-07 18:51:31,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:31,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 18:51:31,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:31,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 18:51:31,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 18:51:31,738 INFO L87 Difference]: Start difference. First operand has 1738 states, 1015 states have (on average 2.0344827586206895) internal successors, (2065), 1728 states have internal predecessors, (2065), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:31,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:31,846 INFO L93 Difference]: Finished difference Result 1718 states and 1978 transitions. [2024-11-07 18:51:31,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 18:51:31,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 18:51:31,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:31,875 INFO L225 Difference]: With dead ends: 1718 [2024-11-07 18:51:31,875 INFO L226 Difference]: Without dead ends: 1716 [2024-11-07 18:51:31,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 18:51:31,880 INFO L432 NwaCegarLoop]: 1978 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:31,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:51:31,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2024-11-07 18:51:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1716. [2024-11-07 18:51:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1005 states have (on average 1.9422885572139303) internal successors, (1952), 1706 states have internal predecessors, (1952), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 1976 transitions. [2024-11-07 18:51:31,997 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 1976 transitions. Word has length 5 [2024-11-07 18:51:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:31,998 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 1976 transitions. [2024-11-07 18:51:31,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 1976 transitions. [2024-11-07 18:51:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 18:51:31,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:31,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 18:51:31,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 18:51:31,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:32,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash 63053806, now seen corresponding path program 1 times [2024-11-07 18:51:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:32,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963584007] [2024-11-07 18:51:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:32,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:32,163 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 18:51:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963584007] [2024-11-07 18:51:32,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963584007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:32,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:32,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:51:32,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331801032] [2024-11-07 18:51:32,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:32,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:51:32,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:32,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:51:32,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:51:32,166 INFO L87 Difference]: Start difference. First operand 1716 states and 1976 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:33,437 INFO L93 Difference]: Finished difference Result 1945 states and 2293 transitions. [2024-11-07 18:51:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:51:33,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 18:51:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:33,448 INFO L225 Difference]: With dead ends: 1945 [2024-11-07 18:51:33,448 INFO L226 Difference]: Without dead ends: 1945 [2024-11-07 18:51:33,448 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 18:51:33,452 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 1737 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:33,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 1918 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 18:51:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2024-11-07 18:51:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1624. [2024-11-07 18:51:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1005 states have (on average 1.8507462686567164) internal successors, (1860), 1614 states have internal predecessors, (1860), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1884 transitions. [2024-11-07 18:51:33,506 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1884 transitions. Word has length 5 [2024-11-07 18:51:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:33,507 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 1884 transitions. [2024-11-07 18:51:33,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1884 transitions. [2024-11-07 18:51:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 18:51:33,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:33,507 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 18:51:33,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 18:51:33,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:33,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash 63053807, now seen corresponding path program 1 times [2024-11-07 18:51:33,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:33,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942021119] [2024-11-07 18:51:33,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:33,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:33,629 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 18:51:33,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942021119] [2024-11-07 18:51:33,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942021119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:33,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:33,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:51:33,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048435409] [2024-11-07 18:51:33,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:33,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:51:33,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:33,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:51:33,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:51:33,631 INFO L87 Difference]: Start difference. First operand 1624 states and 1884 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:34,804 INFO L93 Difference]: Finished difference Result 2361 states and 2785 transitions. [2024-11-07 18:51:34,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:51:34,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 18:51:34,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:34,816 INFO L225 Difference]: With dead ends: 2361 [2024-11-07 18:51:34,816 INFO L226 Difference]: Without dead ends: 2361 [2024-11-07 18:51:34,817 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 18:51:34,818 INFO L432 NwaCegarLoop]: 1955 mSDtfsCounter, 1217 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:34,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 2890 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 18:51:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-11-07 18:51:34,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1887. [2024-11-07 18:51:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1278 states have (on average 1.8262910798122065) internal successors, (2334), 1877 states have internal predecessors, (2334), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2358 transitions. [2024-11-07 18:51:34,869 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2358 transitions. Word has length 5 [2024-11-07 18:51:34,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:34,869 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2358 transitions. [2024-11-07 18:51:34,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2358 transitions. [2024-11-07 18:51:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 18:51:34,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:34,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 18:51:34,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 18:51:34,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:34,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:34,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1957056365, now seen corresponding path program 1 times [2024-11-07 18:51:34,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:34,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147532569] [2024-11-07 18:51:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:34,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:34,935 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 18:51:34,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:34,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147532569] [2024-11-07 18:51:34,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147532569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:34,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:34,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:51:34,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796981147] [2024-11-07 18:51:34,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:34,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:51:34,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:34,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:51:34,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:51:34,937 INFO L87 Difference]: Start difference. First operand 1887 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:34,997 INFO L93 Difference]: Finished difference Result 3755 states and 4697 transitions. [2024-11-07 18:51:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:51:34,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-07 18:51:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:35,015 INFO L225 Difference]: With dead ends: 3755 [2024-11-07 18:51:35,016 INFO L226 Difference]: Without dead ends: 3755 [2024-11-07 18:51:35,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:51:35,017 INFO L432 NwaCegarLoop]: 2150 mSDtfsCounter, 1830 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 4014 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:35,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 4014 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:51:35,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2024-11-07 18:51:35,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 1889. [2024-11-07 18:51:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1280 states have (on average 1.825) internal successors, (2336), 1879 states have internal predecessors, (2336), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2360 transitions. [2024-11-07 18:51:35,096 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2360 transitions. Word has length 6 [2024-11-07 18:51:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:35,096 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 2360 transitions. [2024-11-07 18:51:35,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2360 transitions. [2024-11-07 18:51:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 18:51:35,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:35,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:51:35,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 18:51:35,098 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:35,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash -408167560, now seen corresponding path program 1 times [2024-11-07 18:51:35,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:35,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327987895] [2024-11-07 18:51:35,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:35,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:35,214 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 18:51:35,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:35,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327987895] [2024-11-07 18:51:35,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327987895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:35,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:35,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:51:35,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198054076] [2024-11-07 18:51:35,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:35,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:35,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:35,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:35,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:35,217 INFO L87 Difference]: Start difference. First operand 1889 states and 2360 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:36,362 INFO L93 Difference]: Finished difference Result 1915 states and 2413 transitions. [2024-11-07 18:51:36,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:51:36,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-07 18:51:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:36,370 INFO L225 Difference]: With dead ends: 1915 [2024-11-07 18:51:36,370 INFO L226 Difference]: Without dead ends: 1915 [2024-11-07 18:51:36,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:51:36,373 INFO L432 NwaCegarLoop]: 1160 mSDtfsCounter, 2005 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2016 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:36,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2016 Valid, 2176 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 18:51:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2024-11-07 18:51:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1866. [2024-11-07 18:51:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1280 states have (on average 1.80703125) internal successors, (2313), 1856 states have internal predecessors, (2313), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2337 transitions. [2024-11-07 18:51:36,412 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2337 transitions. Word has length 11 [2024-11-07 18:51:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:36,412 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2337 transitions. [2024-11-07 18:51:36,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:36,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2337 transitions. [2024-11-07 18:51:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 18:51:36,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:36,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:51:36,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 18:51:36,414 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:36,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash -408167559, now seen corresponding path program 1 times [2024-11-07 18:51:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:36,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911204154] [2024-11-07 18:51:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:36,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:36,501 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 18:51:36,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:36,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911204154] [2024-11-07 18:51:36,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911204154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:36,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:36,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:51:36,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492481503] [2024-11-07 18:51:36,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:36,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:51:36,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:36,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:51:36,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:51:36,502 INFO L87 Difference]: Start difference. First operand 1866 states and 2337 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:36,535 INFO L93 Difference]: Finished difference Result 1791 states and 2234 transitions. [2024-11-07 18:51:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:51:36,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-07 18:51:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:36,541 INFO L225 Difference]: With dead ends: 1791 [2024-11-07 18:51:36,542 INFO L226 Difference]: Without dead ends: 1791 [2024-11-07 18:51:36,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:51:36,543 INFO L432 NwaCegarLoop]: 1736 mSDtfsCounter, 61 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3419 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:36,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3419 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:51:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2024-11-07 18:51:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1791. [2024-11-07 18:51:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1217 states have (on average 1.8159408381265407) internal successors, (2210), 1781 states have internal predecessors, (2210), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2234 transitions. [2024-11-07 18:51:36,576 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2234 transitions. Word has length 11 [2024-11-07 18:51:36,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:36,577 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2234 transitions. [2024-11-07 18:51:36,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2234 transitions. [2024-11-07 18:51:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 18:51:36,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:36,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:51:36,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 18:51:36,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:36,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:36,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1406843659, now seen corresponding path program 1 times [2024-11-07 18:51:36,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:36,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930851940] [2024-11-07 18:51:36,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:36,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:36,686 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 18:51:36,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:36,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930851940] [2024-11-07 18:51:36,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930851940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:36,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:36,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:51:36,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32878830] [2024-11-07 18:51:36,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:36,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:36,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:36,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:36,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:36,688 INFO L87 Difference]: Start difference. First operand 1791 states and 2234 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:36,761 INFO L93 Difference]: Finished difference Result 1776 states and 2212 transitions. [2024-11-07 18:51:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:51:36,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-07 18:51:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:36,768 INFO L225 Difference]: With dead ends: 1776 [2024-11-07 18:51:36,768 INFO L226 Difference]: Without dead ends: 1776 [2024-11-07 18:51:36,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:51:36,769 INFO L432 NwaCegarLoop]: 1698 mSDtfsCounter, 45 mSDsluCounter, 3373 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5071 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:36,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5071 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:51:36,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-07 18:51:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2024-11-07 18:51:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1209 states have (on average 1.8097601323407775) internal successors, (2188), 1766 states have internal predecessors, (2188), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2212 transitions. [2024-11-07 18:51:36,809 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2212 transitions. Word has length 13 [2024-11-07 18:51:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:36,809 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 2212 transitions. [2024-11-07 18:51:36,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2212 transitions. [2024-11-07 18:51:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 18:51:36,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:36,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:51:36,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 18:51:36,810 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:36,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:36,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1340702493, now seen corresponding path program 1 times [2024-11-07 18:51:36,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:36,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614853373] [2024-11-07 18:51:36,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:36,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:37,016 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 18:51:37,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:37,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614853373] [2024-11-07 18:51:37,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614853373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:37,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:37,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:51:37,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689020619] [2024-11-07 18:51:37,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:37,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:37,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:37,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:37,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:37,018 INFO L87 Difference]: Start difference. First operand 1776 states and 2212 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:38,350 INFO L93 Difference]: Finished difference Result 2296 states and 2712 transitions. [2024-11-07 18:51:38,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:51:38,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-07 18:51:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:38,358 INFO L225 Difference]: With dead ends: 2296 [2024-11-07 18:51:38,359 INFO L226 Difference]: Without dead ends: 2296 [2024-11-07 18:51:38,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:51:38,359 INFO L432 NwaCegarLoop]: 1431 mSDtfsCounter, 1222 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:38,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 3385 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 18:51:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2024-11-07 18:51:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1772. [2024-11-07 18:51:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1209 states have (on average 1.8064516129032258) internal successors, (2184), 1762 states have internal predecessors, (2184), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2208 transitions. [2024-11-07 18:51:38,397 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2208 transitions. Word has length 27 [2024-11-07 18:51:38,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:38,397 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2208 transitions. [2024-11-07 18:51:38,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2208 transitions. [2024-11-07 18:51:38,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 18:51:38,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:38,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:51:38,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 18:51:38,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:38,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:38,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1878905961, now seen corresponding path program 1 times [2024-11-07 18:51:38,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:38,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89250619] [2024-11-07 18:51:38,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:38,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:38,527 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 18:51:38,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:38,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89250619] [2024-11-07 18:51:38,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89250619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:38,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:38,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:51:38,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025995950] [2024-11-07 18:51:38,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:38,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:38,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:38,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:38,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:38,530 INFO L87 Difference]: Start difference. First operand 1772 states and 2208 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:38,603 INFO L93 Difference]: Finished difference Result 1766 states and 2198 transitions. [2024-11-07 18:51:38,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:51:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-07 18:51:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:38,609 INFO L225 Difference]: With dead ends: 1766 [2024-11-07 18:51:38,610 INFO L226 Difference]: Without dead ends: 1766 [2024-11-07 18:51:38,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:51:38,611 INFO L432 NwaCegarLoop]: 1696 mSDtfsCounter, 21 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5057 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:38,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5057 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:51:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2024-11-07 18:51:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2024-11-07 18:51:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1203 states have (on average 1.8071487946799667) internal successors, (2174), 1756 states have internal predecessors, (2174), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2198 transitions. [2024-11-07 18:51:38,645 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2198 transitions. Word has length 61 [2024-11-07 18:51:38,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:38,646 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2198 transitions. [2024-11-07 18:51:38,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:38,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2198 transitions. [2024-11-07 18:51:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 18:51:38,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:38,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:51:38,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 18:51:38,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:38,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:38,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1294710755, now seen corresponding path program 1 times [2024-11-07 18:51:38,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:38,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468507503] [2024-11-07 18:51:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:38,812 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 18:51:38,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:38,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468507503] [2024-11-07 18:51:38,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468507503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:38,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:38,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:51:38,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779832777] [2024-11-07 18:51:38,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:38,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:51:38,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:38,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:51:38,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:51:38,814 INFO L87 Difference]: Start difference. First operand 1766 states and 2198 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:38,855 INFO L93 Difference]: Finished difference Result 1858 states and 2317 transitions. [2024-11-07 18:51:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:51:38,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 18:51:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:38,864 INFO L225 Difference]: With dead ends: 1858 [2024-11-07 18:51:38,864 INFO L226 Difference]: Without dead ends: 1858 [2024-11-07 18:51:38,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:51:38,866 INFO L432 NwaCegarLoop]: 1711 mSDtfsCounter, 54 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3395 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:38,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3395 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:51:38,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2024-11-07 18:51:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2024-11-07 18:51:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1295 states have (on average 1.7706563706563707) internal successors, (2293), 1848 states have internal predecessors, (2293), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:38,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2317 transitions. [2024-11-07 18:51:38,901 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2317 transitions. Word has length 69 [2024-11-07 18:51:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:38,902 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2317 transitions. [2024-11-07 18:51:38,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2317 transitions. [2024-11-07 18:51:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 18:51:38,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:38,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:51:38,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 18:51:38,905 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:38,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:38,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1814650898, now seen corresponding path program 1 times [2024-11-07 18:51:38,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:38,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748459029] [2024-11-07 18:51:38,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:38,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:39,527 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 18:51:39,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748459029] [2024-11-07 18:51:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748459029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:39,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:39,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 18:51:39,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707987963] [2024-11-07 18:51:39,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:39,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 18:51:39,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:39,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 18:51:39,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:51:39,531 INFO L87 Difference]: Start difference. First operand 1858 states and 2317 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:40,824 INFO L93 Difference]: Finished difference Result 1774 states and 2233 transitions. [2024-11-07 18:51:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:51:40,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-07 18:51:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:40,830 INFO L225 Difference]: With dead ends: 1774 [2024-11-07 18:51:40,830 INFO L226 Difference]: Without dead ends: 1774 [2024-11-07 18:51:40,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:51:40,831 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 1535 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:40,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 1620 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 18:51:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-07 18:51:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1501. [2024-11-07 18:51:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1022 states have (on average 1.687866927592955) internal successors, (1725), 1491 states have internal predecessors, (1725), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1749 transitions. [2024-11-07 18:51:40,856 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1749 transitions. Word has length 72 [2024-11-07 18:51:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:40,856 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1749 transitions. [2024-11-07 18:51:40,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1749 transitions. [2024-11-07 18:51:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 18:51:40,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:40,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:51:40,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 18:51:40,857 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:40,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash -702590666, now seen corresponding path program 1 times [2024-11-07 18:51:40,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:40,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428186550] [2024-11-07 18:51:40,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:41,119 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 18:51:41,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:41,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428186550] [2024-11-07 18:51:41,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428186550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:41,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:41,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:51:41,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190713183] [2024-11-07 18:51:41,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:41,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 18:51:41,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:41,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 18:51:41,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:51:41,121 INFO L87 Difference]: Start difference. First operand 1501 states and 1749 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:42,066 INFO L93 Difference]: Finished difference Result 1500 states and 1748 transitions. [2024-11-07 18:51:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:51:42,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-07 18:51:42,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:42,070 INFO L225 Difference]: With dead ends: 1500 [2024-11-07 18:51:42,071 INFO L226 Difference]: Without dead ends: 1500 [2024-11-07 18:51:42,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:51:42,072 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 2 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4778 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:42,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4778 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 18:51:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2024-11-07 18:51:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1500. [2024-11-07 18:51:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1022 states have (on average 1.6868884540117417) internal successors, (1724), 1490 states have internal predecessors, (1724), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-07 18:51:42,096 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 77 [2024-11-07 18:51:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:42,098 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-07 18:51:42,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-07 18:51:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 18:51:42,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:42,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:51:42,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 18:51:42,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:42,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash -702590665, now seen corresponding path program 1 times [2024-11-07 18:51:42,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:42,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314867833] [2024-11-07 18:51:42,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:42,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:42,589 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 18:51:42,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:42,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314867833] [2024-11-07 18:51:42,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314867833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:42,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:42,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:51:42,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585266016] [2024-11-07 18:51:42,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:42,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 18:51:42,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:42,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 18:51:42,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:51:42,593 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:43,646 INFO L93 Difference]: Finished difference Result 1499 states and 1747 transitions. [2024-11-07 18:51:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:51:43,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-07 18:51:43,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:43,651 INFO L225 Difference]: With dead ends: 1499 [2024-11-07 18:51:43,651 INFO L226 Difference]: Without dead ends: 1499 [2024-11-07 18:51:43,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:51:43,652 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 1 mSDsluCounter, 3177 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4800 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:43,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4800 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 18:51:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2024-11-07 18:51:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2024-11-07 18:51:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1021 states have (on average 1.6875612144955925) internal successors, (1723), 1489 states have internal predecessors, (1723), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1747 transitions. [2024-11-07 18:51:43,670 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1747 transitions. Word has length 77 [2024-11-07 18:51:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:43,670 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1747 transitions. [2024-11-07 18:51:43,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1747 transitions. [2024-11-07 18:51:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 18:51:43,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:43,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:51:43,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 18:51:43,672 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:43,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1178833342, now seen corresponding path program 1 times [2024-11-07 18:51:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:43,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405555036] [2024-11-07 18:51:43,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:44,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:51:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:44,247 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 18:51:44,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:44,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405555036] [2024-11-07 18:51:44,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405555036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:44,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:44,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 18:51:44,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392615193] [2024-11-07 18:51:44,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:44,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 18:51:44,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:44,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 18:51:44,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 18:51:44,250 INFO L87 Difference]: Start difference. First operand 1499 states and 1747 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:51:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:45,671 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2024-11-07 18:51:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:51:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-07 18:51:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:45,680 INFO L225 Difference]: With dead ends: 1506 [2024-11-07 18:51:45,680 INFO L226 Difference]: Without dead ends: 1506 [2024-11-07 18:51:45,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 18:51:45,680 INFO L432 NwaCegarLoop]: 1611 mSDtfsCounter, 13 mSDsluCounter, 5816 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7427 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:45,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7427 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 18:51:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-07 18:51:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1505. [2024-11-07 18:51:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1026 states have (on average 1.6861598440545809) internal successors, (1730), 1494 states have internal predecessors, (1730), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-07 18:51:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1760 transitions. [2024-11-07 18:51:45,709 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1760 transitions. Word has length 85 [2024-11-07 18:51:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:45,711 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1760 transitions. [2024-11-07 18:51:45,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:51:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1760 transitions. [2024-11-07 18:51:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 18:51:45,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:45,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:51:45,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 18:51:45,712 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:45,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:45,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1178833341, now seen corresponding path program 1 times [2024-11-07 18:51:45,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:45,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925983717] [2024-11-07 18:51:45,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:45,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:51:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:45,938 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 18:51:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:45,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925983717] [2024-11-07 18:51:45,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925983717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:45,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:45,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 18:51:45,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401486515] [2024-11-07 18:51:45,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:45,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 18:51:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:45,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 18:51:45,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 18:51:45,942 INFO L87 Difference]: Start difference. First operand 1505 states and 1760 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:51:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:47,480 INFO L93 Difference]: Finished difference Result 1510 states and 1764 transitions. [2024-11-07 18:51:47,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 18:51:47,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-07 18:51:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:47,484 INFO L225 Difference]: With dead ends: 1510 [2024-11-07 18:51:47,484 INFO L226 Difference]: Without dead ends: 1510 [2024-11-07 18:51:47,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 18:51:47,485 INFO L432 NwaCegarLoop]: 1606 mSDtfsCounter, 16 mSDsluCounter, 5776 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7382 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:47,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7382 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 18:51:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-07 18:51:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1505. [2024-11-07 18:51:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1026 states have (on average 1.6851851851851851) internal successors, (1729), 1494 states have internal predecessors, (1729), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-07 18:51:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1759 transitions. [2024-11-07 18:51:47,507 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1759 transitions. Word has length 85 [2024-11-07 18:51:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:47,507 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1759 transitions. [2024-11-07 18:51:47,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:51:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1759 transitions. [2024-11-07 18:51:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 18:51:47,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:47,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:51:47,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 18:51:47,508 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:47,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:47,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1708688822, now seen corresponding path program 1 times [2024-11-07 18:51:47,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:47,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833461142] [2024-11-07 18:51:47,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:47,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:51:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:51:48,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:48,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833461142] [2024-11-07 18:51:48,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833461142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:51:48,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072167144] [2024-11-07 18:51:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:48,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:51:48,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:51:48,270 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 18:51:48,272 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 18:51:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:48,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 18:51:48,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:48,671 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 18:51:48,687 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:51:48,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 18:51:48,718 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 18:51:48,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 18:51:48,821 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 22 treesize of output 10 [2024-11-07 18:51:48,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-07 18:51:48,975 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:48,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 18:51:48,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 18:51:49,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 18:51:49,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-07 18:51:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:51:49,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:51:49,200 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_547 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-07 18:51:49,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072167144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:51:49,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:51:49,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-07 18:51:49,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073245415] [2024-11-07 18:51:49,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:51:49,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 18:51:49,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:49,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 18:51:49,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-07 18:51:49,207 INFO L87 Difference]: Start difference. First operand 1505 states and 1759 transitions. Second operand has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:51:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:54,536 INFO L93 Difference]: Finished difference Result 1512 states and 1766 transitions. [2024-11-07 18:51:54,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 18:51:54,536 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-07 18:51:54,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:54,539 INFO L225 Difference]: With dead ends: 1512 [2024-11-07 18:51:54,539 INFO L226 Difference]: Without dead ends: 1512 [2024-11-07 18:51:54,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-07 18:51:54,540 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 1575 mSDsluCounter, 11052 mSDsCounter, 0 mSdLazyCounter, 10585 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 12102 SdHoareTripleChecker+Invalid, 10628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 10585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:54,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 12102 Invalid, 10628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 10585 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-07 18:51:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-07 18:51:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1509. [2024-11-07 18:51:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1030 states have (on average 1.6825242718446602) internal successors, (1733), 1497 states have internal predecessors, (1733), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-07 18:51:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1758 transitions. [2024-11-07 18:51:54,572 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1758 transitions. Word has length 86 [2024-11-07 18:51:54,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:54,572 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1758 transitions. [2024-11-07 18:51:54,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:51:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1758 transitions. [2024-11-07 18:51:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 18:51:54,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:54,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:51:54,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 18:51:54,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-07 18:51:54,775 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:54,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1708688821, now seen corresponding path program 1 times [2024-11-07 18:51:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:54,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152047316] [2024-11-07 18:51:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:54,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:55,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:51:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:51:55,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:55,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152047316] [2024-11-07 18:51:55,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152047316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:51:55,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342542192] [2024-11-07 18:51:55,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:55,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:51:55,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:51:55,201 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 18:51:55,203 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 18:51:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:55,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 18:51:55,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:55,573 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-07 18:51:55,573 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 18:51:55,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 18:51:55,698 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 22 treesize of output 10 [2024-11-07 18:51:55,859 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:55,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-07 18:51:55,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 18:51:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:51:55,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:51:55,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342542192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:51:56,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:51:56,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-07 18:51:56,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665235830] [2024-11-07 18:51:56,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:51:56,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 18:51:56,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:56,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 18:51:56,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=320, Unknown=6, NotChecked=0, Total=380 [2024-11-07 18:51:56,001 INFO L87 Difference]: Start difference. First operand 1509 states and 1758 transitions. Second operand has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:51:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:59,757 INFO L93 Difference]: Finished difference Result 1511 states and 1765 transitions. [2024-11-07 18:51:59,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 18:51:59,758 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-07 18:51:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:59,760 INFO L225 Difference]: With dead ends: 1511 [2024-11-07 18:51:59,760 INFO L226 Difference]: Without dead ends: 1511 [2024-11-07 18:51:59,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=507, Unknown=6, NotChecked=0, Total=600 [2024-11-07 18:51:59,761 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 1546 mSDsluCounter, 13237 mSDsCounter, 0 mSdLazyCounter, 8379 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 14281 SdHoareTripleChecker+Invalid, 8408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 8379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:59,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 14281 Invalid, 8408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 8379 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-07 18:51:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2024-11-07 18:51:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1502. [2024-11-07 18:51:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1025 states have (on average 1.6839024390243902) internal successors, (1726), 1491 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:51:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1750 transitions. [2024-11-07 18:51:59,777 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1750 transitions. Word has length 86 [2024-11-07 18:51:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:59,777 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1750 transitions. [2024-11-07 18:51:59,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:51:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1750 transitions. [2024-11-07 18:51:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 18:51:59,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:59,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:51:59,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 18:51:59,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 18:51:59,979 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:51:59,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:59,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1322895015, now seen corresponding path program 1 times [2024-11-07 18:51:59,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:59,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197023689] [2024-11-07 18:51:59,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:59,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:52:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:00,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:52:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:00,438 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 18:52:00,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:52:00,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197023689] [2024-11-07 18:52:00,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197023689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:52:00,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:52:00,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 18:52:00,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286438032] [2024-11-07 18:52:00,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:52:00,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 18:52:00,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:52:00,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 18:52:00,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-07 18:52:00,440 INFO L87 Difference]: Start difference. First operand 1502 states and 1750 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:52:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:52:02,430 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-07 18:52:02,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 18:52:02,430 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-07 18:52:02,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:52:02,434 INFO L225 Difference]: With dead ends: 1515 [2024-11-07 18:52:02,434 INFO L226 Difference]: Without dead ends: 1515 [2024-11-07 18:52:02,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-07 18:52:02,434 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 1573 mSDsluCounter, 7152 mSDsCounter, 0 mSdLazyCounter, 4793 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 8196 SdHoareTripleChecker+Invalid, 4819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 18:52:02,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 8196 Invalid, 4819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4793 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 18:52:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-07 18:52:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1511. [2024-11-07 18:52:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1033 states have (on average 1.6805421103581801) internal successors, (1736), 1499 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-07 18:52:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1761 transitions. [2024-11-07 18:52:02,454 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1761 transitions. Word has length 88 [2024-11-07 18:52:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:52:02,455 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1761 transitions. [2024-11-07 18:52:02,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:52:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1761 transitions. [2024-11-07 18:52:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 18:52:02,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:52:02,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:02,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 18:52:02,456 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:52:02,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:52:02,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1322895014, now seen corresponding path program 1 times [2024-11-07 18:52:02,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:52:02,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401086955] [2024-11-07 18:52:02,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:52:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:52:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:03,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:52:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:03,054 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 18:52:03,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:52:03,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401086955] [2024-11-07 18:52:03,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401086955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:52:03,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:52:03,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 18:52:03,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843858425] [2024-11-07 18:52:03,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:52:03,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 18:52:03,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:52:03,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 18:52:03,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-07 18:52:03,056 INFO L87 Difference]: Start difference. First operand 1511 states and 1761 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:52:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:52:06,192 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-07 18:52:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 18:52:06,192 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-07 18:52:06,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:52:06,195 INFO L225 Difference]: With dead ends: 1514 [2024-11-07 18:52:06,196 INFO L226 Difference]: Without dead ends: 1514 [2024-11-07 18:52:06,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-07 18:52:06,196 INFO L432 NwaCegarLoop]: 1051 mSDtfsCounter, 1547 mSDsluCounter, 8064 mSDsCounter, 0 mSdLazyCounter, 7054 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 9115 SdHoareTripleChecker+Invalid, 7078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:52:06,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 9115 Invalid, 7078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7054 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 18:52:06,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-07 18:52:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1511. [2024-11-07 18:52:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1033 states have (on average 1.6795740561471442) internal successors, (1735), 1499 states have internal predecessors, (1735), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-07 18:52:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1760 transitions. [2024-11-07 18:52:06,217 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1760 transitions. Word has length 88 [2024-11-07 18:52:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:52:06,217 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1760 transitions. [2024-11-07 18:52:06,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:52:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1760 transitions. [2024-11-07 18:52:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 18:52:06,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:52:06,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:06,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 18:52:06,219 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:52:06,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:52:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash -403103135, now seen corresponding path program 1 times [2024-11-07 18:52:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:52:06,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934517825] [2024-11-07 18:52:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:52:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:52:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:06,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:52:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:52:06,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:52:06,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934517825] [2024-11-07 18:52:06,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934517825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:52:06,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672571792] [2024-11-07 18:52:06,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:52:06,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:52:06,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:52:06,692 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 18:52:06,696 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 18:52:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:06,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 18:52:06,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:52:06,958 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 18:52:07,074 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-07 18:52:07,074 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 18:52:07,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 18:52:07,195 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 22 treesize of output 10 [2024-11-07 18:52:07,346 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:52:07,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-07 18:52:07,440 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:52:07,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-07 18:52:07,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 18:52:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:52:07,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:52:07,511 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_943 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_943) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-07 18:52:07,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672571792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:52:07,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:52:07,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-07 18:52:07,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388315733] [2024-11-07 18:52:07,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:52:07,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 18:52:07,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:52:07,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 18:52:07,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=457, Unknown=20, NotChecked=44, Total=600 [2024-11-07 18:52:07,616 INFO L87 Difference]: Start difference. First operand 1511 states and 1760 transitions. Second operand has 22 states, 19 states have (on average 7.421052631578948) internal successors, (141), 21 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:52:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:52:12,055 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-07 18:52:12,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 18:52:12,056 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.421052631578948) internal successors, (141), 21 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2024-11-07 18:52:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:52:12,058 INFO L225 Difference]: With dead ends: 1513 [2024-11-07 18:52:12,058 INFO L226 Difference]: Without dead ends: 1513 [2024-11-07 18:52:12,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=633, Unknown=20, NotChecked=52, Total=812 [2024-11-07 18:52:12,059 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1533 mSDsluCounter, 15285 mSDsCounter, 0 mSdLazyCounter, 9590 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 16328 SdHoareTripleChecker+Invalid, 9618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:52:12,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 16328 Invalid, 9618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 9590 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-07 18:52:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-07 18:52:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1510. [2024-11-07 18:52:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1033 states have (on average 1.6786060019361084) internal successors, (1734), 1498 states have internal predecessors, (1734), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-07 18:52:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1759 transitions. [2024-11-07 18:52:12,077 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1759 transitions. Word has length 89 [2024-11-07 18:52:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:52:12,077 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 1759 transitions. [2024-11-07 18:52:12,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.421052631578948) internal successors, (141), 21 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:52:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1759 transitions. [2024-11-07 18:52:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 18:52:12,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:52:12,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:12,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 18:52:12,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:52:12,283 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:52:12,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:52:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash -403103134, now seen corresponding path program 1 times [2024-11-07 18:52:12,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:52:12,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131022977] [2024-11-07 18:52:12,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:52:12,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:52:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:12,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:52:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:52:12,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:52:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131022977] [2024-11-07 18:52:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131022977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:52:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131509430] [2024-11-07 18:52:12,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:52:12,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:52:12,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:52:12,951 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 18:52:12,953 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 18:52:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:13,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 18:52:13,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:52:13,219 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 18:52:13,323 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 18:52:13,331 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:52:13,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 18:52:13,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 18:52:13,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 18:52:13,456 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 22 treesize of output 10 [2024-11-07 18:52:13,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-07 18:52:13,577 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:52:13,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 18:52:13,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 18:52:13,663 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:52:13,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 18:52:13,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 18:52:13,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 18:52:13,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-07 18:52:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:52:13,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:52:13,780 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1092 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1092 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-07 18:52:13,793 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1092 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1092 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-07 18:52:13,844 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1098) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1099))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1098) .cse1 v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-07 18:52:13,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131509430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:52:13,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:52:13,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-07 18:52:13,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919353632] [2024-11-07 18:52:13,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:52:13,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 18:52:13,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:52:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 18:52:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=437, Unknown=3, NotChecked=132, Total=650 [2024-11-07 18:52:13,848 INFO L87 Difference]: Start difference. First operand 1510 states and 1759 transitions. Second operand has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:52:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:52:18,057 INFO L93 Difference]: Finished difference Result 1512 states and 1766 transitions. [2024-11-07 18:52:18,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 18:52:18,057 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2024-11-07 18:52:18,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:52:18,061 INFO L225 Difference]: With dead ends: 1512 [2024-11-07 18:52:18,061 INFO L226 Difference]: Without dead ends: 1512 [2024-11-07 18:52:18,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=693, Unknown=3, NotChecked=168, Total=992 [2024-11-07 18:52:18,062 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 1550 mSDsluCounter, 8652 mSDsCounter, 0 mSdLazyCounter, 8103 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 9701 SdHoareTripleChecker+Invalid, 8144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 8103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:52:18,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 9701 Invalid, 8144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 8103 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-07 18:52:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-07 18:52:18,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1500. [2024-11-07 18:52:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1025 states have (on average 1.681951219512195) internal successors, (1724), 1489 states have internal predecessors, (1724), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:52:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-07 18:52:18,080 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 89 [2024-11-07 18:52:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:52:18,080 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-07 18:52:18,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:52:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-07 18:52:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 18:52:18,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:52:18,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:18,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 18:52:18,285 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,SelfDestructingSolverStorable20 [2024-11-07 18:52:18,286 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:52:18,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:52:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash 255145828, now seen corresponding path program 1 times [2024-11-07 18:52:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:52:18,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94168680] [2024-11-07 18:52:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:52:18,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:52:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:18,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:52:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:18,901 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 18:52:18,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:52:18,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94168680] [2024-11-07 18:52:18,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94168680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:52:18,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:52:18,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 18:52:18,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761312075] [2024-11-07 18:52:18,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:52:18,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 18:52:18,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:52:18,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 18:52:18,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-07 18:52:18,904 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:52:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:52:21,395 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-07 18:52:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 18:52:21,400 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-07 18:52:21,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:52:21,403 INFO L225 Difference]: With dead ends: 1516 [2024-11-07 18:52:21,403 INFO L226 Difference]: Without dead ends: 1516 [2024-11-07 18:52:21,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-07 18:52:21,405 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1572 mSDsluCounter, 9193 mSDsCounter, 0 mSdLazyCounter, 5985 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 10236 SdHoareTripleChecker+Invalid, 6011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:52:21,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 10236 Invalid, 6011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5985 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 18:52:21,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-07 18:52:21,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1512. [2024-11-07 18:52:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1036 states have (on average 1.6766409266409266) internal successors, (1737), 1500 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-07 18:52:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1762 transitions. [2024-11-07 18:52:21,422 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1762 transitions. Word has length 91 [2024-11-07 18:52:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:52:21,422 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1762 transitions. [2024-11-07 18:52:21,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:52:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1762 transitions. [2024-11-07 18:52:21,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 18:52:21,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:52:21,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:21,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 18:52:21,424 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:52:21,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:52:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash 255145829, now seen corresponding path program 1 times [2024-11-07 18:52:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:52:21,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677060871] [2024-11-07 18:52:21,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:52:21,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:52:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:22,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:52:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:22,103 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 18:52:22,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:52:22,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677060871] [2024-11-07 18:52:22,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677060871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:52:22,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:52:22,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 18:52:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648998107] [2024-11-07 18:52:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:52:22,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 18:52:22,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:52:22,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 18:52:22,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-07 18:52:22,106 INFO L87 Difference]: Start difference. First operand 1512 states and 1762 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:52:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:52:25,267 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-07 18:52:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 18:52:25,268 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-07 18:52:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:52:25,271 INFO L225 Difference]: With dead ends: 1515 [2024-11-07 18:52:25,271 INFO L226 Difference]: Without dead ends: 1515 [2024-11-07 18:52:25,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-07 18:52:25,272 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 1566 mSDsluCounter, 7869 mSDsCounter, 0 mSdLazyCounter, 7260 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 8919 SdHoareTripleChecker+Invalid, 7284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:52:25,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 8919 Invalid, 7284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7260 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 18:52:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-07 18:52:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1512. [2024-11-07 18:52:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1036 states have (on average 1.6756756756756757) internal successors, (1736), 1500 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-07 18:52:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1761 transitions. [2024-11-07 18:52:25,287 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1761 transitions. Word has length 91 [2024-11-07 18:52:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:52:25,288 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1761 transitions. [2024-11-07 18:52:25,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:52:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1761 transitions. [2024-11-07 18:52:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 18:52:25,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:52:25,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:25,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 18:52:25,289 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:52:25,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:52:25,289 INFO L85 PathProgramCache]: Analyzing trace with hash -116305572, now seen corresponding path program 1 times [2024-11-07 18:52:25,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:52:25,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162594494] [2024-11-07 18:52:25,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:52:25,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:52:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:25,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:52:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:52:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:52:25,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162594494] [2024-11-07 18:52:25,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162594494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:52:25,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130671553] [2024-11-07 18:52:25,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:52:25,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:52:25,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:52:25,757 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 18:52:25,759 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 18:52:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:25,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 18:52:25,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:52:25,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 6 treesize of output 5 [2024-11-07 18:52:26,093 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-07 18:52:26,093 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 18:52:26,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 18:52:26,195 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 22 treesize of output 10 [2024-11-07 18:52:26,305 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:52:26,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-07 18:52:26,365 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:52:26,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-07 18:52:26,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:52:26,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-07 18:52:26,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 18:52:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:52:26,449 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:52:26,483 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1387 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1387) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-07 18:52:26,491 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1386 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1386))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1387)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-07 18:52:26,496 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1386 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1386))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1387)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-07 18:52:26,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130671553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:52:26,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:52:26,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-07 18:52:26,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384913318] [2024-11-07 18:52:26,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:52:26,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 18:52:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:52:26,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 18:52:26,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=545, Unknown=20, NotChecked=150, Total=812 [2024-11-07 18:52:26,563 INFO L87 Difference]: Start difference. First operand 1512 states and 1761 transitions. Second operand has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:52:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:52:30,774 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-07 18:52:30,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 18:52:30,774 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 92 [2024-11-07 18:52:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:52:30,777 INFO L225 Difference]: With dead ends: 1514 [2024-11-07 18:52:30,777 INFO L226 Difference]: Without dead ends: 1514 [2024-11-07 18:52:30,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=634, Unknown=21, NotChecked=162, Total=930 [2024-11-07 18:52:30,778 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 1532 mSDsluCounter, 15257 mSDsCounter, 0 mSdLazyCounter, 9530 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 16305 SdHoareTripleChecker+Invalid, 9567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 9530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:52:30,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 16305 Invalid, 9567 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 9530 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-07 18:52:30,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-07 18:52:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1511. [2024-11-07 18:52:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1036 states have (on average 1.6747104247104247) internal successors, (1735), 1499 states have internal predecessors, (1735), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-07 18:52:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1760 transitions. [2024-11-07 18:52:30,794 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1760 transitions. Word has length 92 [2024-11-07 18:52:30,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:52:30,794 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1760 transitions. [2024-11-07 18:52:30,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:52:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1760 transitions. [2024-11-07 18:52:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 18:52:30,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:52:30,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:30,814 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 18:52:30,995 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,SelfDestructingSolverStorable23 [2024-11-07 18:52:30,996 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:52:30,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:52:30,996 INFO L85 PathProgramCache]: Analyzing trace with hash -116305571, now seen corresponding path program 1 times [2024-11-07 18:52:30,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:52:30,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046903583] [2024-11-07 18:52:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:52:30,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:52:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:31,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:52:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:52:31,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:52:31,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046903583] [2024-11-07 18:52:31,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046903583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:52:31,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755100132] [2024-11-07 18:52:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:52:31,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:52:31,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:52:31,731 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 18:52:31,733 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 18:52:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:31,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-07 18:52:31,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:52:32,002 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 18:52:32,087 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:52:32,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 18:52:32,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 18:52:32,103 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 18:52:32,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 18:52:32,144 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 22 treesize of output 10 [2024-11-07 18:52:32,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-07 18:52:32,224 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:52:32,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 18:52:32,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 18:52:32,281 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:52:32,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 18:52:32,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 18:52:32,331 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:52:32,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 18:52:32,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 18:52:32,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 18:52:32,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-07 18:52:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:52:32,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:52:32,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1551 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-07 18:52:32,415 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1551 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-07 18:52:32,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1549))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1548) .cse0 v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1548) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-07 18:52:32,578 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1556))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1557) .cse0 v_ArrVal_1548) (select (select (store .cse1 .cse0 v_ArrVal_1549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1551))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1556))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1549))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1548) .cse4 v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-07 18:52:32,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755100132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:52:32,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:52:32,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2024-11-07 18:52:32,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238729654] [2024-11-07 18:52:32,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:52:32,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 18:52:32,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:52:32,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 18:52:32,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=393, Unknown=7, NotChecked=172, Total=650 [2024-11-07 18:52:32,583 INFO L87 Difference]: Start difference. First operand 1511 states and 1760 transitions. Second operand has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:52:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:52:37,509 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-07 18:52:37,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 18:52:37,510 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-07 18:52:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:52:37,513 INFO L225 Difference]: With dead ends: 1513 [2024-11-07 18:52:37,513 INFO L226 Difference]: Without dead ends: 1513 [2024-11-07 18:52:37,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=793, Unknown=7, NotChecked=244, Total=1190 [2024-11-07 18:52:37,514 INFO L432 NwaCegarLoop]: 1041 mSDtfsCounter, 1540 mSDsluCounter, 9192 mSDsCounter, 0 mSdLazyCounter, 9211 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 10233 SdHoareTripleChecker+Invalid, 9239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-07 18:52:37,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 10233 Invalid, 9239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 9211 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-07 18:52:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-07 18:52:37,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1498. [2024-11-07 18:52:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1025 states have (on average 1.68) internal successors, (1722), 1487 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 18:52:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1746 transitions. [2024-11-07 18:52:37,531 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1746 transitions. Word has length 92 [2024-11-07 18:52:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:52:37,532 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1746 transitions. [2024-11-07 18:52:37,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:52:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1746 transitions. [2024-11-07 18:52:37,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 18:52:37,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:52:37,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:37,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-07 18:52:37,733 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,SelfDestructingSolverStorable24 [2024-11-07 18:52:37,734 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:52:37,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:52:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1042115424, now seen corresponding path program 1 times [2024-11-07 18:52:37,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:52:37,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707799845] [2024-11-07 18:52:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:52:37,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:52:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:38,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:52:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:38,271 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 18:52:38,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:52:38,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707799845] [2024-11-07 18:52:38,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707799845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:52:38,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:52:38,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 18:52:38,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326688887] [2024-11-07 18:52:38,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:52:38,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 18:52:38,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:52:38,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 18:52:38,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-07 18:52:38,273 INFO L87 Difference]: Start difference. First operand 1498 states and 1746 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:52:40,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:52:40,442 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-07 18:52:40,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 18:52:40,443 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-07 18:52:40,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:52:40,445 INFO L225 Difference]: With dead ends: 1517 [2024-11-07 18:52:40,445 INFO L226 Difference]: Without dead ends: 1517 [2024-11-07 18:52:40,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-07 18:52:40,446 INFO L432 NwaCegarLoop]: 1042 mSDtfsCounter, 1575 mSDsluCounter, 8137 mSDsCounter, 0 mSdLazyCounter, 5378 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 9179 SdHoareTripleChecker+Invalid, 5404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:52:40,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 9179 Invalid, 5404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5378 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 18:52:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-07 18:52:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1513. [2024-11-07 18:52:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1039 states have (on average 1.672762271414822) internal successors, (1738), 1501 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-07 18:52:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1763 transitions. [2024-11-07 18:52:40,457 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1763 transitions. Word has length 94 [2024-11-07 18:52:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:52:40,457 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1763 transitions. [2024-11-07 18:52:40,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:52:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1763 transitions. [2024-11-07 18:52:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 18:52:40,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:52:40,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:40,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 18:52:40,458 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-07 18:52:40,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:52:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1042115423, now seen corresponding path program 1 times [2024-11-07 18:52:40,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:52:40,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003684713] [2024-11-07 18:52:40,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:52:40,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:52:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:41,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:52:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:52:41,094 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 18:52:41,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:52:41,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003684713] [2024-11-07 18:52:41,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003684713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:52:41,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:52:41,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 18:52:41,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571057831] [2024-11-07 18:52:41,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:52:41,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 18:52:41,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:52:41,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 18:52:41,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-07 18:52:41,095 INFO L87 Difference]: Start difference. First operand 1513 states and 1763 transitions. Second operand has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)