./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-09 10:44:20,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:44:20,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:44:20,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:44:20,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:44:20,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:44:20,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:44:20,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:44:20,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:44:20,489 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:44:20,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:44:20,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:44:20,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:44:20,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:44:20,492 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:44:20,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:44:20,495 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:44:20,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:44:20,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:44:20,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:44:20,496 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:44:20,497 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:44:20,497 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:44:20,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:44:20,501 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:44:20,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:44:20,502 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:44:20,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:44:20,503 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:44:20,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:44:20,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:44:20,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:44:20,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:44:20,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:44:20,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:44:20,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:44:20,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:44:20,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:44:20,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:44:20,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:44:20,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:44:20,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:44:20,511 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-11-09 10:44:20,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:44:20,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:44:20,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:44:20,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:44:20,833 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:44:20,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-11-09 10:44:22,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:44:22,605 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:44:22,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-11-09 10:44:22,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff7feada/1154b2525d874436a46b9053ae6e89c7/FLAGde868c14f [2024-11-09 10:44:22,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff7feada/1154b2525d874436a46b9053ae6e89c7 [2024-11-09 10:44:22,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:44:22,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:44:22,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:44:22,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:44:22,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:44:22,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:22" (1/1) ... [2024-11-09 10:44:22,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a466179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:22, skipping insertion in model container [2024-11-09 10:44:22,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:22" (1/1) ... [2024-11-09 10:44:22,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:44:23,229 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:23,230 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:23,231 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:23,231 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:23,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:44:23,322 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-11-09 10:44:23,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3e2fc563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:23, skipping insertion in model container [2024-11-09 10:44:23,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:44:23,323 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:44:23,326 INFO L158 Benchmark]: Toolchain (without parser) took 671.74ms. Allocated memory is still 178.3MB. Free memory was 106.0MB in the beginning and 85.9MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 10:44:23,326 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:44:23,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.20ms. Allocated memory is still 178.3MB. Free memory was 105.6MB in the beginning and 85.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 10:44:23,328 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.20ms. Allocated memory is still 121.6MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.20ms. Allocated memory is still 178.3MB. Free memory was 105.6MB in the beginning and 85.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. 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/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-09 10:44:25,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:44:25,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:44:25,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:44:25,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:44:25,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:44:25,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:44:25,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:44:25,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:44:25,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:44:25,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:44:25,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:44:25,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:44:25,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:44:25,516 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:44:25,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:44:25,516 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:44:25,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:44:25,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:44:25,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:44:25,520 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:44:25,520 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:44:25,521 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:44:25,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:44:25,521 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:44:25,524 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:44:25,525 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:44:25,525 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:44:25,525 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:44:25,525 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:44:25,526 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:44:25,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:44:25,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:44:25,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:44:25,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:44:25,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:44:25,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:44:25,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:44:25,528 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:44:25,528 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:44:25,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:44:25,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:44:25,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:44:25,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:44:25,530 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-11-09 10:44:25,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:44:25,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:44:25,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:44:25,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:44:25,917 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:44:25,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-11-09 10:44:27,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:44:27,895 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:44:27,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-11-09 10:44:27,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c13d411a/8d45d0c4b641404884e36c8f6f90ff7a/FLAG623436cd9 [2024-11-09 10:44:28,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c13d411a/8d45d0c4b641404884e36c8f6f90ff7a [2024-11-09 10:44:28,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:44:28,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:44:28,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:44:28,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:44:28,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:44:28,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:28" (1/1) ... [2024-11-09 10:44:28,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e58ec59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:28, skipping insertion in model container [2024-11-09 10:44:28,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:28" (1/1) ... [2024-11-09 10:44:28,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:44:28,721 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:28,723 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:28,723 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:28,723 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:28,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:44:28,815 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:44:28,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:44:28,860 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:28,861 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:28,861 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:28,861 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:28,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:44:28,903 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:44:28,950 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:28,954 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:28,955 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:28,955 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:28,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:44:29,059 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:44:29,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29 WrapperNode [2024-11-09 10:44:29,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:44:29,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:44:29,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:44:29,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:44:29,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29" (1/1) ... [2024-11-09 10:44:29,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29" (1/1) ... [2024-11-09 10:44:29,147 INFO L138 Inliner]: procedures = 285, calls = 126, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 303 [2024-11-09 10:44:29,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:44:29,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:44:29,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:44:29,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:44:29,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29" (1/1) ... [2024-11-09 10:44:29,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29" (1/1) ... [2024-11-09 10:44:29,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29" (1/1) ... [2024-11-09 10:44:29,210 INFO L175 MemorySlicer]: Split 98 memory accesses to 4 slices as follows [2, 5, 89, 2]. 91 percent of accesses are in the largest equivalence class. The 77 initializations are split as follows [2, 5, 70, 0]. The 12 writes are split as follows [0, 0, 11, 1]. [2024-11-09 10:44:29,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29" (1/1) ... [2024-11-09 10:44:29,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29" (1/1) ... [2024-11-09 10:44:29,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29" (1/1) ... [2024-11-09 10:44:29,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29" (1/1) ... [2024-11-09 10:44:29,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29" (1/1) ... [2024-11-09 10:44:29,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29" (1/1) ... [2024-11-09 10:44:29,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:44:29,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:44:29,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:44:29,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:44:29,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29" (1/1) ... [2024-11-09 10:44:29,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:44:29,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:44:29,316 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-11-09 10:44:29,318 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-11-09 10:44:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:44:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:44:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:44:29,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 10:44:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:44:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:44:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:44:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:44:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 10:44:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:44:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:44:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:44:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:44:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 10:44:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 10:44:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 10:44:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 10:44:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-09 10:44:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:44:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:44:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:44:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 10:44:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 10:44:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 10:44:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 10:44:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 10:44:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:44:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:44:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:44:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:44:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:44:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:44:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:44:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 10:44:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 10:44:29,374 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 10:44:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:44:29,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:44:29,380 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:44:29,599 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:44:29,601 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:44:30,518 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:44:30,518 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:44:31,998 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:44:31,999 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-09 10:44:31,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:44:31 BoogieIcfgContainer [2024-11-09 10:44:32,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:44:32,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:44:32,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:44:32,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:44:32,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:44:28" (1/3) ... [2024-11-09 10:44:32,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109cc15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:44:32, skipping insertion in model container [2024-11-09 10:44:32,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:29" (2/3) ... [2024-11-09 10:44:32,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109cc15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:44:32, skipping insertion in model container [2024-11-09 10:44:32,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:44:31" (3/3) ... [2024-11-09 10:44:32,008 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_93-evilcollapse_racefree.i [2024-11-09 10:44:32,025 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:44:32,026 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-09 10:44:32,026 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:44:32,153 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 10:44:32,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 130 transitions, 267 flow [2024-11-09 10:44:32,263 INFO L124 PetriNetUnfolderBase]: 19/142 cut-off events. [2024-11-09 10:44:32,263 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:44:32,267 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-11-09 10:44:32,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 130 transitions, 267 flow [2024-11-09 10:44:32,274 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 130 transitions, 267 flow [2024-11-09 10:44:32,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:44:32,292 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;@4d778f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:44:32,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-11-09 10:44:32,310 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:44:32,310 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:44:32,311 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:44:32,311 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:32,312 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:44:32,313 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-11-09 10:44:32,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:32,320 INFO L85 PathProgramCache]: Analyzing trace with hash 824147, now seen corresponding path program 1 times [2024-11-09 10:44:32,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:32,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853936856] [2024-11-09 10:44:32,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:32,337 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-11-09 10:44:32,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:32,341 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-11-09 10:44:32,343 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-11-09 10:44:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:32,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:44:32,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:32,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:32,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:32,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853936856] [2024-11-09 10:44:32,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853936856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:32,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:32,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:32,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853272679] [2024-11-09 10:44:32,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:32,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:32,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:32,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:32,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:32,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 130 [2024-11-09 10:44:32,954 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-11-09 10:44:32,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:32,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 130 [2024-11-09 10:44:32,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:33,609 INFO L124 PetriNetUnfolderBase]: 126/487 cut-off events. [2024-11-09 10:44:33,609 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-09 10:44:33,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 487 events. 126/487 cut-off events. For 4/5 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-11-09 10:44:33,616 INFO L140 encePairwiseOnDemand]: 109/130 looper letters, 68 selfloop transitions, 4 changer transitions 0/136 dead transitions. [2024-11-09 10:44:33,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 136 transitions, 423 flow [2024-11-09 10:44:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 357 transitions. [2024-11-09 10:44:33,636 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6865384615384615 [2024-11-09 10:44:33,639 INFO L175 Difference]: Start difference. First operand has 114 places, 130 transitions, 267 flow. Second operand 4 states and 357 transitions. [2024-11-09 10:44:33,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 136 transitions, 423 flow [2024-11-09 10:44:33,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 136 transitions, 423 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:44:33,648 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 247 flow [2024-11-09 10:44:33,652 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-11-09 10:44:33,656 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -1 predicate places. [2024-11-09 10:44:33,656 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 247 flow [2024-11-09 10:44:33,657 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-11-09 10:44:33,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:33,657 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:44:33,663 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 (2)] Ended with exit code 0 [2024-11-09 10:44:33,858 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-11-09 10:44:33,859 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-11-09 10:44:33,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:33,859 INFO L85 PathProgramCache]: Analyzing trace with hash 824148, now seen corresponding path program 1 times [2024-11-09 10:44:33,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:33,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660148651] [2024-11-09 10:44:33,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:33,861 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-11-09 10:44:33,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:33,864 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-11-09 10:44:33,866 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-11-09 10:44:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:34,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:44:34,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:34,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:34,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:34,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660148651] [2024-11-09 10:44:34,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660148651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:34,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:34,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:34,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54622842] [2024-11-09 10:44:34,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:34,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:34,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:34,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:34,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:34,501 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 130 [2024-11-09 10:44:34,502 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-11-09 10:44:34,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:34,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 130 [2024-11-09 10:44:34,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:34,922 INFO L124 PetriNetUnfolderBase]: 128/518 cut-off events. [2024-11-09 10:44:34,922 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-11-09 10:44:34,924 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-11-09 10:44:34,927 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 49 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2024-11-09 10:44:34,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 117 transitions, 369 flow [2024-11-09 10:44:34,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2024-11-09 10:44:34,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-09 10:44:34,930 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 247 flow. Second operand 4 states and 325 transitions. [2024-11-09 10:44:34,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 117 transitions, 369 flow [2024-11-09 10:44:34,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 357 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:34,935 INFO L231 Difference]: Finished difference. Result has 115 places, 117 transitions, 280 flow [2024-11-09 10:44:34,936 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-11-09 10:44:34,936 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-11-09 10:44:34,937 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 280 flow [2024-11-09 10:44:34,937 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-11-09 10:44:34,937 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:34,938 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:44:34,944 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-11-09 10:44:35,141 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-11-09 10:44:35,142 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-11-09 10:44:35,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1216856412, now seen corresponding path program 1 times [2024-11-09 10:44:35,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:35,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703115057] [2024-11-09 10:44:35,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:35,145 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-11-09 10:44:35,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:35,149 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-11-09 10:44:35,151 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-11-09 10:44:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:35,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:44:35,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:35,340 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-11-09 10:44:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:35,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:35,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:35,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703115057] [2024-11-09 10:44:35,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703115057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:35,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:35,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:35,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249313685] [2024-11-09 10:44:35,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:35,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:44:35,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:35,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:44:35,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:44:35,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 130 [2024-11-09 10:44:35,445 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-11-09 10:44:35,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:35,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 130 [2024-11-09 10:44:35,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:35,731 INFO L124 PetriNetUnfolderBase]: 128/517 cut-off events. [2024-11-09 10:44:35,731 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2024-11-09 10:44:35,733 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-11-09 10:44:35,736 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 47 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2024-11-09 10:44:35,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 378 flow [2024-11-09 10:44:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:44:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:44:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-11-09 10:44:35,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.658974358974359 [2024-11-09 10:44:35,739 INFO L175 Difference]: Start difference. First operand has 115 places, 117 transitions, 280 flow. Second operand 3 states and 257 transitions. [2024-11-09 10:44:35,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 378 flow [2024-11-09 10:44:35,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:44:35,743 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 281 flow [2024-11-09 10:44:35,744 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-11-09 10:44:35,744 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-11-09 10:44:35,745 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 281 flow [2024-11-09 10:44:35,745 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-11-09 10:44:35,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:35,745 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:44:35,753 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 (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:44:35,949 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-11-09 10:44:35,950 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-11-09 10:44:35,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1216856411, now seen corresponding path program 1 times [2024-11-09 10:44:35,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:35,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021248716] [2024-11-09 10:44:35,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:35,952 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-11-09 10:44:35,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:35,955 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-11-09 10:44:35,957 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-11-09 10:44:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:36,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:44:36,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:36,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:44:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:36,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:36,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:36,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021248716] [2024-11-09 10:44:36,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021248716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:36,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:36,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:36,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543772796] [2024-11-09 10:44:36,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:36,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:44:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:36,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:44:36,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:44:36,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 130 [2024-11-09 10:44:36,283 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-11-09 10:44:36,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:36,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 130 [2024-11-09 10:44:36,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:36,560 INFO L124 PetriNetUnfolderBase]: 128/516 cut-off events. [2024-11-09 10:44:36,560 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2024-11-09 10:44:36,562 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-11-09 10:44:36,564 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 47 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2024-11-09 10:44:36,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 379 flow [2024-11-09 10:44:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:44:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:44:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-11-09 10:44:36,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.658974358974359 [2024-11-09 10:44:36,566 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 281 flow. Second operand 3 states and 257 transitions. [2024-11-09 10:44:36,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 379 flow [2024-11-09 10:44:36,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:44:36,570 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 279 flow [2024-11-09 10:44:36,571 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-11-09 10:44:36,571 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2024-11-09 10:44:36,572 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 279 flow [2024-11-09 10:44:36,572 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-11-09 10:44:36,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:36,572 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:44:36,578 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-11-09 10:44:36,776 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-11-09 10:44:36,777 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-11-09 10:44:36,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:36,777 INFO L85 PathProgramCache]: Analyzing trace with hash 932159261, now seen corresponding path program 1 times [2024-11-09 10:44:36,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:36,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197125719] [2024-11-09 10:44:36,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:36,779 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-11-09 10:44:36,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:36,782 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-11-09 10:44:36,783 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-11-09 10:44:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:36,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:44:36,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:36,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:36,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:36,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197125719] [2024-11-09 10:44:36,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197125719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:36,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:36,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:36,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440052420] [2024-11-09 10:44:36,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:36,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:44:36,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:36,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:44:36,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:44:36,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-11-09 10:44:36,976 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-11-09 10:44:36,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:36,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-11-09 10:44:36,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:37,243 INFO L124 PetriNetUnfolderBase]: 127/538 cut-off events. [2024-11-09 10:44:37,244 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-11-09 10:44:37,245 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-11-09 10:44:37,247 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 51 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2024-11-09 10:44:37,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 119 transitions, 399 flow [2024-11-09 10:44:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:44:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:44:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2024-11-09 10:44:37,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2024-11-09 10:44:37,249 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 279 flow. Second operand 3 states and 265 transitions. [2024-11-09 10:44:37,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 119 transitions, 399 flow [2024-11-09 10:44:37,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 119 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:44:37,252 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 284 flow [2024-11-09 10:44:37,252 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-11-09 10:44:37,255 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-11-09 10:44:37,255 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 284 flow [2024-11-09 10:44:37,256 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-11-09 10:44:37,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:37,256 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:37,262 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-11-09 10:44:37,459 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-11-09 10:44:37,460 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-11-09 10:44:37,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:37,460 INFO L85 PathProgramCache]: Analyzing trace with hash 932157749, now seen corresponding path program 1 times [2024-11-09 10:44:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:37,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154448825] [2024-11-09 10:44:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:37,461 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-11-09 10:44:37,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:37,463 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-11-09 10:44:37,464 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-11-09 10:44:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:37,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:44:37,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:37,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:44:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:37,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:37,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:37,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154448825] [2024-11-09 10:44:37,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154448825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:37,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:37,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:37,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260046799] [2024-11-09 10:44:37,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:37,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:37,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:37,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:37,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:37,793 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-11-09 10:44:37,794 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-11-09 10:44:37,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:37,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-11-09 10:44:37,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:38,146 INFO L124 PetriNetUnfolderBase]: 127/534 cut-off events. [2024-11-09 10:44:38,147 INFO L125 PetriNetUnfolderBase]: For 32/33 co-relation queries the response was YES. [2024-11-09 10:44:38,148 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-11-09 10:44:38,150 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 48 selfloop transitions, 4 changer transitions 0/113 dead transitions. [2024-11-09 10:44:38,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 384 flow [2024-11-09 10:44:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2024-11-09 10:44:38,152 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6038461538461538 [2024-11-09 10:44:38,152 INFO L175 Difference]: Start difference. First operand has 115 places, 115 transitions, 284 flow. Second operand 4 states and 314 transitions. [2024-11-09 10:44:38,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 384 flow [2024-11-09 10:44:38,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 113 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:44:38,155 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 285 flow [2024-11-09 10:44:38,155 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-11-09 10:44:38,156 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-11-09 10:44:38,156 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 285 flow [2024-11-09 10:44:38,156 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-11-09 10:44:38,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:38,156 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:38,164 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 (7)] Forceful destruction successful, exit code 0 [2024-11-09 10:44:38,357 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-11-09 10:44:38,357 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-11-09 10:44:38,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash 932157748, now seen corresponding path program 1 times [2024-11-09 10:44:38,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:38,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881134732] [2024-11-09 10:44:38,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:38,359 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-11-09 10:44:38,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:38,362 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-11-09 10:44:38,363 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-11-09 10:44:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:38,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:44:38,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:38,553 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-11-09 10:44:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:38,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:38,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:38,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881134732] [2024-11-09 10:44:38,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881134732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:38,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:38,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:38,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475889802] [2024-11-09 10:44:38,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:38,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:38,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:38,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:38,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:38,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 130 [2024-11-09 10:44:38,738 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-11-09 10:44:38,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:38,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 130 [2024-11-09 10:44:38,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:39,052 INFO L124 PetriNetUnfolderBase]: 127/530 cut-off events. [2024-11-09 10:44:39,053 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-11-09 10:44:39,054 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-11-09 10:44:39,056 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 45 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2024-11-09 10:44:39,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 385 flow [2024-11-09 10:44:39,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:44:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:44:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2024-11-09 10:44:39,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2024-11-09 10:44:39,058 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 285 flow. Second operand 5 states and 370 transitions. [2024-11-09 10:44:39,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 385 flow [2024-11-09 10:44:39,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 377 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:39,061 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 287 flow [2024-11-09 10:44:39,061 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-11-09 10:44:39,062 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2024-11-09 10:44:39,062 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 287 flow [2024-11-09 10:44:39,063 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-11-09 10:44:39,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:39,063 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:39,069 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 (8)] Ended with exit code 0 [2024-11-09 10:44:39,264 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-11-09 10:44:39,264 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-11-09 10:44:39,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1844541978, now seen corresponding path program 1 times [2024-11-09 10:44:39,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:39,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607586339] [2024-11-09 10:44:39,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:39,266 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-11-09 10:44:39,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:39,267 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-11-09 10:44:39,268 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-11-09 10:44:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:39,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:44:39,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:39,883 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:44:39,883 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-11-09 10:44:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:39,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:39,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:39,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607586339] [2024-11-09 10:44:39,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607586339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:39,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:39,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:39,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742907037] [2024-11-09 10:44:39,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:39,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:39,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:39,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:39,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:40,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-11-09 10:44:40,091 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-11-09 10:44:40,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:40,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-11-09 10:44:40,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:40,460 INFO L124 PetriNetUnfolderBase]: 126/500 cut-off events. [2024-11-09 10:44:40,460 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2024-11-09 10:44:40,461 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-11-09 10:44:40,463 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 69 selfloop transitions, 5 changer transitions 0/132 dead transitions. [2024-11-09 10:44:40,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 132 transitions, 477 flow [2024-11-09 10:44:40,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 336 transitions. [2024-11-09 10:44:40,465 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2024-11-09 10:44:40,465 INFO L175 Difference]: Start difference. First operand has 114 places, 111 transitions, 287 flow. Second operand 4 states and 336 transitions. [2024-11-09 10:44:40,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 132 transitions, 477 flow [2024-11-09 10:44:40,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 132 transitions, 463 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:44:40,469 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 279 flow [2024-11-09 10:44:40,469 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-11-09 10:44:40,469 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2024-11-09 10:44:40,470 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 279 flow [2024-11-09 10:44:40,470 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-11-09 10:44:40,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:40,470 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:40,481 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-11-09 10:44:40,671 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-11-09 10:44:40,671 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-11-09 10:44:40,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1844541977, now seen corresponding path program 1 times [2024-11-09 10:44:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:40,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089505318] [2024-11-09 10:44:40,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:40,673 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-11-09 10:44:40,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:40,674 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-11-09 10:44:40,675 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-11-09 10:44:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:41,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:44:41,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:41,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:44:41,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 10:44:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:41,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:41,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:41,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089505318] [2024-11-09 10:44:41,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089505318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:41,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:41,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253981010] [2024-11-09 10:44:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:41,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:44:41,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:41,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:44:41,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:44:41,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-11-09 10:44:41,714 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-11-09 10:44:41,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:41,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-11-09 10:44:41,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:41,992 INFO L124 PetriNetUnfolderBase]: 129/558 cut-off events. [2024-11-09 10:44:41,993 INFO L125 PetriNetUnfolderBase]: For 51/52 co-relation queries the response was YES. [2024-11-09 10:44:41,994 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-11-09 10:44:41,996 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 55 selfloop transitions, 5 changer transitions 0/116 dead transitions. [2024-11-09 10:44:41,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 116 transitions, 429 flow [2024-11-09 10:44:41,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2024-11-09 10:44:41,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6211538461538462 [2024-11-09 10:44:41,998 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 279 flow. Second operand 4 states and 323 transitions. [2024-11-09 10:44:41,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 116 transitions, 429 flow [2024-11-09 10:44:41,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 413 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:42,001 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 315 flow [2024-11-09 10:44:42,002 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-11-09 10:44:42,002 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -1 predicate places. [2024-11-09 10:44:42,002 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 315 flow [2024-11-09 10:44:42,003 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-11-09 10:44:42,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:42,003 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:42,011 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-11-09 10:44:42,203 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-11-09 10:44:42,203 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-11-09 10:44:42,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:42,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1346225552, now seen corresponding path program 1 times [2024-11-09 10:44:42,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:42,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076014762] [2024-11-09 10:44:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:42,205 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-11-09 10:44:42,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:42,206 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-11-09 10:44:42,207 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-11-09 10:44:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:42,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 10:44:42,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:42,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 10:44:42,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 10:44:43,008 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-11-09 10:44:43,021 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-11-09 10:44:43,105 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:44:43,105 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-11-09 10:44:43,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 10:44:43,196 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-11-09 10:44:43,216 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-11-09 10:44:43,317 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-11-09 10:44:43,334 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-11-09 10:44:43,384 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-11-09 10:44:43,396 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-11-09 10:44:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:43,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:43,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:43,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076014762] [2024-11-09 10:44:43,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076014762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:43,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:43,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:44:43,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032024960] [2024-11-09 10:44:43,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:43,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:44:43,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:43,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:44:43,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:44:44,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 130 [2024-11-09 10:44:44,527 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-11-09 10:44:44,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:44,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 130 [2024-11-09 10:44:44,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:45,372 INFO L124 PetriNetUnfolderBase]: 129/557 cut-off events. [2024-11-09 10:44:45,372 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2024-11-09 10:44:45,374 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-11-09 10:44:45,375 INFO L140 encePairwiseOnDemand]: 118/130 looper letters, 70 selfloop transitions, 11 changer transitions 0/129 dead transitions. [2024-11-09 10:44:45,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 129 transitions, 515 flow [2024-11-09 10:44:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:44:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:44:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 642 transitions. [2024-11-09 10:44:45,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4489510489510489 [2024-11-09 10:44:45,378 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 315 flow. Second operand 11 states and 642 transitions. [2024-11-09 10:44:45,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 129 transitions, 515 flow [2024-11-09 10:44:45,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 129 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:44:45,381 INFO L231 Difference]: Finished difference. Result has 127 places, 118 transitions, 371 flow [2024-11-09 10:44:45,381 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-11-09 10:44:45,382 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 13 predicate places. [2024-11-09 10:44:45,382 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 118 transitions, 371 flow [2024-11-09 10:44:45,382 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-11-09 10:44:45,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:45,382 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:45,388 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 (11)] Forceful destruction successful, exit code 0 [2024-11-09 10:44:45,583 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-11-09 10:44:45,583 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-11-09 10:44:45,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:45,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1346225553, now seen corresponding path program 1 times [2024-11-09 10:44:45,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:45,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45477674] [2024-11-09 10:44:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:45,584 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-11-09 10:44:45,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:45,585 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-11-09 10:44:45,586 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-11-09 10:44:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:46,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 10:44:46,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:46,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 10:44:46,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-09 10:44:46,444 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-11-09 10:44:46,445 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-11-09 10:44:46,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 32 treesize of output 25 [2024-11-09 10:44:46,560 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 32 treesize of output 25 [2024-11-09 10:44:46,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-09 10:44:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:46,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:46,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:46,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45477674] [2024-11-09 10:44:46,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45477674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:46,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:46,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:44:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147458379] [2024-11-09 10:44:46,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:46,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:44:46,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:46,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:44:46,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:44:47,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 130 [2024-11-09 10:44:47,970 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-11-09 10:44:47,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:47,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 130 [2024-11-09 10:44:47,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:48,961 INFO L124 PetriNetUnfolderBase]: 127/527 cut-off events. [2024-11-09 10:44:48,962 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2024-11-09 10:44:48,963 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-11-09 10:44:48,965 INFO L140 encePairwiseOnDemand]: 118/130 looper letters, 77 selfloop transitions, 20 changer transitions 0/149 dead transitions. [2024-11-09 10:44:48,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 149 transitions, 637 flow [2024-11-09 10:44:48,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:44:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:44:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 713 transitions. [2024-11-09 10:44:48,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4986013986013986 [2024-11-09 10:44:48,969 INFO L175 Difference]: Start difference. First operand has 127 places, 118 transitions, 371 flow. Second operand 11 states and 713 transitions. [2024-11-09 10:44:48,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 149 transitions, 637 flow [2024-11-09 10:44:48,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 149 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:44:48,973 INFO L231 Difference]: Finished difference. Result has 140 places, 123 transitions, 459 flow [2024-11-09 10:44:48,973 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-11-09 10:44:48,973 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places. [2024-11-09 10:44:48,974 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 123 transitions, 459 flow [2024-11-09 10:44:48,974 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-11-09 10:44:48,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:48,974 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:48,981 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 (12)] Forceful destruction successful, exit code 0 [2024-11-09 10:44:49,175 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-11-09 10:44:49,175 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-11-09 10:44:49,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:49,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1216681622, now seen corresponding path program 1 times [2024-11-09 10:44:49,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:49,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151897354] [2024-11-09 10:44:49,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:49,176 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-11-09 10:44:49,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:49,178 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-11-09 10:44:49,179 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-11-09 10:44:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:49,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:44:49,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:49,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:44:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:49,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:49,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:49,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151897354] [2024-11-09 10:44:49,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151897354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:49,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:49,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:49,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215116811] [2024-11-09 10:44:49,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:49,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:49,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:49,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:49,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:49,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 130 [2024-11-09 10:44:49,621 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-11-09 10:44:49,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:49,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 130 [2024-11-09 10:44:49,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:49,867 INFO L124 PetriNetUnfolderBase]: 128/545 cut-off events. [2024-11-09 10:44:49,867 INFO L125 PetriNetUnfolderBase]: For 120/121 co-relation queries the response was YES. [2024-11-09 10:44:49,868 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-11-09 10:44:49,870 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 50 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2024-11-09 10:44:49,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 121 transitions, 577 flow [2024-11-09 10:44:49,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 320 transitions. [2024-11-09 10:44:49,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-11-09 10:44:49,871 INFO L175 Difference]: Start difference. First operand has 140 places, 123 transitions, 459 flow. Second operand 4 states and 320 transitions. [2024-11-09 10:44:49,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 121 transitions, 577 flow [2024-11-09 10:44:49,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 121 transitions, 553 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-09 10:44:49,875 INFO L231 Difference]: Finished difference. Result has 136 places, 121 transitions, 453 flow [2024-11-09 10:44:49,875 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-11-09 10:44:49,876 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 22 predicate places. [2024-11-09 10:44:49,876 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 121 transitions, 453 flow [2024-11-09 10:44:49,876 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-11-09 10:44:49,877 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:49,877 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:49,884 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 (13)] Ended with exit code 0 [2024-11-09 10:44:50,078 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-11-09 10:44:50,078 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-11-09 10:44:50,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1216681621, now seen corresponding path program 1 times [2024-11-09 10:44:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:50,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790961055] [2024-11-09 10:44:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:50,079 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-11-09 10:44:50,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:50,080 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-11-09 10:44:50,081 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-11-09 10:44:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:50,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:44:50,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:50,255 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-11-09 10:44:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:50,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:50,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:50,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790961055] [2024-11-09 10:44:50,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790961055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:50,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:50,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:50,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841483344] [2024-11-09 10:44:50,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:50,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:50,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:50,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:50,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:50,446 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-11-09 10:44:50,446 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-11-09 10:44:50,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:50,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-11-09 10:44:50,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:50,721 INFO L124 PetriNetUnfolderBase]: 128/537 cut-off events. [2024-11-09 10:44:50,721 INFO L125 PetriNetUnfolderBase]: For 116/117 co-relation queries the response was YES. [2024-11-09 10:44:50,722 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-11-09 10:44:50,723 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 52 selfloop transitions, 11 changer transitions 0/119 dead transitions. [2024-11-09 10:44:50,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 119 transitions, 575 flow [2024-11-09 10:44:50,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2024-11-09 10:44:50,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6038461538461538 [2024-11-09 10:44:50,725 INFO L175 Difference]: Start difference. First operand has 136 places, 121 transitions, 453 flow. Second operand 4 states and 314 transitions. [2024-11-09 10:44:50,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 119 transitions, 575 flow [2024-11-09 10:44:50,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 119 transitions, 553 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:50,728 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 449 flow [2024-11-09 10:44:50,728 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-11-09 10:44:50,729 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 20 predicate places. [2024-11-09 10:44:50,729 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 449 flow [2024-11-09 10:44:50,729 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-11-09 10:44:50,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:50,729 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:50,735 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 (14)] Forceful destruction successful, exit code 0 [2024-11-09 10:44:50,930 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-11-09 10:44:50,930 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-11-09 10:44:50,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash -86324787, now seen corresponding path program 1 times [2024-11-09 10:44:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:50,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056659235] [2024-11-09 10:44:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:50,931 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-11-09 10:44:50,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:50,932 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-11-09 10:44:50,934 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-11-09 10:44:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:51,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:44:51,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:51,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:44:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:51,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:51,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056659235] [2024-11-09 10:44:51,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056659235] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:44:51,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:44:51,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-09 10:44:51,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594938563] [2024-11-09 10:44:51,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:44:51,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:44:51,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:44:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:44:51,167 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-11-09 10:44:51,167 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-11-09 10:44:51,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:51,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-11-09 10:44:51,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:51,500 INFO L124 PetriNetUnfolderBase]: 128/587 cut-off events. [2024-11-09 10:44:51,500 INFO L125 PetriNetUnfolderBase]: For 211/212 co-relation queries the response was YES. [2024-11-09 10:44:51,503 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-11-09 10:44:51,506 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 65 selfloop transitions, 11 changer transitions 0/134 dead transitions. [2024-11-09 10:44:51,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 134 transitions, 713 flow [2024-11-09 10:44:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:44:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:44:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2024-11-09 10:44:51,509 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6294871794871795 [2024-11-09 10:44:51,509 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 449 flow. Second operand 6 states and 491 transitions. [2024-11-09 10:44:51,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 134 transitions, 713 flow [2024-11-09 10:44:51,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 669 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:51,514 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 515 flow [2024-11-09 10:44:51,514 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-11-09 10:44:51,515 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places. [2024-11-09 10:44:51,515 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 515 flow [2024-11-09 10:44:51,516 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-11-09 10:44:51,516 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:51,516 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:51,524 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 (15)] Forceful destruction successful, exit code 0 [2024-11-09 10:44:51,716 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-11-09 10:44:51,717 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-11-09 10:44:51,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:51,717 INFO L85 PathProgramCache]: Analyzing trace with hash 939446719, now seen corresponding path program 1 times [2024-11-09 10:44:51,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:51,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582010094] [2024-11-09 10:44:51,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:51,718 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-11-09 10:44:51,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:51,719 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-11-09 10:44:51,720 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-11-09 10:44:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:52,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 10:44:52,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:52,567 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-11-09 10:44:52,672 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-11-09 10:44:52,733 INFO L349 Elim1Store]: treesize reduction 86, result has 31.2 percent of original size [2024-11-09 10:44:52,733 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-11-09 10:44:52,797 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-11-09 10:44:52,852 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-11-09 10:44:52,878 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-11-09 10:44:52,953 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-11-09 10:44:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:53,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:44:53,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:53,339 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-11-09 10:44:53,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:53,353 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-11-09 10:44:53,359 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-11-09 10:45:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:45:07,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:45:07,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582010094] [2024-11-09 10:45:07,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582010094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:45:07,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:45:07,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-09 10:45:07,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946294315] [2024-11-09 10:45:07,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:45:07,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:45:07,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:45:07,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:45:07,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=232, Unknown=24, NotChecked=0, Total=306 [2024-11-09 10:45:12,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 10:45:16,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 10:45:20,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 10:45:26,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 10:45:26,311 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 130 [2024-11-09 10:45:26,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 515 flow. Second operand has 18 states, 18 states have (on average 29.88888888888889) internal successors, (538), 18 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:45:26,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:45:26,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 130 [2024-11-09 10:45:26,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:45:32,097 INFO L124 PetriNetUnfolderBase]: 330/1033 cut-off events. [2024-11-09 10:45:32,097 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-11-09 10:45:32,100 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-11-09 10:45:32,104 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 76 selfloop transitions, 25 changer transitions 0/129 dead transitions. [2024-11-09 10:45:32,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 129 transitions, 731 flow [2024-11-09 10:45:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:45:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:45:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 421 transitions. [2024-11-09 10:45:32,108 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.26987179487179486 [2024-11-09 10:45:32,108 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 515 flow. Second operand 12 states and 421 transitions. [2024-11-09 10:45:32,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 129 transitions, 731 flow [2024-11-09 10:45:32,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 129 transitions, 713 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-09 10:45:32,113 INFO L231 Difference]: Finished difference. Result has 149 places, 123 transitions, 543 flow [2024-11-09 10:45:32,113 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=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=543, PETRI_PLACES=149, PETRI_TRANSITIONS=123} [2024-11-09 10:45:32,113 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 35 predicate places. [2024-11-09 10:45:32,113 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 123 transitions, 543 flow [2024-11-09 10:45:32,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.88888888888889) internal successors, (538), 18 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:45:32,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:45:32,114 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:45:32,125 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-11-09 10:45:32,315 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-11-09 10:45:32,315 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-11-09 10:45:32,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:45:32,315 INFO L85 PathProgramCache]: Analyzing trace with hash 939446720, now seen corresponding path program 1 times [2024-11-09 10:45:32,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:45:32,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389705231] [2024-11-09 10:45:32,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:45:32,316 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-11-09 10:45:32,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:45:32,318 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-11-09 10:45:32,319 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-11-09 10:45:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:45:33,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 10:45:33,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:45:33,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:45:33,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:45:33,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 10:45:33,411 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-09 10:45:33,411 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 18 treesize of output 20 [2024-11-09 10:45:33,435 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:45:33,436 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-11-09 10:45:33,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 10:45:33,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 10:45:33,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 10:45:33,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 10:45:33,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 20 treesize of output 15 [2024-11-09 10:45:33,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 10:45:33,614 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 21 treesize of output 9 [2024-11-09 10:45:33,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:45:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:45:33,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:45:33,749 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_678) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_679 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_678) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_679) |c_~#c~0.base|) .cse1)))))) is different from false [2024-11-09 10:45:33,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((|v_ULTIMATE.start_new_~p~0#1.base_52| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_52|))) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_new_~p~0#1.base_52| v_ArrVal_678) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))))) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_52| (_ BitVec 32))) (or (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_679 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_new_~p~0#1.base_52| v_ArrVal_678) |c_~#c~0.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_52| (_ bv12 32)) (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_new_~p~0#1.base_52| v_ArrVal_679) |c_~#c~0.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_52|))))))) is different from false [2024-11-09 10:45:34,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:45:34,017 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-11-09 10:45:34,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:45:34,032 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-11-09 10:45:34,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:45:34,060 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-11-09 10:45:34,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:45:34,111 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-11-09 10:45:34,125 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-11-09 10:45:34,135 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-11-09 10:45:34,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:45:34,211 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-11-09 10:45:34,229 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-11-09 10:45:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 10:45:35,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:45:35,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389705231] [2024-11-09 10:45:35,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389705231] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:45:35,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:45:35,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-11-09 10:45:35,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460442117] [2024-11-09 10:45:35,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:45:35,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:45:35,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:45:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:45:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=167, Unknown=10, NotChecked=54, Total=272 [2024-11-09 10:45:35,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 130 [2024-11-09 10:45:35,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 123 transitions, 543 flow. Second operand has 17 states, 17 states have (on average 22.235294117647058) internal successors, (378), 17 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:45:35,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:45:35,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 130 [2024-11-09 10:45:35,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:45:38,025 INFO L124 PetriNetUnfolderBase]: 466/1255 cut-off events. [2024-11-09 10:45:38,025 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2024-11-09 10:45:38,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2578 conditions, 1255 events. 466/1255 cut-off events. For 201/201 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 2389. Up to 951 conditions per place. [2024-11-09 10:45:38,031 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 84 selfloop transitions, 24 changer transitions 0/128 dead transitions. [2024-11-09 10:45:38,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 128 transitions, 773 flow [2024-11-09 10:45:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:45:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:45:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 332 transitions. [2024-11-09 10:45:38,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2128205128205128 [2024-11-09 10:45:38,034 INFO L175 Difference]: Start difference. First operand has 149 places, 123 transitions, 543 flow. Second operand 12 states and 332 transitions. [2024-11-09 10:45:38,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 128 transitions, 773 flow [2024-11-09 10:45:38,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 128 transitions, 678 flow, removed 13 selfloop flow, removed 14 redundant places. [2024-11-09 10:45:38,040 INFO L231 Difference]: Finished difference. Result has 147 places, 124 transitions, 504 flow [2024-11-09 10:45:38,040 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=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=504, PETRI_PLACES=147, PETRI_TRANSITIONS=124} [2024-11-09 10:45:38,042 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 33 predicate places. [2024-11-09 10:45:38,042 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 124 transitions, 504 flow [2024-11-09 10:45:38,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 22.235294117647058) internal successors, (378), 17 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:45:38,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:45:38,043 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2024-11-09 10:45:38,055 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 (17)] Forceful destruction successful, exit code 0 [2024-11-09 10:45:38,243 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-11-09 10:45:38,243 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-11-09 10:45:38,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:45:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash 460598045, now seen corresponding path program 2 times [2024-11-09 10:45:38,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:45:38,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671437048] [2024-11-09 10:45:38,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:45:38,244 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-11-09 10:45:38,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:45:38,246 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-11-09 10:45:38,246 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-11-09 10:45:39,067 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:45:39,067 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:45:39,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:45:39,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:45:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:45:39,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:45:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:45:39,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:45:39,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671437048] [2024-11-09 10:45:39,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671437048] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:45:39,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:45:39,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-09 10:45:39,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832499629] [2024-11-09 10:45:39,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:45:39,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:45:39,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:45:39,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:45:39,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:45:39,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-11-09 10:45:39,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 124 transitions, 504 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-11-09 10:45:39,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:45:39,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-11-09 10:45:39,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:45:40,244 INFO L124 PetriNetUnfolderBase]: 128/695 cut-off events. [2024-11-09 10:45:40,244 INFO L125 PetriNetUnfolderBase]: For 490/491 co-relation queries the response was YES. [2024-11-09 10:45:40,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 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 2988 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-11-09 10:45:40,248 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 95 selfloop transitions, 23 changer transitions 0/176 dead transitions. [2024-11-09 10:45:40,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 176 transitions, 1184 flow [2024-11-09 10:45:40,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:45:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:45:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 950 transitions. [2024-11-09 10:45:40,253 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2024-11-09 10:45:40,253 INFO L175 Difference]: Start difference. First operand has 147 places, 124 transitions, 504 flow. Second operand 12 states and 950 transitions. [2024-11-09 10:45:40,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 176 transitions, 1184 flow [2024-11-09 10:45:40,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 176 transitions, 1042 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-11-09 10:45:40,259 INFO L231 Difference]: Finished difference. Result has 155 places, 137 transitions, 686 flow [2024-11-09 10:45:40,260 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-11-09 10:45:40,260 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 41 predicate places. [2024-11-09 10:45:40,261 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 137 transitions, 686 flow [2024-11-09 10:45:40,261 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-11-09 10:45:40,261 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:45:40,262 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-11-09 10:45:40,277 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-11-09 10:45:40,462 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-11-09 10:45:40,462 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-11-09 10:45:40,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:45:40,463 INFO L85 PathProgramCache]: Analyzing trace with hash -891699939, now seen corresponding path program 3 times [2024-11-09 10:45:40,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:45:40,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313881796] [2024-11-09 10:45:40,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:45:40,464 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-11-09 10:45:40,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:45:40,465 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-11-09 10:45:40,466 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