./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:33:35,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:33:35,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:33:35,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:33:35,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:33:35,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:33:35,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:33:35,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:33:35,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:33:35,152 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:33:35,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:33:35,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:33:35,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:33:35,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:33:35,153 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:33:35,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:33:35,154 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:33:35,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:33:35,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:33:35,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:33:35,155 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:33:35,155 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:33:35,156 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:33:35,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:33:35,156 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:33:35,156 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:33:35,157 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:33:35,157 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:33:35,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:33:35,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:33:35,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:33:35,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:33:35,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:33:35,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:33:35,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:33:35,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:33:35,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:33:35,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:33:35,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:33:35,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:33:35,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:33:35,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:33:35,161 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 [2024-10-13 12:33:35,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:33:35,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:33:35,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:33:35,512 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:33:35,513 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:33:35,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-10-13 12:33:37,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:33:37,320 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:33:37,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-10-13 12:33:37,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f007960d1/987d12ef6967401b958460d82ad01f1f/FLAGc7fc0da99 [2024-10-13 12:33:37,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f007960d1/987d12ef6967401b958460d82ad01f1f [2024-10-13 12:33:37,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:33:37,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:33:37,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:33:37,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:33:37,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:33:37,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:33:37" (1/1) ... [2024-10-13 12:33:37,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f24757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:37, skipping insertion in model container [2024-10-13 12:33:37,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:33:37" (1/1) ... [2024-10-13 12:33:37,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:33:37,887 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:37,887 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:37,888 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:37,889 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:37,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:33:37,945 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 12:33:37,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2e77ed13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:37, skipping insertion in model container [2024-10-13 12:33:37,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:33:37,946 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 12:33:37,948 INFO L158 Benchmark]: Toolchain (without parser) took 569.46ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 51.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 12:33:37,948 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 105.6MB in the end (delta: 275.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:33:37,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.06ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 51.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 12:33:37,950 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 105.6MB in the end (delta: 275.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.06ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 51.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1058]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:33:39,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:33:39,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:33:39,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:33:39,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:33:39,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:33:39,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:33:39,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:33:39,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:33:39,985 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:33:39,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:33:39,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:33:39,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:33:39,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:33:39,988 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:33:39,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:33:39,988 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:33:39,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:33:39,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:33:39,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:33:39,989 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:33:39,992 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:33:39,992 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:33:39,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:33:39,992 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:33:39,992 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:33:39,993 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:33:39,993 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:33:39,993 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:33:39,993 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:33:39,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:33:39,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:33:39,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:33:39,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:33:39,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:33:39,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:33:39,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:33:39,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:33:39,995 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:33:39,995 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:33:39,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:33:39,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:33:39,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:33:39,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:33:39,998 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:33:39,998 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 [2024-10-13 12:33:40,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:33:40,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:33:40,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:33:40,299 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:33:40,299 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:33:40,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-10-13 12:33:41,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:33:41,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:33:41,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-10-13 12:33:41,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d532db0d/177c293145b140898de4a4cfcf5a3171/FLAGe5a9f47b2 [2024-10-13 12:33:42,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d532db0d/177c293145b140898de4a4cfcf5a3171 [2024-10-13 12:33:42,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:33:42,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:33:42,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:33:42,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:33:42,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:33:42,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:42,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d01038c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42, skipping insertion in model container [2024-10-13 12:33:42,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:42,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:33:42,518 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:42,519 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:42,519 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:42,520 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:42,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:33:42,584 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 12:33:42,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:33:42,630 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:42,630 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:42,630 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:42,631 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:42,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:33:42,663 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:33:42,703 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:42,705 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:42,705 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:42,706 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:42,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:33:42,805 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:33:42,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42 WrapperNode [2024-10-13 12:33:42,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:33:42,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:33:42,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:33:42,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:33:42,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:42,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:42,889 INFO L138 Inliner]: procedures = 284, calls = 56, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 235 [2024-10-13 12:33:42,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:33:42,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:33:42,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:33:42,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:33:42,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:42,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:42,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:42,949 INFO L175 MemorySlicer]: Split 30 memory accesses to 4 slices as follows [2, 21, 5, 2]. 70 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0]. The 14 writes are split as follows [0, 13, 0, 1]. [2024-10-13 12:33:42,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:42,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:42,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:42,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:42,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:42,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:42,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:33:43,001 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:33:43,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:33:43,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:33:43,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42" (1/1) ... [2024-10-13 12:33:43,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:33:43,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:33:43,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:33:43,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:33:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 12:33:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 12:33:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 12:33:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-13 12:33:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 12:33:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 12:33:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 12:33:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 12:33:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 12:33:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 12:33:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 12:33:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 12:33:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 12:33:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-13 12:33:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:33:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 12:33:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 12:33:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 12:33:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 12:33:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 12:33:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-13 12:33:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-13 12:33:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 12:33:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 12:33:43,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 12:33:43,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:33:43,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 12:33:43,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 12:33:43,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 12:33:43,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 12:33:43,092 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-13 12:33:43,092 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-13 12:33:43,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:33:43,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:33:43,094 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:33:43,275 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:33:43,277 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:33:43,820 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:33:43,821 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:33:44,040 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:33:44,040 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-13 12:33:44,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:33:44 BoogieIcfgContainer [2024-10-13 12:33:44,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:33:44,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:33:44,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:33:44,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:33:44,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:33:42" (1/3) ... [2024-10-13 12:33:44,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b7940c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:33:44, skipping insertion in model container [2024-10-13 12:33:44,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:42" (2/3) ... [2024-10-13 12:33:44,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b7940c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:33:44, skipping insertion in model container [2024-10-13 12:33:44,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:33:44" (3/3) ... [2024-10-13 12:33:44,049 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_93-evilcollapse_racefree.i [2024-10-13 12:33:44,068 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:33:44,071 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-13 12:33:44,071 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:33:44,136 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-13 12:33:44,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 130 transitions, 267 flow [2024-10-13 12:33:44,204 INFO L124 PetriNetUnfolderBase]: 19/142 cut-off events. [2024-10-13 12:33:44,204 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:33:44,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 142 events. 19/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 531 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2024-10-13 12:33:44,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 130 transitions, 267 flow [2024-10-13 12:33:44,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 130 transitions, 267 flow [2024-10-13 12:33:44,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:33:44,221 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;@20c7e483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:33:44,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-10-13 12:33:44,224 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:33:44,224 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-13 12:33:44,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:33:44,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:44,225 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:33:44,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:44,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash 689099, now seen corresponding path program 1 times [2024-10-13 12:33:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543137270] [2024-10-13 12:33:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:44,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:44,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:44,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:44,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 12:33:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:44,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:33:44,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:44,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:44,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:44,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:44,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543137270] [2024-10-13 12:33:44,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543137270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:44,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:44,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:33:44,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372292210] [2024-10-13 12:33:44,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:44,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:33:44,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:44,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:33:44,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:33:44,582 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 130 [2024-10-13 12:33:44,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 130 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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-10-13 12:33:44,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:44,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 130 [2024-10-13 12:33:44,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:45,081 INFO L124 PetriNetUnfolderBase]: 126/487 cut-off events. [2024-10-13 12:33:45,082 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-10-13 12:33:45,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 487 events. 126/487 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2675 event pairs, 64 based on Foata normal form. 52/430 useless extension candidates. Maximal degree in co-relation 675. Up to 179 conditions per place. [2024-10-13 12:33:45,095 INFO L140 encePairwiseOnDemand]: 109/130 looper letters, 68 selfloop transitions, 4 changer transitions 0/136 dead transitions. [2024-10-13 12:33:45,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 136 transitions, 423 flow [2024-10-13 12:33:45,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:33:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:33:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 357 transitions. [2024-10-13 12:33:45,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6865384615384615 [2024-10-13 12:33:45,144 INFO L175 Difference]: Start difference. First operand has 114 places, 130 transitions, 267 flow. Second operand 4 states and 357 transitions. [2024-10-13 12:33:45,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 136 transitions, 423 flow [2024-10-13 12:33:45,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 136 transitions, 423 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:33:45,154 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 247 flow [2024-10-13 12:33:45,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-10-13 12:33:45,175 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -1 predicate places. [2024-10-13 12:33:45,175 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 247 flow [2024-10-13 12:33:45,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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-10-13 12:33:45,176 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:45,176 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:33:45,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:33:45,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:45,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:45,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:45,384 INFO L85 PathProgramCache]: Analyzing trace with hash 689100, now seen corresponding path program 1 times [2024-10-13 12:33:45,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:45,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9952217] [2024-10-13 12:33:45,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:45,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:45,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:45,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:45,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 12:33:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:45,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:33:45,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:45,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:45,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:45,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9952217] [2024-10-13 12:33:45,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9952217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:45,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:45,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:33:45,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732057579] [2024-10-13 12:33:45,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:45,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:33:45,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:45,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:33:45,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:33:45,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 130 [2024-10-13 12:33:45,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-10-13 12:33:45,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:45,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 130 [2024-10-13 12:33:45,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:45,976 INFO L124 PetriNetUnfolderBase]: 128/518 cut-off events. [2024-10-13 12:33:45,976 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-10-13 12:33:45,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 518 events. 128/518 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2781 event pairs, 105 based on Foata normal form. 3/409 useless extension candidates. Maximal degree in co-relation 743. Up to 276 conditions per place. [2024-10-13 12:33:45,979 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 49 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2024-10-13 12:33:45,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 117 transitions, 369 flow [2024-10-13 12:33:45,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:33:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:33:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2024-10-13 12:33:45,982 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-10-13 12:33:45,982 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 247 flow. Second operand 4 states and 325 transitions. [2024-10-13 12:33:45,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 117 transitions, 369 flow [2024-10-13 12:33:45,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 357 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:33:45,985 INFO L231 Difference]: Finished difference. Result has 115 places, 117 transitions, 280 flow [2024-10-13 12:33:45,985 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=115, PETRI_TRANSITIONS=117} [2024-10-13 12:33:45,986 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-10-13 12:33:45,986 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 280 flow [2024-10-13 12:33:45,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-10-13 12:33:45,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:45,986 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:33:45,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 12:33:46,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:46,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:46,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash -945239132, now seen corresponding path program 1 times [2024-10-13 12:33:46,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:46,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377926264] [2024-10-13 12:33:46,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:46,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:46,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:46,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:46,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 12:33:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:46,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:33:46,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:46,293 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 7 [2024-10-13 12:33:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:46,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:46,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:46,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377926264] [2024-10-13 12:33:46,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377926264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:46,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:46,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:33:46,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924706393] [2024-10-13 12:33:46,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:46,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:33:46,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:46,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:33:46,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:33:46,393 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 130 [2024-10-13 12:33:46,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 117 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-10-13 12:33:46,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:46,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 130 [2024-10-13 12:33:46,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:46,589 INFO L124 PetriNetUnfolderBase]: 128/517 cut-off events. [2024-10-13 12:33:46,589 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2024-10-13 12:33:46,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 517 events. 128/517 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2774 event pairs, 105 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 810. Up to 272 conditions per place. [2024-10-13 12:33:46,592 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 47 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2024-10-13 12:33:46,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 378 flow [2024-10-13 12:33:46,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:33:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:33:46,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-10-13 12:33:46,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.658974358974359 [2024-10-13 12:33:46,594 INFO L175 Difference]: Start difference. First operand has 115 places, 117 transitions, 280 flow. Second operand 3 states and 257 transitions. [2024-10-13 12:33:46,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 378 flow [2024-10-13 12:33:46,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:33:46,597 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 281 flow [2024-10-13 12:33:46,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2024-10-13 12:33:46,597 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-10-13 12:33:46,598 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 281 flow [2024-10-13 12:33:46,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-10-13 12:33:46,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:46,598 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:33:46,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 12:33:46,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:46,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:46,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:46,799 INFO L85 PathProgramCache]: Analyzing trace with hash -945239131, now seen corresponding path program 1 times [2024-10-13 12:33:46,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:46,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635225039] [2024-10-13 12:33:46,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:46,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:46,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:46,802 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:46,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 12:33:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:46,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:33:46,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:46,889 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-10-13 12:33:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:46,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:46,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:46,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635225039] [2024-10-13 12:33:46,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635225039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:46,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:46,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:33:46,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393902553] [2024-10-13 12:33:46,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:46,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:33:46,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:46,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:33:46,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:33:47,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 130 [2024-10-13 12:33:47,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-10-13 12:33:47,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:47,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 130 [2024-10-13 12:33:47,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:47,193 INFO L124 PetriNetUnfolderBase]: 128/516 cut-off events. [2024-10-13 12:33:47,193 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2024-10-13 12:33:47,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 516 events. 128/516 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2775 event pairs, 105 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 809. Up to 272 conditions per place. [2024-10-13 12:33:47,195 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 47 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2024-10-13 12:33:47,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 379 flow [2024-10-13 12:33:47,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:33:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:33:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-10-13 12:33:47,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.658974358974359 [2024-10-13 12:33:47,197 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 281 flow. Second operand 3 states and 257 transitions. [2024-10-13 12:33:47,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 379 flow [2024-10-13 12:33:47,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:33:47,199 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 279 flow [2024-10-13 12:33:47,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2024-10-13 12:33:47,200 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2024-10-13 12:33:47,200 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 279 flow [2024-10-13 12:33:47,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-10-13 12:33:47,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:47,200 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-13 12:33:47,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 12:33:47,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:47,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:47,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash 762360213, now seen corresponding path program 1 times [2024-10-13 12:33:47,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:47,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779704654] [2024-10-13 12:33:47,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:47,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:47,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:47,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:47,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 12:33:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:47,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:33:47,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:47,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:47,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779704654] [2024-10-13 12:33:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779704654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:47,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:47,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:33:47,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983828430] [2024-10-13 12:33:47,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:47,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:33:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:47,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:33:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:33:47,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-10-13 12:33:47,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-10-13 12:33:47,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:47,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-10-13 12:33:47,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:47,823 INFO L124 PetriNetUnfolderBase]: 127/538 cut-off events. [2024-10-13 12:33:47,823 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-10-13 12:33:47,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 538 events. 127/538 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2818 event pairs, 105 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 840. Up to 272 conditions per place. [2024-10-13 12:33:47,828 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 51 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2024-10-13 12:33:47,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 119 transitions, 399 flow [2024-10-13 12:33:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:33:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:33:47,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2024-10-13 12:33:47,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2024-10-13 12:33:47,830 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 279 flow. Second operand 3 states and 265 transitions. [2024-10-13 12:33:47,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 119 transitions, 399 flow [2024-10-13 12:33:47,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 119 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:33:47,836 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 284 flow [2024-10-13 12:33:47,836 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=115, PETRI_TRANSITIONS=115} [2024-10-13 12:33:47,837 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-10-13 12:33:47,837 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 284 flow [2024-10-13 12:33:47,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-10-13 12:33:47,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:47,837 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:47,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 12:33:48,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:48,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:48,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash 762358701, now seen corresponding path program 1 times [2024-10-13 12:33:48,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:48,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085025289] [2024-10-13 12:33:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:48,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:48,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:48,053 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:48,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 12:33:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:48,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:33:48,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:48,199 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-10-13 12:33:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:48,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:48,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085025289] [2024-10-13 12:33:48,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085025289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:48,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:48,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:33:48,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103233630] [2024-10-13 12:33:48,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:48,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:33:48,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:48,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:33:48,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:33:48,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-10-13 12:33:48,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 115 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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-10-13 12:33:48,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:48,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-10-13 12:33:48,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:48,610 INFO L124 PetriNetUnfolderBase]: 127/534 cut-off events. [2024-10-13 12:33:48,610 INFO L125 PetriNetUnfolderBase]: For 32/33 co-relation queries the response was YES. [2024-10-13 12:33:48,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 534 events. 127/534 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2803 event pairs, 105 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 836. Up to 276 conditions per place. [2024-10-13 12:33:48,613 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 48 selfloop transitions, 4 changer transitions 0/113 dead transitions. [2024-10-13 12:33:48,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 384 flow [2024-10-13 12:33:48,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:33:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:33:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2024-10-13 12:33:48,615 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6038461538461538 [2024-10-13 12:33:48,615 INFO L175 Difference]: Start difference. First operand has 115 places, 115 transitions, 284 flow. Second operand 4 states and 314 transitions. [2024-10-13 12:33:48,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 384 flow [2024-10-13 12:33:48,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 113 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:33:48,618 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 285 flow [2024-10-13 12:33:48,618 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2024-10-13 12:33:48,619 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-10-13 12:33:48,620 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 285 flow [2024-10-13 12:33:48,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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-10-13 12:33:48,620 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:48,621 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:48,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 12:33:48,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:48,824 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:48,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:48,825 INFO L85 PathProgramCache]: Analyzing trace with hash 762358700, now seen corresponding path program 1 times [2024-10-13 12:33:48,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:48,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047417665] [2024-10-13 12:33:48,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:48,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:48,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:48,831 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:48,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 12:33:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:48,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:33:48,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:48,957 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 7 [2024-10-13 12:33:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:48,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:48,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:48,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047417665] [2024-10-13 12:33:48,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047417665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:48,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:48,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:33:48,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029962717] [2024-10-13 12:33:48,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:48,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:33:48,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:48,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:33:48,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:33:49,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 130 [2024-10-13 12:33:49,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 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-10-13 12:33:49,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:49,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 130 [2024-10-13 12:33:49,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:49,282 INFO L124 PetriNetUnfolderBase]: 127/530 cut-off events. [2024-10-13 12:33:49,282 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-10-13 12:33:49,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 530 events. 127/530 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2788 event pairs, 105 based on Foata normal form. 2/416 useless extension candidates. Maximal degree in co-relation 840. Up to 274 conditions per place. [2024-10-13 12:33:49,285 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 45 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2024-10-13 12:33:49,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 385 flow [2024-10-13 12:33:49,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:33:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:33:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2024-10-13 12:33:49,286 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2024-10-13 12:33:49,286 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 285 flow. Second operand 5 states and 370 transitions. [2024-10-13 12:33:49,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 385 flow [2024-10-13 12:33:49,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 377 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:33:49,288 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 287 flow [2024-10-13 12:33:49,288 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2024-10-13 12:33:49,289 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2024-10-13 12:33:49,289 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 287 flow [2024-10-13 12:33:49,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 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-10-13 12:33:49,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:49,290 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:49,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-13 12:33:49,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:49,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:49,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:49,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1812674210, now seen corresponding path program 1 times [2024-10-13 12:33:49,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:49,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000430107] [2024-10-13 12:33:49,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:49,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:49,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:49,494 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:49,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 12:33:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:49,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:33:49,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:49,664 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 12:33:49,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-13 12:33:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:49,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:49,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:49,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000430107] [2024-10-13 12:33:49,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000430107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:49,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:49,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:33:49,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448348691] [2024-10-13 12:33:49,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:49,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:33:49,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:49,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:33:49,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:33:49,803 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-10-13 12:33:49,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 111 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-10-13 12:33:49,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:49,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-10-13 12:33:49,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:50,021 INFO L124 PetriNetUnfolderBase]: 126/500 cut-off events. [2024-10-13 12:33:50,021 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2024-10-13 12:33:50,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 500 events. 126/500 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2623 event pairs, 64 based on Foata normal form. 2/396 useless extension candidates. Maximal degree in co-relation 812. Up to 182 conditions per place. [2024-10-13 12:33:50,023 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 69 selfloop transitions, 5 changer transitions 0/132 dead transitions. [2024-10-13 12:33:50,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 132 transitions, 477 flow [2024-10-13 12:33:50,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:33:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:33:50,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 336 transitions. [2024-10-13 12:33:50,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2024-10-13 12:33:50,024 INFO L175 Difference]: Start difference. First operand has 114 places, 111 transitions, 287 flow. Second operand 4 states and 336 transitions. [2024-10-13 12:33:50,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 132 transitions, 477 flow [2024-10-13 12:33:50,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 132 transitions, 463 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:33:50,026 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 279 flow [2024-10-13 12:33:50,027 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2024-10-13 12:33:50,027 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2024-10-13 12:33:50,027 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 279 flow [2024-10-13 12:33:50,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-10-13 12:33:50,028 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:50,028 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:50,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 12:33:50,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:50,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:50,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:50,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1812674209, now seen corresponding path program 1 times [2024-10-13 12:33:50,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:50,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017507404] [2024-10-13 12:33:50,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:50,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:50,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:50,235 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:50,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 12:33:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:50,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:33:50,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:50,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:33:50,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 12:33:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:50,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:50,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017507404] [2024-10-13 12:33:50,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017507404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:50,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:50,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:33:50,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215544329] [2024-10-13 12:33:50,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:50,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:33:50,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:50,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:33:50,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:33:50,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-10-13 12:33:50,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 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-10-13 12:33:50,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:50,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-10-13 12:33:50,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:51,014 INFO L124 PetriNetUnfolderBase]: 129/558 cut-off events. [2024-10-13 12:33:51,014 INFO L125 PetriNetUnfolderBase]: For 51/52 co-relation queries the response was YES. [2024-10-13 12:33:51,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 558 events. 129/558 cut-off events. For 51/52 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3042 event pairs, 106 based on Foata normal form. 2/434 useless extension candidates. Maximal degree in co-relation 856. Up to 283 conditions per place. [2024-10-13 12:33:51,017 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 55 selfloop transitions, 5 changer transitions 0/116 dead transitions. [2024-10-13 12:33:51,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 116 transitions, 429 flow [2024-10-13 12:33:51,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:33:51,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:33:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2024-10-13 12:33:51,019 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6211538461538462 [2024-10-13 12:33:51,019 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 279 flow. Second operand 4 states and 323 transitions. [2024-10-13 12:33:51,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 116 transitions, 429 flow [2024-10-13 12:33:51,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 413 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:33:51,021 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 315 flow [2024-10-13 12:33:51,022 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=315, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-10-13 12:33:51,022 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -1 predicate places. [2024-10-13 12:33:51,022 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 315 flow [2024-10-13 12:33:51,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 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-10-13 12:33:51,023 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:51,023 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:51,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 12:33:51,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:51,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:51,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash -358324880, now seen corresponding path program 1 times [2024-10-13 12:33:51,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:51,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225282753] [2024-10-13 12:33:51,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:51,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:51,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:51,232 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:51,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 12:33:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:51,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 12:33:51,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:51,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 12:33:51,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 12:33:51,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-13 12:33:51,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 12:33:51,560 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 12:33:51,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-13 12:33:51,576 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:33:51,576 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 13 treesize of output 13 [2024-10-13 12:33:51,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 12:33:51,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-13 12:33:51,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 12:33:51,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-13 12:33:51,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-13 12:33:51,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 12:33:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:51,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:51,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:51,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225282753] [2024-10-13 12:33:51,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225282753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:51,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:51,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:33:51,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542581090] [2024-10-13 12:33:51,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:51,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:33:51,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:51,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:33:51,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:33:52,776 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 130 [2024-10-13 12:33:52,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 315 flow. Second operand has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 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-10-13 12:33:52,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:52,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 130 [2024-10-13 12:33:52,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:53,441 INFO L124 PetriNetUnfolderBase]: 129/557 cut-off events. [2024-10-13 12:33:53,441 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2024-10-13 12:33:53,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 557 events. 129/557 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3017 event pairs, 106 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 867. Up to 296 conditions per place. [2024-10-13 12:33:53,443 INFO L140 encePairwiseOnDemand]: 118/130 looper letters, 70 selfloop transitions, 11 changer transitions 0/129 dead transitions. [2024-10-13 12:33:53,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 129 transitions, 515 flow [2024-10-13 12:33:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:33:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:33:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 642 transitions. [2024-10-13 12:33:53,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4489510489510489 [2024-10-13 12:33:53,445 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 315 flow. Second operand 11 states and 642 transitions. [2024-10-13 12:33:53,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 129 transitions, 515 flow [2024-10-13 12:33:53,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 129 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:33:53,447 INFO L231 Difference]: Finished difference. Result has 127 places, 118 transitions, 371 flow [2024-10-13 12:33:53,448 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=371, PETRI_PLACES=127, PETRI_TRANSITIONS=118} [2024-10-13 12:33:53,448 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 13 predicate places. [2024-10-13 12:33:53,448 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 118 transitions, 371 flow [2024-10-13 12:33:53,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 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-10-13 12:33:53,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:53,449 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:53,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 12:33:53,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:53,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:53,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:53,654 INFO L85 PathProgramCache]: Analyzing trace with hash -358324881, now seen corresponding path program 1 times [2024-10-13 12:33:53,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:53,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499529080] [2024-10-13 12:33:53,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:53,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:53,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:53,657 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:53,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 12:33:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:53,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 12:33:53,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:53,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 12:33:53,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2024-10-13 12:33:54,037 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-10-13 12:33:54,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16 [2024-10-13 12:33:54,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-13 12:33:54,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-13 12:33:54,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 12:33:54,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:54,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:54,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:54,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499529080] [2024-10-13 12:33:54,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499529080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:54,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:54,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:33:54,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319915243] [2024-10-13 12:33:54,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:54,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:33:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:54,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:33:54,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:33:55,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 130 [2024-10-13 12:33:55,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 118 transitions, 371 flow. Second operand has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 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-10-13 12:33:55,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:55,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 130 [2024-10-13 12:33:55,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:55,887 INFO L124 PetriNetUnfolderBase]: 127/527 cut-off events. [2024-10-13 12:33:55,888 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2024-10-13 12:33:55,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 527 events. 127/527 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2873 event pairs, 64 based on Foata normal form. 2/427 useless extension candidates. Maximal degree in co-relation 876. Up to 194 conditions per place. [2024-10-13 12:33:55,890 INFO L140 encePairwiseOnDemand]: 118/130 looper letters, 77 selfloop transitions, 20 changer transitions 0/149 dead transitions. [2024-10-13 12:33:55,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 149 transitions, 637 flow [2024-10-13 12:33:55,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:33:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:33:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 713 transitions. [2024-10-13 12:33:55,892 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4986013986013986 [2024-10-13 12:33:55,892 INFO L175 Difference]: Start difference. First operand has 127 places, 118 transitions, 371 flow. Second operand 11 states and 713 transitions. [2024-10-13 12:33:55,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 149 transitions, 637 flow [2024-10-13 12:33:55,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 149 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:33:55,894 INFO L231 Difference]: Finished difference. Result has 140 places, 123 transitions, 459 flow [2024-10-13 12:33:55,895 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=459, PETRI_PLACES=140, PETRI_TRANSITIONS=123} [2024-10-13 12:33:55,895 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places. [2024-10-13 12:33:55,895 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 123 transitions, 459 flow [2024-10-13 12:33:55,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 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-10-13 12:33:55,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:55,896 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:55,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 12:33:56,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:56,100 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:56,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:56,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1776831246, now seen corresponding path program 1 times [2024-10-13 12:33:56,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:56,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522021148] [2024-10-13 12:33:56,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:56,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:56,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:56,103 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:56,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 12:33:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:56,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:33:56,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:56,227 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-10-13 12:33:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:56,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:56,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:56,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522021148] [2024-10-13 12:33:56,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522021148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:56,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:56,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:33:56,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005337056] [2024-10-13 12:33:56,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:56,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:33:56,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:56,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:33:56,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:33:56,447 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 130 [2024-10-13 12:33:56,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 123 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 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-10-13 12:33:56,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:56,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 130 [2024-10-13 12:33:56,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:56,640 INFO L124 PetriNetUnfolderBase]: 128/545 cut-off events. [2024-10-13 12:33:56,640 INFO L125 PetriNetUnfolderBase]: For 120/121 co-relation queries the response was YES. [2024-10-13 12:33:56,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 545 events. 128/545 cut-off events. For 120/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2956 event pairs, 105 based on Foata normal form. 8/446 useless extension candidates. Maximal degree in co-relation 927. Up to 273 conditions per place. [2024-10-13 12:33:56,643 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 50 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2024-10-13 12:33:56,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 121 transitions, 577 flow [2024-10-13 12:33:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:33:56,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:33:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 320 transitions. [2024-10-13 12:33:56,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-10-13 12:33:56,644 INFO L175 Difference]: Start difference. First operand has 140 places, 123 transitions, 459 flow. Second operand 4 states and 320 transitions. [2024-10-13 12:33:56,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 121 transitions, 577 flow [2024-10-13 12:33:56,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 121 transitions, 553 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-10-13 12:33:56,647 INFO L231 Difference]: Finished difference. Result has 136 places, 121 transitions, 453 flow [2024-10-13 12:33:56,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=453, PETRI_PLACES=136, PETRI_TRANSITIONS=121} [2024-10-13 12:33:56,648 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 22 predicate places. [2024-10-13 12:33:56,648 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 121 transitions, 453 flow [2024-10-13 12:33:56,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 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-10-13 12:33:56,648 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:56,648 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:56,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-13 12:33:56,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:56,853 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:56,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:56,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1776831245, now seen corresponding path program 1 times [2024-10-13 12:33:56,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:56,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126107097] [2024-10-13 12:33:56,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:56,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:56,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:56,856 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:56,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 12:33:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:56,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:33:56,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:56,966 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 7 [2024-10-13 12:33:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:56,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:56,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:56,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126107097] [2024-10-13 12:33:56,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126107097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:56,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:56,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:33:56,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519866888] [2024-10-13 12:33:56,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:56,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:33:56,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:56,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:33:56,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:33:57,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-10-13 12:33:57,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 121 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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-10-13 12:33:57,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:57,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-10-13 12:33:57,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:57,320 INFO L124 PetriNetUnfolderBase]: 128/537 cut-off events. [2024-10-13 12:33:57,320 INFO L125 PetriNetUnfolderBase]: For 116/117 co-relation queries the response was YES. [2024-10-13 12:33:57,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 537 events. 128/537 cut-off events. For 116/117 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2891 event pairs, 105 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 904. Up to 273 conditions per place. [2024-10-13 12:33:57,323 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 52 selfloop transitions, 11 changer transitions 0/119 dead transitions. [2024-10-13 12:33:57,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 119 transitions, 575 flow [2024-10-13 12:33:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:33:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:33:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2024-10-13 12:33:57,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6038461538461538 [2024-10-13 12:33:57,325 INFO L175 Difference]: Start difference. First operand has 136 places, 121 transitions, 453 flow. Second operand 4 states and 314 transitions. [2024-10-13 12:33:57,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 119 transitions, 575 flow [2024-10-13 12:33:57,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 119 transitions, 553 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:33:57,328 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 449 flow [2024-10-13 12:33:57,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2024-10-13 12:33:57,328 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 20 predicate places. [2024-10-13 12:33:57,328 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 449 flow [2024-10-13 12:33:57,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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-10-13 12:33:57,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:57,329 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:57,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 12:33:57,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:57,530 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:57,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:57,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1067367987, now seen corresponding path program 1 times [2024-10-13 12:33:57,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:57,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818007522] [2024-10-13 12:33:57,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:57,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:57,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:57,533 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:57,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 12:33:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:57,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:33:57,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:57,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:33:57,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:57,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:57,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818007522] [2024-10-13 12:33:57,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818007522] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:33:57,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:33:57,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-13 12:33:57,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999746472] [2024-10-13 12:33:57,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:33:57,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:33:57,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:57,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:33:57,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:33:57,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-10-13 12:33:57,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 449 flow. Second operand has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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-10-13 12:33:57,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:57,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-10-13 12:33:57,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:58,106 INFO L124 PetriNetUnfolderBase]: 128/587 cut-off events. [2024-10-13 12:33:58,107 INFO L125 PetriNetUnfolderBase]: For 211/212 co-relation queries the response was YES. [2024-10-13 12:33:58,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 587 events. 128/587 cut-off events. For 211/212 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3017 event pairs, 105 based on Foata normal form. 6/493 useless extension candidates. Maximal degree in co-relation 967. Up to 269 conditions per place. [2024-10-13 12:33:58,109 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 65 selfloop transitions, 11 changer transitions 0/134 dead transitions. [2024-10-13 12:33:58,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 134 transitions, 713 flow [2024-10-13 12:33:58,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:33:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:33:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2024-10-13 12:33:58,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6294871794871795 [2024-10-13 12:33:58,111 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 449 flow. Second operand 6 states and 491 transitions. [2024-10-13 12:33:58,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 134 transitions, 713 flow [2024-10-13 12:33:58,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 669 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:33:58,116 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 515 flow [2024-10-13 12:33:58,116 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=140, PETRI_TRANSITIONS=124} [2024-10-13 12:33:58,117 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places. [2024-10-13 12:33:58,117 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 515 flow [2024-10-13 12:33:58,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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-10-13 12:33:58,117 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:58,117 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:58,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 12:33:58,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:58,318 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:33:58,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1933789751, now seen corresponding path program 1 times [2024-10-13 12:33:58,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:58,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050389522] [2024-10-13 12:33:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:58,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:58,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:58,325 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:33:58,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 12:33:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:58,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 12:33:58,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:58,689 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 7 [2024-10-13 12:33:58,796 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 23 treesize of output 1 [2024-10-13 12:33:58,843 INFO L349 Elim1Store]: treesize reduction 86, result has 31.2 percent of original size [2024-10-13 12:33:58,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 59 [2024-10-13 12:33:58,897 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 36 treesize of output 29 [2024-10-13 12:33:58,939 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 36 treesize of output 29 [2024-10-13 12:33:58,966 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 28 treesize of output 21 [2024-10-13 12:33:59,032 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 27 treesize of output 15 [2024-10-13 12:33:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:59,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:33:59,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_618) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2024-10-13 12:33:59,145 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_618) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2024-10-13 12:33:59,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:33:59,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-13 12:33:59,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:33:59,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2024-10-13 12:33:59,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-10-13 12:34:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-13 12:34:00,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:34:00,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050389522] [2024-10-13 12:34:00,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050389522] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:34:00,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:34:00,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-13 12:34:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732454105] [2024-10-13 12:34:00,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:34:00,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 12:34:00,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:34:00,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 12:34:00,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=141, Unknown=9, NotChecked=50, Total=240 [2024-10-13 12:34:01,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 130 [2024-10-13 12:34:01,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 515 flow. Second operand has 16 states, 16 states have (on average 30.125) internal successors, (482), 16 states have internal predecessors, (482), 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-10-13 12:34:01,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:01,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 130 [2024-10-13 12:34:01,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:34:02,693 INFO L124 PetriNetUnfolderBase]: 330/1033 cut-off events. [2024-10-13 12:34:02,694 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-10-13 12:34:02,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2047 conditions, 1033 events. 330/1033 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6062 event pairs, 292 based on Foata normal form. 6/809 useless extension candidates. Maximal degree in co-relation 1870. Up to 678 conditions per place. [2024-10-13 12:34:02,697 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 78 selfloop transitions, 23 changer transitions 0/129 dead transitions. [2024-10-13 12:34:02,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 129 transitions, 731 flow [2024-10-13 12:34:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:34:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:34:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 393 transitions. [2024-10-13 12:34:02,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2748251748251748 [2024-10-13 12:34:02,700 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 515 flow. Second operand 11 states and 393 transitions. [2024-10-13 12:34:02,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 129 transitions, 731 flow [2024-10-13 12:34:02,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 129 transitions, 713 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-10-13 12:34:02,703 INFO L231 Difference]: Finished difference. Result has 148 places, 123 transitions, 539 flow [2024-10-13 12:34:02,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=539, PETRI_PLACES=148, PETRI_TRANSITIONS=123} [2024-10-13 12:34:02,704 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 34 predicate places. [2024-10-13 12:34:02,704 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 123 transitions, 539 flow [2024-10-13 12:34:02,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 30.125) internal successors, (482), 16 states have internal predecessors, (482), 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-10-13 12:34:02,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:34:02,705 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:34:02,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 12:34:02,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:02,906 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:34:02,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:34:02,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1933789752, now seen corresponding path program 1 times [2024-10-13 12:34:02,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:34:02,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258560232] [2024-10-13 12:34:02,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:34:02,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:02,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:34:02,909 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:34:02,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 12:34:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:34:03,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-13 12:34:03,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:34:03,268 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-10-13 12:34:03,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-13 12:34:03,391 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 23 treesize of output 1 [2024-10-13 12:34:03,427 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-10-13 12:34:03,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2024-10-13 12:34:03,447 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:34:03,447 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 13 treesize of output 13 [2024-10-13 12:34:03,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-13 12:34:03,509 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 22 treesize of output 17 [2024-10-13 12:34:03,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-13 12:34:03,554 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 22 treesize of output 17 [2024-10-13 12:34:03,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-13 12:34:03,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 12:34:03,615 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 17 treesize of output 9 [2024-10-13 12:34:03,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 12:34:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:34:03,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:34:03,759 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_727 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_727) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_726) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_727 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_727) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-10-13 12:34:03,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_727 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_727) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_726) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_727 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_727) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-10-13 12:34:03,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:34:03,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 109 [2024-10-13 12:34:03,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:34:03,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 85 [2024-10-13 12:34:03,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:34:03,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 121 [2024-10-13 12:34:03,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:34:03,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 163 [2024-10-13 12:34:04,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2024-10-13 12:34:04,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 79 [2024-10-13 12:34:04,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:34:04,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 112 [2024-10-13 12:34:04,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2024-10-13 12:34:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-13 12:34:05,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:34:05,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258560232] [2024-10-13 12:34:05,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258560232] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:34:05,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:34:05,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-13 12:34:05,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346787584] [2024-10-13 12:34:05,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:34:05,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 12:34:05,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:34:05,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 12:34:05,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=152, Unknown=4, NotChecked=50, Total=240 [2024-10-13 12:34:05,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 130 [2024-10-13 12:34:05,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 123 transitions, 539 flow. Second operand has 16 states, 16 states have (on average 22.125) internal successors, (354), 16 states have internal predecessors, (354), 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-10-13 12:34:05,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:05,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 130 [2024-10-13 12:34:05,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:34:08,228 INFO L124 PetriNetUnfolderBase]: 466/1255 cut-off events. [2024-10-13 12:34:08,228 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-10-13 12:34:08,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 1255 events. 466/1255 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7458 event pairs, 422 based on Foata normal form. 6/837 useless extension candidates. Maximal degree in co-relation 2388. Up to 952 conditions per place. [2024-10-13 12:34:08,234 INFO L140 encePairwiseOnDemand]: 121/130 looper letters, 85 selfloop transitions, 23 changer transitions 0/128 dead transitions. [2024-10-13 12:34:08,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 128 transitions, 769 flow [2024-10-13 12:34:08,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:34:08,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:34:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 312 transitions. [2024-10-13 12:34:08,236 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.21818181818181817 [2024-10-13 12:34:08,236 INFO L175 Difference]: Start difference. First operand has 148 places, 123 transitions, 539 flow. Second operand 11 states and 312 transitions. [2024-10-13 12:34:08,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 128 transitions, 769 flow [2024-10-13 12:34:08,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 128 transitions, 678 flow, removed 13 selfloop flow, removed 13 redundant places. [2024-10-13 12:34:08,240 INFO L231 Difference]: Finished difference. Result has 146 places, 124 transitions, 502 flow [2024-10-13 12:34:08,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=502, PETRI_PLACES=146, PETRI_TRANSITIONS=124} [2024-10-13 12:34:08,241 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 32 predicate places. [2024-10-13 12:34:08,241 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 124 transitions, 502 flow [2024-10-13 12:34:08,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 22.125) internal successors, (354), 16 states have internal predecessors, (354), 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-10-13 12:34:08,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:34:08,241 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2024-10-13 12:34:08,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-13 12:34:08,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:08,446 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:34:08,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:34:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash 524578709, now seen corresponding path program 2 times [2024-10-13 12:34:08,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:34:08,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464235367] [2024-10-13 12:34:08,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:34:08,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:08,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:34:08,449 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:34:08,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 12:34:08,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:34:08,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:34:08,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:34:08,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:34:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:34:09,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:34:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:34:09,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:34:09,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464235367] [2024-10-13 12:34:09,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464235367] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:34:09,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:34:09,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-13 12:34:09,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56786527] [2024-10-13 12:34:09,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:34:09,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 12:34:09,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:34:09,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 12:34:09,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:34:09,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-10-13 12:34:09,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 124 transitions, 502 flow. Second operand has 12 states, 12 states have (on average 74.91666666666667) internal successors, (899), 12 states have internal predecessors, (899), 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-10-13 12:34:09,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:09,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-10-13 12:34:09,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:34:09,813 INFO L124 PetriNetUnfolderBase]: 128/695 cut-off events. [2024-10-13 12:34:09,813 INFO L125 PetriNetUnfolderBase]: For 490/491 co-relation queries the response was YES. [2024-10-13 12:34:09,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 695 events. 128/695 cut-off events. For 490/491 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2977 event pairs, 105 based on Foata normal form. 12/607 useless extension candidates. Maximal degree in co-relation 1126. Up to 269 conditions per place. [2024-10-13 12:34:09,816 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 95 selfloop transitions, 23 changer transitions 0/176 dead transitions. [2024-10-13 12:34:09,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 176 transitions, 1182 flow [2024-10-13 12:34:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 12:34:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 12:34:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 950 transitions. [2024-10-13 12:34:09,818 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2024-10-13 12:34:09,818 INFO L175 Difference]: Start difference. First operand has 146 places, 124 transitions, 502 flow. Second operand 12 states and 950 transitions. [2024-10-13 12:34:09,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 176 transitions, 1182 flow [2024-10-13 12:34:09,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 176 transitions, 1042 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-10-13 12:34:09,822 INFO L231 Difference]: Finished difference. Result has 155 places, 137 transitions, 686 flow [2024-10-13 12:34:09,822 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=686, PETRI_PLACES=155, PETRI_TRANSITIONS=137} [2024-10-13 12:34:09,823 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 41 predicate places. [2024-10-13 12:34:09,823 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 137 transitions, 686 flow [2024-10-13 12:34:09,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.91666666666667) internal successors, (899), 12 states have internal predecessors, (899), 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-10-13 12:34:09,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:34:09,823 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-10-13 12:34:09,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-13 12:34:10,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:10,026 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:34:10,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:34:10,026 INFO L85 PathProgramCache]: Analyzing trace with hash -6493035, now seen corresponding path program 3 times [2024-10-13 12:34:10,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:34:10,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714990412] [2024-10-13 12:34:10,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:34:10,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:10,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:34:10,030 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:34:10,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 12:34:18,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-13 12:34:18,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:34:18,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:34:18,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:34:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:34:18,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:34:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:34:18,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:34:18,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714990412] [2024-10-13 12:34:18,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714990412] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:34:18,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:34:18,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-10-13 12:34:18,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800828018] [2024-10-13 12:34:18,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:34:18,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 12:34:18,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:34:18,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 12:34:18,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-10-13 12:34:18,578 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-10-13 12:34:18,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 137 transitions, 686 flow. Second operand has 24 states, 24 states have (on average 75.45833333333333) internal successors, (1811), 24 states have internal predecessors, (1811), 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-10-13 12:34:18,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:18,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-10-13 12:34:18,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:34:20,991 INFO L124 PetriNetUnfolderBase]: 128/935 cut-off events. [2024-10-13 12:34:20,992 INFO L125 PetriNetUnfolderBase]: For 1726/1727 co-relation queries the response was YES. [2024-10-13 12:34:20,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2286 conditions, 935 events. 128/935 cut-off events. For 1726/1727 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3000 event pairs, 105 based on Foata normal form. 24/859 useless extension candidates. Maximal degree in co-relation 1524. Up to 269 conditions per place. [2024-10-13 12:34:20,996 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 155 selfloop transitions, 47 changer transitions 0/260 dead transitions. [2024-10-13 12:34:20,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 260 transitions, 2054 flow [2024-10-13 12:34:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 12:34:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-13 12:34:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1868 transitions. [2024-10-13 12:34:20,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5987179487179487 [2024-10-13 12:34:20,999 INFO L175 Difference]: Start difference. First operand has 155 places, 137 transitions, 686 flow. Second operand 24 states and 1868 transitions. [2024-10-13 12:34:20,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 260 transitions, 2054 flow [2024-10-13 12:34:21,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 260 transitions, 2042 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:34:21,007 INFO L231 Difference]: Finished difference. Result has 188 places, 162 transitions, 1218 flow [2024-10-13 12:34:21,007 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1218, PETRI_PLACES=188, PETRI_TRANSITIONS=162} [2024-10-13 12:34:21,008 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 74 predicate places. [2024-10-13 12:34:21,008 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 162 transitions, 1218 flow [2024-10-13 12:34:21,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 75.45833333333333) internal successors, (1811), 24 states have internal predecessors, (1811), 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-10-13 12:34:21,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:34:21,009 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1] [2024-10-13 12:34:21,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-13 12:34:21,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:21,210 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-13 12:34:21,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:34:21,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1350477461, now seen corresponding path program 4 times [2024-10-13 12:34:21,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:34:21,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326830583] [2024-10-13 12:34:21,211 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:34:21,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:21,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:34:21,212 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:34:21,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process