./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 19:49:06,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:49:06,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:49:06,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:49:06,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:49:06,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:49:06,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:49:06,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:49:06,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:49:06,692 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:49:06,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:49:06,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:49:06,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:49:06,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:49:06,695 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:49:06,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:49:06,696 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:49:06,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:49:06,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:49:06,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:49:06,697 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:49:06,701 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:49:06,701 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:49:06,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:49:06,702 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:49:06,702 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:49:06,702 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:49:06,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:49:06,703 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:49:06,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:49:06,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:49:06,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:49:06,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:49:06,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:49:06,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:49:06,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:49:06,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:49:06,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:49:06,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:49:06,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:49:06,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:49:06,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:49:06,711 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 [2024-10-11 19:49:07,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:49:07,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:49:07,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:49:07,032 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:49:07,033 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:49:07,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-10-11 19:49:08,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:49:08,834 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:49:08,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-10-11 19:49:08,860 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d711a3bd/22e22335a1404012b923d8f688da21c0/FLAGa4f8f2570 [2024-10-11 19:49:09,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d711a3bd/22e22335a1404012b923d8f688da21c0 [2024-10-11 19:49:09,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:49:09,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:49:09,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:49:09,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:49:09,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:49:09,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:49:09" (1/1) ... [2024-10-11 19:49:09,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@219de814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:09, skipping insertion in model container [2024-10-11 19:49:09,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:49:09" (1/1) ... [2024-10-11 19:49:09,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:49:09,761 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:09,762 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:09,763 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:09,764 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:09,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:49:09,837 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 19:49:09,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7fda2ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:09, skipping insertion in model container [2024-10-11 19:49:09,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:49:09,839 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:49:09,841 INFO L158 Benchmark]: Toolchain (without parser) took 688.49ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 124.7MB in the end (delta: -39.8MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-10-11 19:49:09,841 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory was 112.6MB in the beginning and 112.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:49:09,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 686.07ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 124.7MB in the end (delta: -39.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-10-11 19:49:09,844 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.24ms. Allocated memory is still 159.4MB. Free memory was 112.6MB in the beginning and 112.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 686.07ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 124.7MB in the end (delta: -39.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1058]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 19:49:12,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:49:12,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:49:12,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:49:12,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:49:12,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:49:12,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:49:12,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:49:12,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:49:12,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:49:12,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:49:12,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:49:12,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:49:12,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:49:12,162 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:49:12,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:49:12,162 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:49:12,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:49:12,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:49:12,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:49:12,164 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:49:12,164 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:49:12,165 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:49:12,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:49:12,165 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:49:12,166 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:49:12,166 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:49:12,166 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:49:12,166 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:49:12,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:49:12,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:49:12,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:49:12,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:49:12,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:49:12,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:49:12,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:49:12,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:49:12,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:49:12,179 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:49:12,179 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:49:12,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:49:12,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:49:12,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:49:12,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:49:12,181 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:49:12,181 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 [2024-10-11 19:49:12,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:49:12,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:49:12,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:49:12,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:49:12,570 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:49:12,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-10-11 19:49:14,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:49:14,463 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:49:14,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-10-11 19:49:14,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3d2de918d/be421971928944a7831c4f9b748316ed/FLAGa4784ea49 [2024-10-11 19:49:14,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3d2de918d/be421971928944a7831c4f9b748316ed [2024-10-11 19:49:14,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:49:14,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:49:14,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:49:14,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:49:14,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:49:14,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:49:14" (1/1) ... [2024-10-11 19:49:14,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e63a3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:14, skipping insertion in model container [2024-10-11 19:49:14,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:49:14" (1/1) ... [2024-10-11 19:49:14,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:49:15,318 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:15,319 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:15,320 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:15,320 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:15,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:49:15,400 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:49:15,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:49:15,455 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:15,457 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:15,457 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:15,457 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:15,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:49:15,487 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:49:15,529 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:15,529 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:15,530 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:15,530 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 19:49:15,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:49:15,627 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:49:15,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15 WrapperNode [2024-10-11 19:49:15,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:49:15,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:49:15,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:49:15,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:49:15,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15" (1/1) ... [2024-10-11 19:49:15,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15" (1/1) ... [2024-10-11 19:49:15,694 INFO L138 Inliner]: procedures = 284, calls = 56, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 235 [2024-10-11 19:49:15,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:49:15,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:49:15,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:49:15,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:49:15,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15" (1/1) ... [2024-10-11 19:49:15,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15" (1/1) ... [2024-10-11 19:49:15,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15" (1/1) ... [2024-10-11 19:49:15,751 INFO L175 MemorySlicer]: Split 30 memory accesses to 4 slices as follows [2, 5, 2, 21]. 70 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 14 writes are split as follows [0, 0, 1, 13]. [2024-10-11 19:49:15,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15" (1/1) ... [2024-10-11 19:49:15,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15" (1/1) ... [2024-10-11 19:49:15,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15" (1/1) ... [2024-10-11 19:49:15,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15" (1/1) ... [2024-10-11 19:49:15,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15" (1/1) ... [2024-10-11 19:49:15,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15" (1/1) ... [2024-10-11 19:49:15,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:49:15,795 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:49:15,795 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:49:15,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:49:15,796 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15" (1/1) ... [2024-10-11 19:49:15,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:49:15,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:49:15,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:49:15,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:49:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:49:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:49:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:49:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 19:49:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:49:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:49:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:49:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:49:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 19:49:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:49:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:49:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:49:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:49:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 19:49:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:49:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:49:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:49:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 19:49:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 19:49:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 19:49:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 19:49:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 19:49:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 19:49:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 19:49:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:49:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:49:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:49:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:49:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:49:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 19:49:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-11 19:49:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-11 19:49:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:49:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:49:15,890 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:49:16,094 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:49:16,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:49:16,887 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:49:16,887 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:49:17,170 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:49:17,172 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-11 19:49:17,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:49:17 BoogieIcfgContainer [2024-10-11 19:49:17,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:49:17,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:49:17,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:49:17,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:49:17,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:49:14" (1/3) ... [2024-10-11 19:49:17,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a6b2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:49:17, skipping insertion in model container [2024-10-11 19:49:17,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:15" (2/3) ... [2024-10-11 19:49:17,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a6b2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:49:17, skipping insertion in model container [2024-10-11 19:49:17,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:49:17" (3/3) ... [2024-10-11 19:49:17,188 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_93-evilcollapse_racefree.i [2024-10-11 19:49:17,203 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:49:17,204 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-11 19:49:17,204 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:49:17,278 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 19:49:17,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 130 transitions, 267 flow [2024-10-11 19:49:17,375 INFO L124 PetriNetUnfolderBase]: 19/142 cut-off events. [2024-10-11 19:49:17,376 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 19:49:17,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 142 events. 19/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 531 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2024-10-11 19:49:17,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 130 transitions, 267 flow [2024-10-11 19:49:17,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 130 transitions, 267 flow [2024-10-11 19:49:17,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:49:17,399 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;@3fb1e964, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:49:17,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-10-11 19:49:17,403 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:49:17,403 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-11 19:49:17,403 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:49:17,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:17,404 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:49:17,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:17,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:17,410 INFO L85 PathProgramCache]: Analyzing trace with hash 689099, now seen corresponding path program 1 times [2024-10-11 19:49:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869672734] [2024-10-11 19:49:17,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:17,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:17,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:17,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:17,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 19:49:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:17,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:49:17,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:17,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:49:17,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:17,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869672734] [2024-10-11 19:49:17,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869672734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:49:17,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:49:17,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:49:17,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597138892] [2024-10-11 19:49:17,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:49:17,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:49:17,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:17,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:49:17,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:49:17,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 130 [2024-10-11 19:49:17,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 130 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:17,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:17,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 130 [2024-10-11 19:49:17,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:18,370 INFO L124 PetriNetUnfolderBase]: 126/487 cut-off events. [2024-10-11 19:49:18,370 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-10-11 19:49:18,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 487 events. 126/487 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2675 event pairs, 64 based on Foata normal form. 52/430 useless extension candidates. Maximal degree in co-relation 675. Up to 179 conditions per place. [2024-10-11 19:49:18,377 INFO L140 encePairwiseOnDemand]: 109/130 looper letters, 68 selfloop transitions, 4 changer transitions 0/136 dead transitions. [2024-10-11 19:49:18,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 136 transitions, 423 flow [2024-10-11 19:49:18,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:49:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:49:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 357 transitions. [2024-10-11 19:49:18,417 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6865384615384615 [2024-10-11 19:49:18,423 INFO L175 Difference]: Start difference. First operand has 114 places, 130 transitions, 267 flow. Second operand 4 states and 357 transitions. [2024-10-11 19:49:18,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 136 transitions, 423 flow [2024-10-11 19:49:18,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 136 transitions, 423 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:49:18,448 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 247 flow [2024-10-11 19:49:18,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-10-11 19:49:18,474 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -1 predicate places. [2024-10-11 19:49:18,475 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 247 flow [2024-10-11 19:49:18,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:18,475 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:18,475 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:49:18,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:49:18,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:18,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:18,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:18,678 INFO L85 PathProgramCache]: Analyzing trace with hash 689100, now seen corresponding path program 1 times [2024-10-11 19:49:18,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:18,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385880590] [2024-10-11 19:49:18,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:18,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:18,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:18,682 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:18,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 19:49:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:18,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:49:18,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:18,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:49:18,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:18,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385880590] [2024-10-11 19:49:18,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385880590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:49:18,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:49:18,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:49:18,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723925775] [2024-10-11 19:49:18,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:49:18,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:49:18,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:18,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:49:18,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:49:19,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 130 [2024-10-11 19:49:19,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:19,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:19,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 130 [2024-10-11 19:49:19,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:19,519 INFO L124 PetriNetUnfolderBase]: 128/518 cut-off events. [2024-10-11 19:49:19,520 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-10-11 19:49:19,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 518 events. 128/518 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2781 event pairs, 105 based on Foata normal form. 3/409 useless extension candidates. Maximal degree in co-relation 743. Up to 276 conditions per place. [2024-10-11 19:49:19,525 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 49 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2024-10-11 19:49:19,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 117 transitions, 369 flow [2024-10-11 19:49:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:49:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:49:19,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2024-10-11 19:49:19,528 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-10-11 19:49:19,529 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 247 flow. Second operand 4 states and 325 transitions. [2024-10-11 19:49:19,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 117 transitions, 369 flow [2024-10-11 19:49:19,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 357 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:49:19,533 INFO L231 Difference]: Finished difference. Result has 115 places, 117 transitions, 280 flow [2024-10-11 19:49:19,534 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=115, PETRI_TRANSITIONS=117} [2024-10-11 19:49:19,534 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-10-11 19:49:19,534 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 280 flow [2024-10-11 19:49:19,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:19,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:19,535 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:49:19,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 19:49:19,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:19,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:19,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash -945239132, now seen corresponding path program 1 times [2024-10-11 19:49:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:19,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763457591] [2024-10-11 19:49:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:19,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:19,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:19,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:19,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 19:49:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:19,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:49:19,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:19,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:49:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:19,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:49:19,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763457591] [2024-10-11 19:49:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763457591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:49:19,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:49:19,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:49:19,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080299410] [2024-10-11 19:49:19,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:49:19,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:49:19,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:19,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:49:19,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:49:20,007 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 130 [2024-10-11 19:49:20,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 117 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:20,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:20,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 130 [2024-10-11 19:49:20,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:20,260 INFO L124 PetriNetUnfolderBase]: 128/517 cut-off events. [2024-10-11 19:49:20,261 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2024-10-11 19:49:20,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 517 events. 128/517 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2774 event pairs, 105 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 810. Up to 272 conditions per place. [2024-10-11 19:49:20,265 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 47 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2024-10-11 19:49:20,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 378 flow [2024-10-11 19:49:20,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:49:20,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:49:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-10-11 19:49:20,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.658974358974359 [2024-10-11 19:49:20,267 INFO L175 Difference]: Start difference. First operand has 115 places, 117 transitions, 280 flow. Second operand 3 states and 257 transitions. [2024-10-11 19:49:20,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 378 flow [2024-10-11 19:49:20,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:49:20,271 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 281 flow [2024-10-11 19:49:20,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2024-10-11 19:49:20,272 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-10-11 19:49:20,272 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 281 flow [2024-10-11 19:49:20,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:20,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:20,273 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:49:20,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:49:20,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:20,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:20,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:20,475 INFO L85 PathProgramCache]: Analyzing trace with hash -945239131, now seen corresponding path program 1 times [2024-10-11 19:49:20,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:20,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396647493] [2024-10-11 19:49:20,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:20,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:20,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:20,479 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:20,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 19:49:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:20,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:49:20,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:20,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:49:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:20,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:49:20,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:20,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396647493] [2024-10-11 19:49:20,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396647493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:49:20,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:49:20,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:49:20,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699041107] [2024-10-11 19:49:20,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:49:20,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:49:20,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:20,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:49:20,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:49:20,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 130 [2024-10-11 19:49:20,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:20,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:20,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 130 [2024-10-11 19:49:20,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:21,012 INFO L124 PetriNetUnfolderBase]: 128/516 cut-off events. [2024-10-11 19:49:21,013 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2024-10-11 19:49:21,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 516 events. 128/516 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2775 event pairs, 105 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 809. Up to 272 conditions per place. [2024-10-11 19:49:21,017 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 47 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2024-10-11 19:49:21,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 379 flow [2024-10-11 19:49:21,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:49:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:49:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-10-11 19:49:21,021 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.658974358974359 [2024-10-11 19:49:21,021 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 281 flow. Second operand 3 states and 257 transitions. [2024-10-11 19:49:21,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 379 flow [2024-10-11 19:49:21,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:49:21,024 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 279 flow [2024-10-11 19:49:21,025 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2024-10-11 19:49:21,026 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2024-10-11 19:49:21,026 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 279 flow [2024-10-11 19:49:21,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:21,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:21,026 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 19:49:21,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 19:49:21,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:21,227 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:21,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:21,228 INFO L85 PathProgramCache]: Analyzing trace with hash 762360213, now seen corresponding path program 1 times [2024-10-11 19:49:21,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:21,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763971009] [2024-10-11 19:49:21,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:21,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:21,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:21,232 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:21,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 19:49:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:21,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:49:21,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:21,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:49:21,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:21,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763971009] [2024-10-11 19:49:21,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763971009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:49:21,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:49:21,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:49:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829382023] [2024-10-11 19:49:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:49:21,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:49:21,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:21,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:49:21,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:49:21,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-10-11 19:49:21,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:21,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:21,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-10-11 19:49:21,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:21,620 INFO L124 PetriNetUnfolderBase]: 127/538 cut-off events. [2024-10-11 19:49:21,621 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-10-11 19:49:21,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 538 events. 127/538 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2818 event pairs, 105 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 840. Up to 272 conditions per place. [2024-10-11 19:49:21,624 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 51 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2024-10-11 19:49:21,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 119 transitions, 399 flow [2024-10-11 19:49:21,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:49:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:49:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2024-10-11 19:49:21,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2024-10-11 19:49:21,626 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 279 flow. Second operand 3 states and 265 transitions. [2024-10-11 19:49:21,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 119 transitions, 399 flow [2024-10-11 19:49:21,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 119 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:49:21,630 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 284 flow [2024-10-11 19:49:21,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=115, PETRI_TRANSITIONS=115} [2024-10-11 19:49:21,631 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-10-11 19:49:21,632 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 284 flow [2024-10-11 19:49:21,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:21,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:21,632 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:49:21,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 19:49:21,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:21,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:21,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:21,833 INFO L85 PathProgramCache]: Analyzing trace with hash 762358701, now seen corresponding path program 1 times [2024-10-11 19:49:21,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:21,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840871738] [2024-10-11 19:49:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:21,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:21,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:21,835 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:21,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 19:49:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:21,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:49:21,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:21,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:49:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:21,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:49:21,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:21,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840871738] [2024-10-11 19:49:21,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840871738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:49:21,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:49:21,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:49:21,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348995492] [2024-10-11 19:49:21,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:49:21,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:49:21,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:21,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:49:21,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:49:22,167 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-10-11 19:49:22,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 115 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:22,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:22,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-10-11 19:49:22,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:22,471 INFO L124 PetriNetUnfolderBase]: 127/534 cut-off events. [2024-10-11 19:49:22,472 INFO L125 PetriNetUnfolderBase]: For 32/33 co-relation queries the response was YES. [2024-10-11 19:49:22,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 534 events. 127/534 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2803 event pairs, 105 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 836. Up to 276 conditions per place. [2024-10-11 19:49:22,474 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 48 selfloop transitions, 4 changer transitions 0/113 dead transitions. [2024-10-11 19:49:22,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 384 flow [2024-10-11 19:49:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:49:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:49:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2024-10-11 19:49:22,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6038461538461538 [2024-10-11 19:49:22,476 INFO L175 Difference]: Start difference. First operand has 115 places, 115 transitions, 284 flow. Second operand 4 states and 314 transitions. [2024-10-11 19:49:22,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 384 flow [2024-10-11 19:49:22,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 113 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:49:22,479 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 285 flow [2024-10-11 19:49:22,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2024-10-11 19:49:22,480 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-10-11 19:49:22,480 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 285 flow [2024-10-11 19:49:22,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:22,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:22,481 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:49:22,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:49:22,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:22,686 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:22,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:22,686 INFO L85 PathProgramCache]: Analyzing trace with hash 762358700, now seen corresponding path program 1 times [2024-10-11 19:49:22,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:22,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594395155] [2024-10-11 19:49:22,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:22,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:22,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:22,690 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:22,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 19:49:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:22,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:49:22,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:22,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:49:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:22,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:49:22,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:22,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594395155] [2024-10-11 19:49:22,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594395155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:49:22,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:49:22,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:49:22,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991589050] [2024-10-11 19:49:22,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:49:22,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:49:22,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:22,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:49:22,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:49:22,970 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 130 [2024-10-11 19:49:22,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:22,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:22,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 130 [2024-10-11 19:49:22,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:23,256 INFO L124 PetriNetUnfolderBase]: 127/530 cut-off events. [2024-10-11 19:49:23,256 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-10-11 19:49:23,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 530 events. 127/530 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2788 event pairs, 105 based on Foata normal form. 2/416 useless extension candidates. Maximal degree in co-relation 840. Up to 274 conditions per place. [2024-10-11 19:49:23,259 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 45 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2024-10-11 19:49:23,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 385 flow [2024-10-11 19:49:23,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:49:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:49:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2024-10-11 19:49:23,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2024-10-11 19:49:23,262 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 285 flow. Second operand 5 states and 370 transitions. [2024-10-11 19:49:23,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 385 flow [2024-10-11 19:49:23,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 377 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:49:23,266 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 287 flow [2024-10-11 19:49:23,266 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2024-10-11 19:49:23,267 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2024-10-11 19:49:23,267 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 287 flow [2024-10-11 19:49:23,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:23,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:23,268 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:49:23,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 19:49:23,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:23,469 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:23,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:23,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1812674210, now seen corresponding path program 1 times [2024-10-11 19:49:23,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:23,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451494813] [2024-10-11 19:49:23,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:23,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:23,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:23,471 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:23,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 19:49:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:23,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:49:23,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:23,687 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 19:49:23,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-11 19:49:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:23,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:49:23,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:23,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451494813] [2024-10-11 19:49:23,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451494813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:49:23,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:49:23,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:49:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033822664] [2024-10-11 19:49:23,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:49:23,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:49:23,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:49:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:49:23,880 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-10-11 19:49:23,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 111 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:23,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:23,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-10-11 19:49:23,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:24,242 INFO L124 PetriNetUnfolderBase]: 126/500 cut-off events. [2024-10-11 19:49:24,242 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2024-10-11 19:49:24,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 500 events. 126/500 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2623 event pairs, 64 based on Foata normal form. 2/396 useless extension candidates. Maximal degree in co-relation 812. Up to 182 conditions per place. [2024-10-11 19:49:24,245 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 69 selfloop transitions, 5 changer transitions 0/132 dead transitions. [2024-10-11 19:49:24,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 132 transitions, 477 flow [2024-10-11 19:49:24,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:49:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:49:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 336 transitions. [2024-10-11 19:49:24,246 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2024-10-11 19:49:24,246 INFO L175 Difference]: Start difference. First operand has 114 places, 111 transitions, 287 flow. Second operand 4 states and 336 transitions. [2024-10-11 19:49:24,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 132 transitions, 477 flow [2024-10-11 19:49:24,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 132 transitions, 463 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:49:24,250 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 279 flow [2024-10-11 19:49:24,250 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2024-10-11 19:49:24,251 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2024-10-11 19:49:24,251 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 279 flow [2024-10-11 19:49:24,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:24,252 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:24,252 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:49:24,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 19:49:24,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:24,453 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:24,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:24,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1812674209, now seen corresponding path program 1 times [2024-10-11 19:49:24,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:24,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207488346] [2024-10-11 19:49:24,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:24,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:24,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:24,457 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:24,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 19:49:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:24,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:49:24,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:24,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:49:24,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:49:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:24,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:49:24,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:24,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207488346] [2024-10-11 19:49:24,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207488346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:49:24,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:49:24,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:49:24,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202379935] [2024-10-11 19:49:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:49:24,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:49:24,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:24,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:49:24,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:49:25,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-10-11 19:49:25,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:25,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:25,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-10-11 19:49:25,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:25,515 INFO L124 PetriNetUnfolderBase]: 129/558 cut-off events. [2024-10-11 19:49:25,516 INFO L125 PetriNetUnfolderBase]: For 51/52 co-relation queries the response was YES. [2024-10-11 19:49:25,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 558 events. 129/558 cut-off events. For 51/52 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3042 event pairs, 106 based on Foata normal form. 2/434 useless extension candidates. Maximal degree in co-relation 856. Up to 283 conditions per place. [2024-10-11 19:49:25,519 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 55 selfloop transitions, 5 changer transitions 0/116 dead transitions. [2024-10-11 19:49:25,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 116 transitions, 429 flow [2024-10-11 19:49:25,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:49:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:49:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2024-10-11 19:49:25,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6211538461538462 [2024-10-11 19:49:25,521 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 279 flow. Second operand 4 states and 323 transitions. [2024-10-11 19:49:25,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 116 transitions, 429 flow [2024-10-11 19:49:25,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 413 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:49:25,524 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 315 flow [2024-10-11 19:49:25,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=315, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-10-11 19:49:25,526 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -1 predicate places. [2024-10-11 19:49:25,526 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 315 flow [2024-10-11 19:49:25,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:25,527 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:25,527 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:49:25,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 19:49:25,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:25,728 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:25,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:25,728 INFO L85 PathProgramCache]: Analyzing trace with hash -358324880, now seen corresponding path program 1 times [2024-10-11 19:49:25,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:25,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958848815] [2024-10-11 19:49:25,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:25,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:25,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:25,732 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:25,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 19:49:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:25,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 19:49:25,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:26,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 19:49:26,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 19:49:26,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 19:49:26,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 19:49:26,220 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 19:49:26,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 19:49:26,252 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:49:26,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:49:26,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-11 19:49:26,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-11 19:49:26,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-11 19:49:26,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-11 19:49:26,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-11 19:49:26,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-11 19:49:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:26,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:49:26,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:26,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958848815] [2024-10-11 19:49:26,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958848815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:49:26,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:49:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:49:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828044947] [2024-10-11 19:49:26,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:49:26,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:49:26,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:26,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:49:26,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:49:27,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 130 [2024-10-11 19:49:27,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 315 flow. Second operand has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:27,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:27,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 130 [2024-10-11 19:49:27,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:28,725 INFO L124 PetriNetUnfolderBase]: 129/557 cut-off events. [2024-10-11 19:49:28,725 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2024-10-11 19:49:28,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 557 events. 129/557 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3017 event pairs, 106 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 867. Up to 296 conditions per place. [2024-10-11 19:49:28,728 INFO L140 encePairwiseOnDemand]: 118/130 looper letters, 70 selfloop transitions, 11 changer transitions 0/129 dead transitions. [2024-10-11 19:49:28,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 129 transitions, 515 flow [2024-10-11 19:49:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:49:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:49:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 642 transitions. [2024-10-11 19:49:28,731 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4489510489510489 [2024-10-11 19:49:28,731 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 315 flow. Second operand 11 states and 642 transitions. [2024-10-11 19:49:28,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 129 transitions, 515 flow [2024-10-11 19:49:28,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 129 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:49:28,734 INFO L231 Difference]: Finished difference. Result has 127 places, 118 transitions, 371 flow [2024-10-11 19:49:28,736 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=371, PETRI_PLACES=127, PETRI_TRANSITIONS=118} [2024-10-11 19:49:28,736 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 13 predicate places. [2024-10-11 19:49:28,738 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 118 transitions, 371 flow [2024-10-11 19:49:28,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:28,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:28,738 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:49:28,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 19:49:28,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:28,940 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:28,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:28,940 INFO L85 PathProgramCache]: Analyzing trace with hash -358324881, now seen corresponding path program 1 times [2024-10-11 19:49:28,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:28,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144293226] [2024-10-11 19:49:28,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:28,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:28,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:28,944 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:28,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 19:49:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:29,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 19:49:29,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:29,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 19:49:29,328 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-10-11 19:49:29,408 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-10-11 19:49:29,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16 [2024-10-11 19:49:29,468 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-10-11 19:49:29,519 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-10-11 19:49:29,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-10-11 19:49:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:29,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:49:29,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:29,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144293226] [2024-10-11 19:49:29,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144293226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:49:29,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:49:29,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:49:29,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082080301] [2024-10-11 19:49:29,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:49:29,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:49:29,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:29,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:49:29,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:49:30,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 130 [2024-10-11 19:49:30,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 118 transitions, 371 flow. Second operand has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:30,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:30,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 130 [2024-10-11 19:49:30,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:31,777 INFO L124 PetriNetUnfolderBase]: 127/527 cut-off events. [2024-10-11 19:49:31,777 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2024-10-11 19:49:31,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 527 events. 127/527 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2873 event pairs, 64 based on Foata normal form. 2/427 useless extension candidates. Maximal degree in co-relation 876. Up to 194 conditions per place. [2024-10-11 19:49:31,780 INFO L140 encePairwiseOnDemand]: 118/130 looper letters, 77 selfloop transitions, 20 changer transitions 0/149 dead transitions. [2024-10-11 19:49:31,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 149 transitions, 637 flow [2024-10-11 19:49:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:49:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:49:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 713 transitions. [2024-10-11 19:49:31,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4986013986013986 [2024-10-11 19:49:31,784 INFO L175 Difference]: Start difference. First operand has 127 places, 118 transitions, 371 flow. Second operand 11 states and 713 transitions. [2024-10-11 19:49:31,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 149 transitions, 637 flow [2024-10-11 19:49:31,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 149 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:49:31,788 INFO L231 Difference]: Finished difference. Result has 140 places, 123 transitions, 459 flow [2024-10-11 19:49:31,789 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=459, PETRI_PLACES=140, PETRI_TRANSITIONS=123} [2024-10-11 19:49:31,790 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places. [2024-10-11 19:49:31,790 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 123 transitions, 459 flow [2024-10-11 19:49:31,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:31,791 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:31,791 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:49:31,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 19:49:31,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:31,991 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:31,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:31,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1776831246, now seen corresponding path program 1 times [2024-10-11 19:49:31,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:31,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723162354] [2024-10-11 19:49:31,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:31,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:31,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:31,993 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:31,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 19:49:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:32,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:49:32,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:32,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:49:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:32,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:49:32,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:32,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723162354] [2024-10-11 19:49:32,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723162354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:49:32,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:49:32,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:49:32,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763919603] [2024-10-11 19:49:32,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:49:32,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:49:32,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:32,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:49:32,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:49:32,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 130 [2024-10-11 19:49:32,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 123 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:32,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:32,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 130 [2024-10-11 19:49:32,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:32,681 INFO L124 PetriNetUnfolderBase]: 128/545 cut-off events. [2024-10-11 19:49:32,681 INFO L125 PetriNetUnfolderBase]: For 120/121 co-relation queries the response was YES. [2024-10-11 19:49:32,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 545 events. 128/545 cut-off events. For 120/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2956 event pairs, 105 based on Foata normal form. 8/446 useless extension candidates. Maximal degree in co-relation 927. Up to 273 conditions per place. [2024-10-11 19:49:32,685 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 50 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2024-10-11 19:49:32,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 121 transitions, 577 flow [2024-10-11 19:49:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:49:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:49:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 320 transitions. [2024-10-11 19:49:32,687 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-10-11 19:49:32,687 INFO L175 Difference]: Start difference. First operand has 140 places, 123 transitions, 459 flow. Second operand 4 states and 320 transitions. [2024-10-11 19:49:32,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 121 transitions, 577 flow [2024-10-11 19:49:32,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 121 transitions, 553 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-10-11 19:49:32,691 INFO L231 Difference]: Finished difference. Result has 136 places, 121 transitions, 453 flow [2024-10-11 19:49:32,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=453, PETRI_PLACES=136, PETRI_TRANSITIONS=121} [2024-10-11 19:49:32,692 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 22 predicate places. [2024-10-11 19:49:32,693 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 121 transitions, 453 flow [2024-10-11 19:49:32,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:32,693 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:32,693 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:49:32,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:49:32,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:32,894 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:32,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:32,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1776831245, now seen corresponding path program 1 times [2024-10-11 19:49:32,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:32,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745571709] [2024-10-11 19:49:32,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:32,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:32,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:32,896 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:32,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 19:49:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:33,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:49:33,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:33,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:49:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:33,053 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:49:33,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:33,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745571709] [2024-10-11 19:49:33,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745571709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:49:33,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:49:33,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:49:33,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368988367] [2024-10-11 19:49:33,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:49:33,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:49:33,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:33,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:49:33,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:49:33,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-10-11 19:49:33,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 121 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:33,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:33,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-10-11 19:49:33,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:33,415 INFO L124 PetriNetUnfolderBase]: 128/537 cut-off events. [2024-10-11 19:49:33,415 INFO L125 PetriNetUnfolderBase]: For 116/117 co-relation queries the response was YES. [2024-10-11 19:49:33,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 537 events. 128/537 cut-off events. For 116/117 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2891 event pairs, 105 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 904. Up to 273 conditions per place. [2024-10-11 19:49:33,417 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 52 selfloop transitions, 11 changer transitions 0/119 dead transitions. [2024-10-11 19:49:33,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 119 transitions, 575 flow [2024-10-11 19:49:33,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:49:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:49:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2024-10-11 19:49:33,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6038461538461538 [2024-10-11 19:49:33,419 INFO L175 Difference]: Start difference. First operand has 136 places, 121 transitions, 453 flow. Second operand 4 states and 314 transitions. [2024-10-11 19:49:33,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 119 transitions, 575 flow [2024-10-11 19:49:33,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 119 transitions, 553 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:49:33,422 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 449 flow [2024-10-11 19:49:33,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2024-10-11 19:49:33,423 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 20 predicate places. [2024-10-11 19:49:33,423 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 449 flow [2024-10-11 19:49:33,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:33,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:33,424 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:49:33,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 19:49:33,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:33,625 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:33,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1067367987, now seen corresponding path program 1 times [2024-10-11 19:49:33,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:33,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199526384] [2024-10-11 19:49:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:33,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:33,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:33,627 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:33,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 19:49:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:33,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:49:33,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:33,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:49:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:33,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:33,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199526384] [2024-10-11 19:49:33,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199526384] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:49:33,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:49:33,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-11 19:49:33,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544200855] [2024-10-11 19:49:33,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:49:33,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:49:33,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:33,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:49:33,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:49:33,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-10-11 19:49:33,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 449 flow. Second operand has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:33,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:33,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-10-11 19:49:33,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:34,217 INFO L124 PetriNetUnfolderBase]: 128/587 cut-off events. [2024-10-11 19:49:34,217 INFO L125 PetriNetUnfolderBase]: For 211/212 co-relation queries the response was YES. [2024-10-11 19:49:34,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 587 events. 128/587 cut-off events. For 211/212 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3017 event pairs, 105 based on Foata normal form. 6/493 useless extension candidates. Maximal degree in co-relation 967. Up to 269 conditions per place. [2024-10-11 19:49:34,221 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 65 selfloop transitions, 11 changer transitions 0/134 dead transitions. [2024-10-11 19:49:34,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 134 transitions, 713 flow [2024-10-11 19:49:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:49:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:49:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2024-10-11 19:49:34,224 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6294871794871795 [2024-10-11 19:49:34,224 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 449 flow. Second operand 6 states and 491 transitions. [2024-10-11 19:49:34,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 134 transitions, 713 flow [2024-10-11 19:49:34,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 669 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:49:34,229 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 515 flow [2024-10-11 19:49:34,230 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=140, PETRI_TRANSITIONS=124} [2024-10-11 19:49:34,231 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places. [2024-10-11 19:49:34,231 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 515 flow [2024-10-11 19:49:34,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:34,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:34,232 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:49:34,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:49:34,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:34,432 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:34,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1933789751, now seen corresponding path program 1 times [2024-10-11 19:49:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:34,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985029397] [2024-10-11 19:49:34,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:34,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:34,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:34,436 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:34,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 19:49:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:34,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 19:49:34,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:34,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:49:34,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-10-11 19:49:34,938 INFO L349 Elim1Store]: treesize reduction 86, result has 31.2 percent of original size [2024-10-11 19:49:34,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 59 [2024-10-11 19:49:35,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-10-11 19:49:35,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-10-11 19:49:35,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-10-11 19:49:35,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-11 19:49:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:35,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:49:35,304 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_616) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2024-10-11 19:49:35,322 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_616) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2024-10-11 19:49:35,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:49:35,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-11 19:49:35,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:49:35,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2024-10-11 19:49:35,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-10-11 19:49:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-11 19:49:37,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:37,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985029397] [2024-10-11 19:49:37,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985029397] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:49:37,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:49:37,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-11 19:49:37,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564080685] [2024-10-11 19:49:37,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:49:37,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 19:49:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 19:49:37,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=141, Unknown=9, NotChecked=50, Total=240 [2024-10-11 19:49:37,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 130 [2024-10-11 19:49:37,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 515 flow. Second operand has 16 states, 16 states have (on average 30.125) internal successors, (482), 16 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:37,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:37,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 130 [2024-10-11 19:49:37,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:39,770 INFO L124 PetriNetUnfolderBase]: 330/1033 cut-off events. [2024-10-11 19:49:39,770 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-10-11 19:49:39,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2047 conditions, 1033 events. 330/1033 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6062 event pairs, 292 based on Foata normal form. 6/809 useless extension candidates. Maximal degree in co-relation 1870. Up to 678 conditions per place. [2024-10-11 19:49:39,774 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 78 selfloop transitions, 23 changer transitions 0/129 dead transitions. [2024-10-11 19:49:39,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 129 transitions, 731 flow [2024-10-11 19:49:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:49:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:49:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 393 transitions. [2024-10-11 19:49:39,776 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2748251748251748 [2024-10-11 19:49:39,776 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 515 flow. Second operand 11 states and 393 transitions. [2024-10-11 19:49:39,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 129 transitions, 731 flow [2024-10-11 19:49:39,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 129 transitions, 713 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-10-11 19:49:39,781 INFO L231 Difference]: Finished difference. Result has 148 places, 123 transitions, 539 flow [2024-10-11 19:49:39,781 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=539, PETRI_PLACES=148, PETRI_TRANSITIONS=123} [2024-10-11 19:49:39,782 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 34 predicate places. [2024-10-11 19:49:39,782 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 123 transitions, 539 flow [2024-10-11 19:49:39,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 30.125) internal successors, (482), 16 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:39,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:39,783 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:49:39,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 19:49:39,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:39,983 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:39,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:39,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1933789752, now seen corresponding path program 1 times [2024-10-11 19:49:39,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:39,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629038717] [2024-10-11 19:49:39,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:49:39,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:39,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:39,985 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:39,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 19:49:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:49:40,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 19:49:40,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:40,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:49:40,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-10-11 19:49:40,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 19:49:40,541 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-10-11 19:49:40,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2024-10-11 19:49:40,566 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:49:40,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:49:40,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 19:49:40,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-11 19:49:40,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 19:49:40,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-11 19:49:40,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 19:49:40,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 19:49:40,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 19:49:40,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 19:49:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:40,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:49:40,910 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_724 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_724) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_724 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_724) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_725) |c_~#c~0.base|) .cse1)))))) is different from false [2024-10-11 19:49:40,949 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_724 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_724) |c_~#c~0.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_724 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_724) |c_~#c~0.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_725) |c_~#c~0.base|) .cse1)))))) is different from false [2024-10-11 19:49:41,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:49:41,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 109 [2024-10-11 19:49:41,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:49:41,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 85 [2024-10-11 19:49:41,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:49:41,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 121 [2024-10-11 19:49:41,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:49:41,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 163 [2024-10-11 19:49:41,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2024-10-11 19:49:41,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 79 [2024-10-11 19:49:41,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:49:41,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 112 [2024-10-11 19:49:41,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2024-10-11 19:49:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-11 19:49:42,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:42,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629038717] [2024-10-11 19:49:42,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629038717] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:49:42,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:49:42,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-11 19:49:42,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189866288] [2024-10-11 19:49:42,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:49:42,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 19:49:42,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:42,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 19:49:42,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=154, Unknown=2, NotChecked=50, Total=240 [2024-10-11 19:49:42,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 130 [2024-10-11 19:49:42,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 123 transitions, 539 flow. Second operand has 16 states, 16 states have (on average 22.125) internal successors, (354), 16 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:42,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:42,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 130 [2024-10-11 19:49:42,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:45,878 INFO L124 PetriNetUnfolderBase]: 466/1255 cut-off events. [2024-10-11 19:49:45,879 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-10-11 19:49:45,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 1255 events. 466/1255 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7458 event pairs, 422 based on Foata normal form. 6/837 useless extension candidates. Maximal degree in co-relation 2388. Up to 952 conditions per place. [2024-10-11 19:49:45,885 INFO L140 encePairwiseOnDemand]: 121/130 looper letters, 85 selfloop transitions, 23 changer transitions 0/128 dead transitions. [2024-10-11 19:49:45,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 128 transitions, 769 flow [2024-10-11 19:49:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:49:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:49:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 312 transitions. [2024-10-11 19:49:45,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.21818181818181817 [2024-10-11 19:49:45,887 INFO L175 Difference]: Start difference. First operand has 148 places, 123 transitions, 539 flow. Second operand 11 states and 312 transitions. [2024-10-11 19:49:45,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 128 transitions, 769 flow [2024-10-11 19:49:45,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 128 transitions, 678 flow, removed 13 selfloop flow, removed 13 redundant places. [2024-10-11 19:49:45,892 INFO L231 Difference]: Finished difference. Result has 146 places, 124 transitions, 502 flow [2024-10-11 19:49:45,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=502, PETRI_PLACES=146, PETRI_TRANSITIONS=124} [2024-10-11 19:49:45,894 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 32 predicate places. [2024-10-11 19:49:45,894 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 124 transitions, 502 flow [2024-10-11 19:49:45,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 22.125) internal successors, (354), 16 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:45,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:45,895 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2024-10-11 19:49:45,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:49:46,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:46,095 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:46,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:46,096 INFO L85 PathProgramCache]: Analyzing trace with hash 524578709, now seen corresponding path program 2 times [2024-10-11 19:49:46,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:46,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473693020] [2024-10-11 19:49:46,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:49:46,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:46,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:46,100 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:46,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 19:49:46,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:49:46,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:49:46,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:49:46,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:49:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:46,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:49:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:49:46,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:49:46,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473693020] [2024-10-11 19:49:46,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473693020] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:49:46,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:49:46,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-11 19:49:46,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441774150] [2024-10-11 19:49:46,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:49:46,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 19:49:46,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:49:46,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 19:49:46,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 19:49:46,904 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-10-11 19:49:46,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 124 transitions, 502 flow. Second operand has 12 states, 12 states have (on average 74.91666666666667) internal successors, (899), 12 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:46,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:49:46,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-10-11 19:49:46,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:49:47,806 INFO L124 PetriNetUnfolderBase]: 128/695 cut-off events. [2024-10-11 19:49:47,806 INFO L125 PetriNetUnfolderBase]: For 490/491 co-relation queries the response was YES. [2024-10-11 19:49:47,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 695 events. 128/695 cut-off events. For 490/491 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2977 event pairs, 105 based on Foata normal form. 12/607 useless extension candidates. Maximal degree in co-relation 1126. Up to 269 conditions per place. [2024-10-11 19:49:47,811 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 95 selfloop transitions, 23 changer transitions 0/176 dead transitions. [2024-10-11 19:49:47,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 176 transitions, 1182 flow [2024-10-11 19:49:47,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 19:49:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 19:49:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 950 transitions. [2024-10-11 19:49:47,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2024-10-11 19:49:47,814 INFO L175 Difference]: Start difference. First operand has 146 places, 124 transitions, 502 flow. Second operand 12 states and 950 transitions. [2024-10-11 19:49:47,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 176 transitions, 1182 flow [2024-10-11 19:49:47,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 176 transitions, 1042 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-10-11 19:49:47,821 INFO L231 Difference]: Finished difference. Result has 155 places, 137 transitions, 686 flow [2024-10-11 19:49:47,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=686, PETRI_PLACES=155, PETRI_TRANSITIONS=137} [2024-10-11 19:49:47,821 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 41 predicate places. [2024-10-11 19:49:47,822 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 137 transitions, 686 flow [2024-10-11 19:49:47,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.91666666666667) internal successors, (899), 12 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:49:47,822 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:49:47,823 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-10-11 19:49:47,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-11 19:49:48,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:48,024 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:49:48,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:49:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash -6493035, now seen corresponding path program 3 times [2024-10-11 19:49:48,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:49:48,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557816575] [2024-10-11 19:49:48,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:49:48,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:49:48,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:49:48,027 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:49:48,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-11 19:50:01,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-11 19:50:01,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:50:01,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:50:01,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:50:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:50:01,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:50:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:50:01,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:50:01,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557816575] [2024-10-11 19:50:01,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557816575] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:50:01,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:50:01,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-10-11 19:50:01,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691832129] [2024-10-11 19:50:01,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:50:01,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 19:50:01,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:50:01,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 19:50:01,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-10-11 19:50:01,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-10-11 19:50:01,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 137 transitions, 686 flow. Second operand has 24 states, 24 states have (on average 75.45833333333333) internal successors, (1811), 24 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:50:01,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:50:01,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-10-11 19:50:01,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:50:04,278 INFO L124 PetriNetUnfolderBase]: 128/935 cut-off events. [2024-10-11 19:50:04,278 INFO L125 PetriNetUnfolderBase]: For 1726/1727 co-relation queries the response was YES. [2024-10-11 19:50:04,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2286 conditions, 935 events. 128/935 cut-off events. For 1726/1727 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3000 event pairs, 105 based on Foata normal form. 24/859 useless extension candidates. Maximal degree in co-relation 1524. Up to 269 conditions per place. [2024-10-11 19:50:04,282 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 155 selfloop transitions, 47 changer transitions 0/260 dead transitions. [2024-10-11 19:50:04,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 260 transitions, 2054 flow [2024-10-11 19:50:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 19:50:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-11 19:50:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1868 transitions. [2024-10-11 19:50:04,287 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5987179487179487 [2024-10-11 19:50:04,287 INFO L175 Difference]: Start difference. First operand has 155 places, 137 transitions, 686 flow. Second operand 24 states and 1868 transitions. [2024-10-11 19:50:04,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 260 transitions, 2054 flow [2024-10-11 19:50:04,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 260 transitions, 2042 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:50:04,297 INFO L231 Difference]: Finished difference. Result has 188 places, 162 transitions, 1218 flow [2024-10-11 19:50:04,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1218, PETRI_PLACES=188, PETRI_TRANSITIONS=162} [2024-10-11 19:50:04,298 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 74 predicate places. [2024-10-11 19:50:04,298 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 162 transitions, 1218 flow [2024-10-11 19:50:04,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 75.45833333333333) internal successors, (1811), 24 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:50:04,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:50:04,299 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1] [2024-10-11 19:50:04,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 19:50:04,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:50:04,500 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-11 19:50:04,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:50:04,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1350477461, now seen corresponding path program 4 times [2024-10-11 19:50:04,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:50:04,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343764204] [2024-10-11 19:50:04,502 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:50:04,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:50:04,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:50:04,503 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:50:04,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process