./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:03:45,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:03:45,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 18:03:45,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:03:45,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:03:45,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:03:45,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:03:45,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:03:45,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:03:45,594 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:03:45,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:03:45,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:03:45,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:03:45,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:03:45,596 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:03:45,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:03:45,597 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:03:45,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:03:45,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:03:45,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:03:45,600 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:03:45,601 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:03:45,601 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:03:45,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:03:45,601 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:03:45,602 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:03:45,602 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:03:45,602 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:03:45,602 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:03:45,603 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:03:45,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:03:45,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:03:45,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:03:45,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:03:45,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:03:45,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:03:45,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:03:45,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:03:45,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:03:45,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:03:45,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:03:45,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:03:45,608 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2024-11-10 18:03:45,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:03:45,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:03:45,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:03:45,972 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:03:45,972 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:03:45,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-11-10 18:03:47,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:03:48,071 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:03:48,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-11-10 18:03:48,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b89d072f0/83a5390a05874db38e7cf6e085ee6713/FLAG6bb892df8 [2024-11-10 18:03:48,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b89d072f0/83a5390a05874db38e7cf6e085ee6713 [2024-11-10 18:03:48,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:03:48,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:03:48,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:03:48,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:03:48,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:03:48,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43868997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48, skipping insertion in model container [2024-11-10 18:03:48,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:03:48,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:03:48,813 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-10 18:03:48,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6a87d084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48, skipping insertion in model container [2024-11-10 18:03:48,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:03:48,815 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 18:03:48,817 INFO L158 Benchmark]: Toolchain (without parser) took 679.39ms. Allocated memory is still 146.8MB. Free memory was 89.6MB in the beginning and 66.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 18:03:48,818 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 146.8MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:03:48,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 677.19ms. Allocated memory is still 146.8MB. Free memory was 89.3MB in the beginning and 66.6MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 18:03:48,821 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 146.8MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 677.19ms. Allocated memory is still 146.8MB. Free memory was 89.3MB in the beginning and 66.6MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 3904]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:03:51,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:03:51,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 18:03:51,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:03:51,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:03:51,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:03:51,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:03:51,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:03:51,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:03:51,320 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:03:51,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:03:51,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:03:51,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:03:51,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:03:51,323 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:03:51,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:03:51,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:03:51,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:03:51,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:03:51,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:03:51,329 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:03:51,330 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:03:51,330 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:03:51,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:03:51,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:03:51,331 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:03:51,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:03:51,331 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:03:51,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:03:51,332 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:03:51,332 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:03:51,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:03:51,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:03:51,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:03:51,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:03:51,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:03:51,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:03:51,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:03:51,337 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:03:51,337 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:03:51,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:03:51,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:03:51,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:03:51,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:03:51,339 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2024-11-10 18:03:51,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:03:51,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:03:51,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:03:51,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:03:51,783 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:03:51,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-11-10 18:03:53,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:03:53,939 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:03:53,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-11-10 18:03:54,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bfa7353c/de6a670611ac4483af67c8fdd0af79f8/FLAG77e887518 [2024-11-10 18:03:54,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bfa7353c/de6a670611ac4483af67c8fdd0af79f8 [2024-11-10 18:03:54,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:03:54,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:03:54,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:03:54,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:03:54,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:03:54,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:54,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a222e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54, skipping insertion in model container [2024-11-10 18:03:54,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:54,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:03:54,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:03:54,730 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 18:03:54,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:03:54,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:03:54,826 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:03:54,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:03:54,959 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:03:54,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54 WrapperNode [2024-11-10 18:03:54,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:03:54,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:03:54,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:03:54,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:03:54,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:55,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:55,074 INFO L138 Inliner]: procedures = 249, calls = 44, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 143 [2024-11-10 18:03:55,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:03:55,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:03:55,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:03:55,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:03:55,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:55,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:55,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:55,136 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 13, 2]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 6, 2]. [2024-11-10 18:03:55,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:55,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:55,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:55,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:55,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:55,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:55,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:03:55,182 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:03:55,182 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:03:55,182 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:03:55,187 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2024-11-10 18:03:55,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:03:55,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:03:55,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:03:55,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:03:55,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 18:03:55,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 18:03:55,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 18:03:55,280 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-10 18:03:55,280 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-10 18:03:55,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 18:03:55,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 18:03:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 18:03:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 18:03:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 18:03:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 18:03:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 18:03:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 18:03:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 18:03:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 18:03:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:03:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 18:03:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 18:03:55,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 18:03:55,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:03:55,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:03:55,285 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:03:55,586 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:03:55,589 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:03:56,294 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:03:56,294 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:03:56,517 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:03:56,517 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:03:56,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:03:56 BoogieIcfgContainer [2024-11-10 18:03:56,518 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:03:56,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:03:56,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:03:56,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:03:56,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:03:54" (1/3) ... [2024-11-10 18:03:56,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5120afdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:03:56, skipping insertion in model container [2024-11-10 18:03:56,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (2/3) ... [2024-11-10 18:03:56,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5120afdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:03:56, skipping insertion in model container [2024-11-10 18:03:56,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:03:56" (3/3) ... [2024-11-10 18:03:56,527 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2024-11-10 18:03:56,545 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:03:56,546 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-10 18:03:56,546 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:03:56,645 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 18:03:56,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 126 transitions, 266 flow [2024-11-10 18:03:56,794 INFO L124 PetriNetUnfolderBase]: 18/159 cut-off events. [2024-11-10 18:03:56,794 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:03:56,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 159 events. 18/159 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 481 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2024-11-10 18:03:56,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 126 transitions, 266 flow [2024-11-10 18:03:56,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 124 transitions, 260 flow [2024-11-10 18:03:56,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:03:56,832 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;@711f84d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:03:56,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-10 18:03:56,839 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:03:56,839 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-10 18:03:56,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:03:56,840 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:56,841 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-10 18:03:56,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:03:56,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:56,847 INFO L85 PathProgramCache]: Analyzing trace with hash 499036, now seen corresponding path program 1 times [2024-11-10 18:03:56,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:03:56,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113642545] [2024-11-10 18:03:56,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:56,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:03:56,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:03:56,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:03:56,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 18:03:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:57,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:03:57,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:03:57,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:03:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:03:57,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:03:57,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:03:57,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113642545] [2024-11-10 18:03:57,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113642545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:57,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:57,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:03:57,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021316527] [2024-11-10 18:03:57,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:57,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:03:57,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:03:57,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:03:57,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:03:57,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 126 [2024-11-10 18:03:57,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 124 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:57,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:57,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 126 [2024-11-10 18:03:57,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:58,800 INFO L124 PetriNetUnfolderBase]: 3335/7941 cut-off events. [2024-11-10 18:03:58,801 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-10 18:03:58,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13268 conditions, 7941 events. 3335/7941 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 74705 event pairs, 407 based on Foata normal form. 588/5747 useless extension candidates. Maximal degree in co-relation 13028. Up to 4555 conditions per place. [2024-11-10 18:03:58,880 INFO L140 encePairwiseOnDemand]: 108/126 looper letters, 79 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2024-11-10 18:03:58,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 124 transitions, 422 flow [2024-11-10 18:03:58,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:03:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:03:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2024-11-10 18:03:58,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6137566137566137 [2024-11-10 18:03:58,898 INFO L175 Difference]: Start difference. First operand has 116 places, 124 transitions, 260 flow. Second operand 3 states and 232 transitions. [2024-11-10 18:03:58,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 124 transitions, 422 flow [2024-11-10 18:03:58,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 124 transitions, 414 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:03:58,908 INFO L231 Difference]: Finished difference. Result has 104 places, 102 transitions, 212 flow [2024-11-10 18:03:58,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=104, PETRI_TRANSITIONS=102} [2024-11-10 18:03:58,917 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -12 predicate places. [2024-11-10 18:03:58,917 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 102 transitions, 212 flow [2024-11-10 18:03:58,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:58,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:58,918 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-10 18:03:58,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 18:03:59,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:03:59,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:03:59,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash 499037, now seen corresponding path program 1 times [2024-11-10 18:03:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:03:59,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985335098] [2024-11-10 18:03:59,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:59,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:03:59,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:03:59,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:03:59,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 18:03:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:59,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:03:59,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:03:59,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:03:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:03:59,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:03:59,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:03:59,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985335098] [2024-11-10 18:03:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985335098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:59,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:59,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:03:59,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500164530] [2024-11-10 18:03:59,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:59,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:03:59,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:03:59,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:03:59,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:03:59,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 126 [2024-11-10 18:03:59,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 102 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:59,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:59,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 126 [2024-11-10 18:03:59,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:00,623 INFO L124 PetriNetUnfolderBase]: 3335/7937 cut-off events. [2024-11-10 18:04:00,624 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2024-11-10 18:04:00,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13381 conditions, 7937 events. 3335/7937 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 74739 event pairs, 407 based on Foata normal form. 2/5157 useless extension candidates. Maximal degree in co-relation 1475. Up to 4555 conditions per place. [2024-11-10 18:04:00,689 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 77 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2024-11-10 18:04:00,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 120 transitions, 406 flow [2024-11-10 18:04:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:04:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:04:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-11-10 18:04:00,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-10 18:04:00,692 INFO L175 Difference]: Start difference. First operand has 104 places, 102 transitions, 212 flow. Second operand 3 states and 224 transitions. [2024-11-10 18:04:00,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 120 transitions, 406 flow [2024-11-10 18:04:00,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 120 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:04:00,696 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 204 flow [2024-11-10 18:04:00,697 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2024-11-10 18:04:00,697 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -16 predicate places. [2024-11-10 18:04:00,698 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 204 flow [2024-11-10 18:04:00,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:00,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:00,698 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 18:04:00,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 18:04:00,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:00,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:00,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash 15468407, now seen corresponding path program 1 times [2024-11-10 18:04:00,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:00,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685711045] [2024-11-10 18:04:00,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:00,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:00,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:00,903 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:00,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 18:04:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:00,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:04:00,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:01,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:01,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:01,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685711045] [2024-11-10 18:04:01,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685711045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:01,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:01,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:04:01,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493588835] [2024-11-10 18:04:01,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:01,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:04:01,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:01,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:04:01,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:04:01,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 126 [2024-11-10 18:04:01,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 98 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:01,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:01,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 126 [2024-11-10 18:04:01,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:02,026 INFO L124 PetriNetUnfolderBase]: 3334/6172 cut-off events. [2024-11-10 18:04:02,026 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2024-11-10 18:04:02,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11616 conditions, 6172 events. 3334/6172 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 43688 event pairs, 3069 based on Foata normal form. 1/4209 useless extension candidates. Maximal degree in co-relation 6372. Up to 4873 conditions per place. [2024-11-10 18:04:02,086 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 77 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2024-11-10 18:04:02,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 119 transitions, 404 flow [2024-11-10 18:04:02,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:04:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:04:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2024-11-10 18:04:02,094 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6084656084656085 [2024-11-10 18:04:02,094 INFO L175 Difference]: Start difference. First operand has 100 places, 98 transitions, 204 flow. Second operand 3 states and 230 transitions. [2024-11-10 18:04:02,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 119 transitions, 404 flow [2024-11-10 18:04:02,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 119 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:04:02,099 INFO L231 Difference]: Finished difference. Result has 100 places, 97 transitions, 202 flow [2024-11-10 18:04:02,100 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=100, PETRI_TRANSITIONS=97} [2024-11-10 18:04:02,100 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -16 predicate places. [2024-11-10 18:04:02,101 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 97 transitions, 202 flow [2024-11-10 18:04:02,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:02,101 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:02,101 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:02,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 18:04:02,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:02,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:02,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:02,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1965575737, now seen corresponding path program 1 times [2024-11-10 18:04:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:02,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714123071] [2024-11-10 18:04:02,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:02,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:02,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:02,314 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:02,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 18:04:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:02,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 18:04:02,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:02,515 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:02,516 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:02,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:02,525 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 32 treesize of output 41 [2024-11-10 18:04:02,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:04:02,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 63 [2024-11-10 18:04:02,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:04:02,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 49 [2024-11-10 18:04:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:02,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:02,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:02,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714123071] [2024-11-10 18:04:02,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714123071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:02,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:02,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:04:02,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419440952] [2024-11-10 18:04:02,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:02,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:04:02,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:02,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:04:02,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:04:03,049 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 126 [2024-11-10 18:04:03,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 97 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:03,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:03,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 126 [2024-11-10 18:04:03,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:04,308 INFO L124 PetriNetUnfolderBase]: 3862/7157 cut-off events. [2024-11-10 18:04:04,308 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-10 18:04:04,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13420 conditions, 7157 events. 3862/7157 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 51299 event pairs, 2535 based on Foata normal form. 1/4882 useless extension candidates. Maximal degree in co-relation 12451. Up to 6014 conditions per place. [2024-11-10 18:04:04,369 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 65 selfloop transitions, 7 changer transitions 0/106 dead transitions. [2024-11-10 18:04:04,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 106 transitions, 365 flow [2024-11-10 18:04:04,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:04:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:04:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 308 transitions. [2024-11-10 18:04:04,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-11-10 18:04:04,373 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 202 flow. Second operand 5 states and 308 transitions. [2024-11-10 18:04:04,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 106 transitions, 365 flow [2024-11-10 18:04:04,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 106 transitions, 361 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:04:04,387 INFO L231 Difference]: Finished difference. Result has 100 places, 97 transitions, 224 flow [2024-11-10 18:04:04,387 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=100, PETRI_TRANSITIONS=97} [2024-11-10 18:04:04,388 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -16 predicate places. [2024-11-10 18:04:04,388 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 97 transitions, 224 flow [2024-11-10 18:04:04,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:04,388 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:04,389 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:04,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 18:04:04,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:04,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:04,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:04,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1080134632, now seen corresponding path program 1 times [2024-11-10 18:04:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:04,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015854269] [2024-11-10 18:04:04,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:04,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:04,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:04,596 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:04,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 18:04:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:04,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 18:04:04,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:04,782 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:04,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:04,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:04,789 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 32 treesize of output 41 [2024-11-10 18:04:04,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:04:04,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 45 [2024-11-10 18:04:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:04,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:04,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:04,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015854269] [2024-11-10 18:04:04,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015854269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:04,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:04,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:04:04,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199388734] [2024-11-10 18:04:04,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:04,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:04:04,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:04,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:04:04,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:04:05,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 126 [2024-11-10 18:04:05,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 97 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:05,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:05,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 126 [2024-11-10 18:04:05,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:06,268 INFO L124 PetriNetUnfolderBase]: 3862/7154 cut-off events. [2024-11-10 18:04:06,268 INFO L125 PetriNetUnfolderBase]: For 464/464 co-relation queries the response was YES. [2024-11-10 18:04:06,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13819 conditions, 7154 events. 3862/7154 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 51362 event pairs, 2535 based on Foata normal form. 1/5243 useless extension candidates. Maximal degree in co-relation 7460. Up to 6014 conditions per place. [2024-11-10 18:04:06,315 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 64 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2024-11-10 18:04:06,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 103 transitions, 377 flow [2024-11-10 18:04:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:04:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:04:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 263 transitions. [2024-11-10 18:04:06,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5218253968253969 [2024-11-10 18:04:06,317 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 224 flow. Second operand 4 states and 263 transitions. [2024-11-10 18:04:06,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 103 transitions, 377 flow [2024-11-10 18:04:06,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 369 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:04:06,320 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 222 flow [2024-11-10 18:04:06,320 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-11-10 18:04:06,321 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -19 predicate places. [2024-11-10 18:04:06,321 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 222 flow [2024-11-10 18:04:06,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:06,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:06,322 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:06,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-10 18:04:06,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:06,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:06,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:06,527 INFO L85 PathProgramCache]: Analyzing trace with hash 404573256, now seen corresponding path program 1 times [2024-11-10 18:04:06,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:06,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295686152] [2024-11-10 18:04:06,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:06,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:06,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:06,532 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:06,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 18:04:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:06,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:04:06,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:06,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:06,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:06,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:06,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295686152] [2024-11-10 18:04:06,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295686152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:06,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:04:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798356411] [2024-11-10 18:04:06,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:06,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:04:06,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:04:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:04:06,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 126 [2024-11-10 18:04:06,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:06,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:06,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 126 [2024-11-10 18:04:06,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:08,205 INFO L124 PetriNetUnfolderBase]: 2944/6646 cut-off events. [2024-11-10 18:04:08,206 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2024-11-10 18:04:08,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11850 conditions, 6646 events. 2944/6646 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 56468 event pairs, 219 based on Foata normal form. 0/4796 useless extension candidates. Maximal degree in co-relation 5794. Up to 2287 conditions per place. [2024-11-10 18:04:08,252 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 144 selfloop transitions, 15 changer transitions 1/194 dead transitions. [2024-11-10 18:04:08,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 194 transitions, 769 flow [2024-11-10 18:04:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:04:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:04:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 524 transitions. [2024-11-10 18:04:08,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5198412698412699 [2024-11-10 18:04:08,256 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 222 flow. Second operand 8 states and 524 transitions. [2024-11-10 18:04:08,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 194 transitions, 769 flow [2024-11-10 18:04:08,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 194 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:04:08,260 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 321 flow [2024-11-10 18:04:08,261 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=321, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2024-11-10 18:04:08,261 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -10 predicate places. [2024-11-10 18:04:08,262 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 321 flow [2024-11-10 18:04:08,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:08,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:08,262 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:08,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 18:04:08,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:08,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:08,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:08,464 INFO L85 PathProgramCache]: Analyzing trace with hash 404573257, now seen corresponding path program 1 times [2024-11-10 18:04:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:08,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15529303] [2024-11-10 18:04:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:08,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:08,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:08,469 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:08,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 18:04:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:08,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 18:04:08,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:08,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:04:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:08,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:08,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:08,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15529303] [2024-11-10 18:04:08,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15529303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:08,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:08,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:04:08,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543295363] [2024-11-10 18:04:08,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:08,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:04:08,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:08,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:04:08,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:04:09,030 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 126 [2024-11-10 18:04:09,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:09,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:09,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 126 [2024-11-10 18:04:09,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:10,081 INFO L124 PetriNetUnfolderBase]: 1996/4552 cut-off events. [2024-11-10 18:04:10,081 INFO L125 PetriNetUnfolderBase]: For 2388/2388 co-relation queries the response was YES. [2024-11-10 18:04:10,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9549 conditions, 4552 events. 1996/4552 cut-off events. For 2388/2388 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 36209 event pairs, 299 based on Foata normal form. 510/4136 useless extension candidates. Maximal degree in co-relation 7724. Up to 2365 conditions per place. [2024-11-10 18:04:10,121 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 128 selfloop transitions, 12 changer transitions 2/178 dead transitions. [2024-11-10 18:04:10,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 178 transitions, 782 flow [2024-11-10 18:04:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:04:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:04:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 469 transitions. [2024-11-10 18:04:10,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2024-11-10 18:04:10,124 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 321 flow. Second operand 7 states and 469 transitions. [2024-11-10 18:04:10,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 178 transitions, 782 flow [2024-11-10 18:04:10,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 178 transitions, 782 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:04:10,135 INFO L231 Difference]: Finished difference. Result has 115 places, 106 transitions, 379 flow [2024-11-10 18:04:10,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=379, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2024-11-10 18:04:10,136 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -1 predicate places. [2024-11-10 18:04:10,136 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 379 flow [2024-11-10 18:04:10,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:10,137 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:10,137 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:10,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 18:04:10,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:10,342 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:10,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:10,344 INFO L85 PathProgramCache]: Analyzing trace with hash -345409530, now seen corresponding path program 1 times [2024-11-10 18:04:10,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:10,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896428870] [2024-11-10 18:04:10,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:10,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:10,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:10,349 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:10,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 18:04:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:10,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:04:10,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:10,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:04:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:10,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:10,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:10,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896428870] [2024-11-10 18:04:10,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896428870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:10,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:10,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:04:10,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395528371] [2024-11-10 18:04:10,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:10,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:04:10,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:10,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:04:10,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:04:10,717 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 126 [2024-11-10 18:04:10,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:10,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:10,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 126 [2024-11-10 18:04:10,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:11,234 INFO L124 PetriNetUnfolderBase]: 1996/3986 cut-off events. [2024-11-10 18:04:11,235 INFO L125 PetriNetUnfolderBase]: For 4093/4093 co-relation queries the response was YES. [2024-11-10 18:04:11,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9629 conditions, 3986 events. 1996/3986 cut-off events. For 4093/4093 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 27221 event pairs, 1042 based on Foata normal form. 146/3519 useless extension candidates. Maximal degree in co-relation 8295. Up to 1747 conditions per place. [2024-11-10 18:04:11,266 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 92 selfloop transitions, 6 changer transitions 0/128 dead transitions. [2024-11-10 18:04:11,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 128 transitions, 631 flow [2024-11-10 18:04:11,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:04:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:04:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2024-11-10 18:04:11,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.58994708994709 [2024-11-10 18:04:11,269 INFO L175 Difference]: Start difference. First operand has 115 places, 106 transitions, 379 flow. Second operand 3 states and 223 transitions. [2024-11-10 18:04:11,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 128 transitions, 631 flow [2024-11-10 18:04:11,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 128 transitions, 617 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:04:11,277 INFO L231 Difference]: Finished difference. Result has 114 places, 107 transitions, 397 flow [2024-11-10 18:04:11,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=114, PETRI_TRANSITIONS=107} [2024-11-10 18:04:11,278 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -2 predicate places. [2024-11-10 18:04:11,278 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 107 transitions, 397 flow [2024-11-10 18:04:11,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:11,278 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:11,279 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:11,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-10 18:04:11,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:11,485 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:11,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash -345409531, now seen corresponding path program 1 times [2024-11-10 18:04:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:11,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876959015] [2024-11-10 18:04:11,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:11,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:11,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:11,490 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:11,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 18:04:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:11,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:04:11,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:11,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:11,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:11,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:11,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876959015] [2024-11-10 18:04:11,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876959015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:11,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:11,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:04:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283392805] [2024-11-10 18:04:11,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:11,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:04:11,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:11,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:04:11,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:04:11,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 126 [2024-11-10 18:04:11,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 107 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:11,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:11,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 126 [2024-11-10 18:04:11,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:12,215 INFO L124 PetriNetUnfolderBase]: 2248/4143 cut-off events. [2024-11-10 18:04:12,215 INFO L125 PetriNetUnfolderBase]: For 4376/4376 co-relation queries the response was YES. [2024-11-10 18:04:12,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10557 conditions, 4143 events. 2248/4143 cut-off events. For 4376/4376 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 25752 event pairs, 1399 based on Foata normal form. 0/3549 useless extension candidates. Maximal degree in co-relation 8996. Up to 2473 conditions per place. [2024-11-10 18:04:12,239 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 81 selfloop transitions, 7 changer transitions 0/116 dead transitions. [2024-11-10 18:04:12,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 597 flow [2024-11-10 18:04:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:04:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:04:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2024-11-10 18:04:12,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5502645502645502 [2024-11-10 18:04:12,240 INFO L175 Difference]: Start difference. First operand has 114 places, 107 transitions, 397 flow. Second operand 3 states and 208 transitions. [2024-11-10 18:04:12,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 597 flow [2024-11-10 18:04:12,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 116 transitions, 591 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:04:12,251 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 395 flow [2024-11-10 18:04:12,251 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2024-11-10 18:04:12,253 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -6 predicate places. [2024-11-10 18:04:12,253 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 395 flow [2024-11-10 18:04:12,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:12,253 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:12,253 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:12,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 18:04:12,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:12,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:12,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2048098653, now seen corresponding path program 1 times [2024-11-10 18:04:12,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:12,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591014881] [2024-11-10 18:04:12,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:12,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:12,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:12,461 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:12,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 18:04:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:12,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:04:12,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:12,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:12,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:12,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:12,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591014881] [2024-11-10 18:04:12,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591014881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:12,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:12,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:04:12,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857624815] [2024-11-10 18:04:12,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:12,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:04:12,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:12,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:04:12,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:04:12,786 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 126 [2024-11-10 18:04:12,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 395 flow. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:12,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:12,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 126 [2024-11-10 18:04:12,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:13,644 INFO L124 PetriNetUnfolderBase]: 1966/3892 cut-off events. [2024-11-10 18:04:13,644 INFO L125 PetriNetUnfolderBase]: For 3974/3974 co-relation queries the response was YES. [2024-11-10 18:04:13,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9628 conditions, 3892 events. 1966/3892 cut-off events. For 3974/3974 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 25678 event pairs, 282 based on Foata normal form. 0/3478 useless extension candidates. Maximal degree in co-relation 8364. Up to 1169 conditions per place. [2024-11-10 18:04:13,662 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 129 selfloop transitions, 20 changer transitions 0/178 dead transitions. [2024-11-10 18:04:13,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 178 transitions, 994 flow [2024-11-10 18:04:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:04:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:04:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 499 transitions. [2024-11-10 18:04:13,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49503968253968256 [2024-11-10 18:04:13,665 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 395 flow. Second operand 8 states and 499 transitions. [2024-11-10 18:04:13,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 178 transitions, 994 flow [2024-11-10 18:04:13,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 178 transitions, 976 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:04:13,675 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 530 flow [2024-11-10 18:04:13,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=530, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2024-11-10 18:04:13,676 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 3 predicate places. [2024-11-10 18:04:13,676 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 530 flow [2024-11-10 18:04:13,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:13,677 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:13,677 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:13,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-10 18:04:13,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:13,877 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:13,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2048098652, now seen corresponding path program 1 times [2024-11-10 18:04:13,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:13,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038382228] [2024-11-10 18:04:13,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:13,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:13,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:13,880 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:13,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 18:04:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:14,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 18:04:14,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:14,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:04:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:14,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:14,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:14,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038382228] [2024-11-10 18:04:14,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038382228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:14,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:14,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:04:14,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573406401] [2024-11-10 18:04:14,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:14,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:04:14,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:14,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:04:14,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:04:14,351 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 126 [2024-11-10 18:04:14,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 112 transitions, 530 flow. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:14,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:14,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 126 [2024-11-10 18:04:14,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:14,987 INFO L124 PetriNetUnfolderBase]: 1356/2757 cut-off events. [2024-11-10 18:04:14,988 INFO L125 PetriNetUnfolderBase]: For 4732/4732 co-relation queries the response was YES. [2024-11-10 18:04:14,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7879 conditions, 2757 events. 1356/2757 cut-off events. For 4732/4732 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17159 event pairs, 443 based on Foata normal form. 357/3103 useless extension candidates. Maximal degree in co-relation 6891. Up to 1762 conditions per place. [2024-11-10 18:04:15,001 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 116 selfloop transitions, 17 changer transitions 1/165 dead transitions. [2024-11-10 18:04:15,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 165 transitions, 1009 flow [2024-11-10 18:04:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:04:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:04:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 445 transitions. [2024-11-10 18:04:15,003 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5045351473922902 [2024-11-10 18:04:15,004 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 530 flow. Second operand 7 states and 445 transitions. [2024-11-10 18:04:15,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 165 transitions, 1009 flow [2024-11-10 18:04:15,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 165 transitions, 1006 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:04:15,016 INFO L231 Difference]: Finished difference. Result has 127 places, 115 transitions, 612 flow [2024-11-10 18:04:15,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=612, PETRI_PLACES=127, PETRI_TRANSITIONS=115} [2024-11-10 18:04:15,017 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 11 predicate places. [2024-11-10 18:04:15,017 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 115 transitions, 612 flow [2024-11-10 18:04:15,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:15,018 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:15,018 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:15,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-10 18:04:15,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:15,222 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:15,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:15,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1306727191, now seen corresponding path program 1 times [2024-11-10 18:04:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:15,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108476518] [2024-11-10 18:04:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:15,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:15,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:15,226 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:15,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-10 18:04:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:15,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 18:04:15,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:15,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:15,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:04:15,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:15,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 18:04:15,673 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 18:04:15,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 18:04:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:15,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:15,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:15,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108476518] [2024-11-10 18:04:15,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108476518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:15,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:15,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:04:15,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107467] [2024-11-10 18:04:15,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:15,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:04:15,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:15,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:04:15,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:04:16,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 126 [2024-11-10 18:04:16,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 115 transitions, 612 flow. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:16,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:16,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 126 [2024-11-10 18:04:16,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:17,042 INFO L124 PetriNetUnfolderBase]: 1646/3252 cut-off events. [2024-11-10 18:04:17,042 INFO L125 PetriNetUnfolderBase]: For 6555/6555 co-relation queries the response was YES. [2024-11-10 18:04:17,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9812 conditions, 3252 events. 1646/3252 cut-off events. For 6555/6555 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20617 event pairs, 542 based on Foata normal form. 27/3268 useless extension candidates. Maximal degree in co-relation 8616. Up to 745 conditions per place. [2024-11-10 18:04:17,058 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 139 selfloop transitions, 21 changer transitions 0/191 dead transitions. [2024-11-10 18:04:17,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 191 transitions, 1236 flow [2024-11-10 18:04:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:04:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:04:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 530 transitions. [2024-11-10 18:04:17,060 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4673721340388007 [2024-11-10 18:04:17,061 INFO L175 Difference]: Start difference. First operand has 127 places, 115 transitions, 612 flow. Second operand 9 states and 530 transitions. [2024-11-10 18:04:17,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 191 transitions, 1236 flow [2024-11-10 18:04:17,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 191 transitions, 1202 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 18:04:17,072 INFO L231 Difference]: Finished difference. Result has 127 places, 113 transitions, 620 flow [2024-11-10 18:04:17,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=620, PETRI_PLACES=127, PETRI_TRANSITIONS=113} [2024-11-10 18:04:17,073 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 11 predicate places. [2024-11-10 18:04:17,073 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 113 transitions, 620 flow [2024-11-10 18:04:17,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:17,073 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:17,073 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:17,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-10 18:04:17,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:17,274 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:17,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash -687938319, now seen corresponding path program 1 times [2024-11-10 18:04:17,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:17,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332949857] [2024-11-10 18:04:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:17,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:17,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:17,277 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:17,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-10 18:04:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:17,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 18:04:17,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:17,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:04:17,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:17,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:17,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 18:04:17,695 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 18:04:17,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 18:04:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:17,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:17,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:17,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332949857] [2024-11-10 18:04:17,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332949857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:17,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:17,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:04:17,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593236540] [2024-11-10 18:04:17,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:17,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:04:17,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:17,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:04:17,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:04:18,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 126 [2024-11-10 18:04:18,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 113 transitions, 620 flow. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:18,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:18,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 126 [2024-11-10 18:04:18,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:19,189 INFO L124 PetriNetUnfolderBase]: 2084/4008 cut-off events. [2024-11-10 18:04:19,189 INFO L125 PetriNetUnfolderBase]: For 8428/8428 co-relation queries the response was YES. [2024-11-10 18:04:19,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12568 conditions, 4008 events. 2084/4008 cut-off events. For 8428/8428 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 26244 event pairs, 864 based on Foata normal form. 24/4024 useless extension candidates. Maximal degree in co-relation 8783. Up to 962 conditions per place. [2024-11-10 18:04:19,213 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 136 selfloop transitions, 21 changer transitions 0/188 dead transitions. [2024-11-10 18:04:19,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 188 transitions, 1258 flow [2024-11-10 18:04:19,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:04:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:04:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 524 transitions. [2024-11-10 18:04:19,216 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4620811287477954 [2024-11-10 18:04:19,216 INFO L175 Difference]: Start difference. First operand has 127 places, 113 transitions, 620 flow. Second operand 9 states and 524 transitions. [2024-11-10 18:04:19,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 188 transitions, 1258 flow [2024-11-10 18:04:19,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 188 transitions, 1206 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-10 18:04:19,238 INFO L231 Difference]: Finished difference. Result has 125 places, 111 transitions, 614 flow [2024-11-10 18:04:19,238 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=614, PETRI_PLACES=125, PETRI_TRANSITIONS=111} [2024-11-10 18:04:19,239 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 9 predicate places. [2024-11-10 18:04:19,239 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 111 transitions, 614 flow [2024-11-10 18:04:19,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:19,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:19,240 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:19,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-10 18:04:19,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:19,441 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:19,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:19,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1298839445, now seen corresponding path program 1 times [2024-11-10 18:04:19,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:19,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795597343] [2024-11-10 18:04:19,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:19,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:19,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:19,443 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:19,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-10 18:04:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:19,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:04:19,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:19,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:19,645 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:19,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:19,648 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 32 treesize of output 41 [2024-11-10 18:04:19,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:19,688 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:19,688 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:19,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:04:19,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 93 [2024-11-10 18:04:19,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:04:19,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 161 treesize of output 65 [2024-11-10 18:04:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:19,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:19,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:19,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795597343] [2024-11-10 18:04:19,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795597343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:19,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:19,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:04:19,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520717136] [2024-11-10 18:04:19,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:19,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:04:19,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:19,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:04:19,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:04:20,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 126 [2024-11-10 18:04:20,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 111 transitions, 614 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:20,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:20,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 126 [2024-11-10 18:04:20,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:22,247 INFO L124 PetriNetUnfolderBase]: 2552/4709 cut-off events. [2024-11-10 18:04:22,247 INFO L125 PetriNetUnfolderBase]: For 11707/11707 co-relation queries the response was YES. [2024-11-10 18:04:22,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15432 conditions, 4709 events. 2552/4709 cut-off events. For 11707/11707 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 31322 event pairs, 1634 based on Foata normal form. 140/4841 useless extension candidates. Maximal degree in co-relation 11208. Up to 3823 conditions per place. [2024-11-10 18:04:22,279 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 108 selfloop transitions, 27 changer transitions 0/162 dead transitions. [2024-11-10 18:04:22,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 162 transitions, 1186 flow [2024-11-10 18:04:22,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:04:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:04:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 386 transitions. [2024-11-10 18:04:22,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5105820105820106 [2024-11-10 18:04:22,282 INFO L175 Difference]: Start difference. First operand has 125 places, 111 transitions, 614 flow. Second operand 6 states and 386 transitions. [2024-11-10 18:04:22,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 162 transitions, 1186 flow [2024-11-10 18:04:22,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 162 transitions, 1137 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 18:04:22,312 INFO L231 Difference]: Finished difference. Result has 128 places, 138 transitions, 882 flow [2024-11-10 18:04:22,312 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=882, PETRI_PLACES=128, PETRI_TRANSITIONS=138} [2024-11-10 18:04:22,313 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 12 predicate places. [2024-11-10 18:04:22,313 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 138 transitions, 882 flow [2024-11-10 18:04:22,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:22,313 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:22,314 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:22,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-10 18:04:22,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:22,514 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:22,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:22,515 INFO L85 PathProgramCache]: Analyzing trace with hash -579673177, now seen corresponding path program 1 times [2024-11-10 18:04:22,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:22,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525455991] [2024-11-10 18:04:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:22,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:22,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:22,519 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:22,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-10 18:04:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:22,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:04:22,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:22,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:04:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:22,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:22,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:22,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525455991] [2024-11-10 18:04:22,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525455991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:22,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:22,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:04:22,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585566403] [2024-11-10 18:04:22,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:22,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:04:22,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:22,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:04:22,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:04:22,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 126 [2024-11-10 18:04:22,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 138 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:22,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:22,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 126 [2024-11-10 18:04:22,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:23,359 INFO L124 PetriNetUnfolderBase]: 2464/4596 cut-off events. [2024-11-10 18:04:23,360 INFO L125 PetriNetUnfolderBase]: For 12047/12047 co-relation queries the response was YES. [2024-11-10 18:04:23,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16460 conditions, 4596 events. 2464/4596 cut-off events. For 12047/12047 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 30766 event pairs, 1674 based on Foata normal form. 1/4588 useless extension candidates. Maximal degree in co-relation 14575. Up to 4044 conditions per place. [2024-11-10 18:04:23,387 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 109 selfloop transitions, 5 changer transitions 0/144 dead transitions. [2024-11-10 18:04:23,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 144 transitions, 1146 flow [2024-11-10 18:04:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:04:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:04:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2024-11-10 18:04:23,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5502645502645502 [2024-11-10 18:04:23,389 INFO L175 Difference]: Start difference. First operand has 128 places, 138 transitions, 882 flow. Second operand 3 states and 208 transitions. [2024-11-10 18:04:23,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 144 transitions, 1146 flow [2024-11-10 18:04:23,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 144 transitions, 1130 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-11-10 18:04:23,421 INFO L231 Difference]: Finished difference. Result has 128 places, 136 transitions, 872 flow [2024-11-10 18:04:23,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=128, PETRI_TRANSITIONS=136} [2024-11-10 18:04:23,422 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 12 predicate places. [2024-11-10 18:04:23,422 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 136 transitions, 872 flow [2024-11-10 18:04:23,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:23,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:23,422 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:23,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-10 18:04:23,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:23,627 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:23,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:23,627 INFO L85 PathProgramCache]: Analyzing trace with hash -579673178, now seen corresponding path program 1 times [2024-11-10 18:04:23,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:23,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710810876] [2024-11-10 18:04:23,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:23,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:23,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:23,629 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:23,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-10 18:04:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:23,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:04:23,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:23,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:23,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:23,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:23,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710810876] [2024-11-10 18:04:23,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710810876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:23,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:23,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:04:23,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488151780] [2024-11-10 18:04:23,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:23,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:04:23,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:23,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:04:23,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:04:23,862 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 126 [2024-11-10 18:04:23,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 136 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:23,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:23,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 126 [2024-11-10 18:04:23,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:24,432 INFO L124 PetriNetUnfolderBase]: 2464/4589 cut-off events. [2024-11-10 18:04:24,433 INFO L125 PetriNetUnfolderBase]: For 11920/11920 co-relation queries the response was YES. [2024-11-10 18:04:24,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16415 conditions, 4589 events. 2464/4589 cut-off events. For 11920/11920 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 30693 event pairs, 1674 based on Foata normal form. 1/4581 useless extension candidates. Maximal degree in co-relation 15889. Up to 4044 conditions per place. [2024-11-10 18:04:24,463 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 109 selfloop transitions, 5 changer transitions 0/142 dead transitions. [2024-11-10 18:04:24,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 142 transitions, 1136 flow [2024-11-10 18:04:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:04:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:04:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2024-11-10 18:04:24,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5502645502645502 [2024-11-10 18:04:24,464 INFO L175 Difference]: Start difference. First operand has 128 places, 136 transitions, 872 flow. Second operand 3 states and 208 transitions. [2024-11-10 18:04:24,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 142 transitions, 1136 flow [2024-11-10 18:04:24,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 142 transitions, 1126 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:04:24,500 INFO L231 Difference]: Finished difference. Result has 126 places, 134 transitions, 868 flow [2024-11-10 18:04:24,500 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=868, PETRI_PLACES=126, PETRI_TRANSITIONS=134} [2024-11-10 18:04:24,501 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 10 predicate places. [2024-11-10 18:04:24,501 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 134 transitions, 868 flow [2024-11-10 18:04:24,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:24,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:24,501 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:24,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-10 18:04:24,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:24,702 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:24,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:24,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1418092764, now seen corresponding path program 1 times [2024-11-10 18:04:24,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:24,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136606582] [2024-11-10 18:04:24,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:24,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:24,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:24,706 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:24,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-10 18:04:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:24,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:04:24,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:25,069 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#data~1#1.base_89| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_89|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_89| (_ bv0 1))))) is different from true [2024-11-10 18:04:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:25,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:25,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:25,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136606582] [2024-11-10 18:04:25,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136606582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:25,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:25,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:04:25,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621752200] [2024-11-10 18:04:25,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:25,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:04:25,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:25,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:04:25,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-10 18:04:25,144 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 126 [2024-11-10 18:04:25,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 134 transitions, 868 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:25,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:25,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 126 [2024-11-10 18:04:25,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:26,110 INFO L124 PetriNetUnfolderBase]: 2584/4706 cut-off events. [2024-11-10 18:04:26,111 INFO L125 PetriNetUnfolderBase]: For 12177/12177 co-relation queries the response was YES. [2024-11-10 18:04:26,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17002 conditions, 4706 events. 2584/4706 cut-off events. For 12177/12177 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 30088 event pairs, 826 based on Foata normal form. 0/4702 useless extension candidates. Maximal degree in co-relation 16466. Up to 2567 conditions per place. [2024-11-10 18:04:26,143 INFO L140 encePairwiseOnDemand]: 104/126 looper letters, 122 selfloop transitions, 33 changer transitions 4/174 dead transitions. [2024-11-10 18:04:26,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 174 transitions, 1409 flow [2024-11-10 18:04:26,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:04:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:04:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2024-11-10 18:04:26,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2024-11-10 18:04:26,145 INFO L175 Difference]: Start difference. First operand has 126 places, 134 transitions, 868 flow. Second operand 5 states and 250 transitions. [2024-11-10 18:04:26,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 174 transitions, 1409 flow [2024-11-10 18:04:26,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 174 transitions, 1399 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:04:26,193 INFO L231 Difference]: Finished difference. Result has 131 places, 148 transitions, 1116 flow [2024-11-10 18:04:26,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1116, PETRI_PLACES=131, PETRI_TRANSITIONS=148} [2024-11-10 18:04:26,194 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 15 predicate places. [2024-11-10 18:04:26,194 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 148 transitions, 1116 flow [2024-11-10 18:04:26,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:26,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:26,195 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:26,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-10 18:04:26,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:26,396 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:26,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:26,397 INFO L85 PathProgramCache]: Analyzing trace with hash -409034888, now seen corresponding path program 1 times [2024-11-10 18:04:26,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:26,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566052476] [2024-11-10 18:04:26,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:26,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:26,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:26,399 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:26,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-10 18:04:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:26,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:04:26,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:26,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:26,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:26,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566052476] [2024-11-10 18:04:26,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566052476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:26,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:26,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:04:26,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151273044] [2024-11-10 18:04:26,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:26,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:04:26,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:26,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:04:26,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:04:26,591 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 126 [2024-11-10 18:04:26,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 148 transitions, 1116 flow. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:26,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:26,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 126 [2024-11-10 18:04:26,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:26,882 INFO L124 PetriNetUnfolderBase]: 225/436 cut-off events. [2024-11-10 18:04:26,882 INFO L125 PetriNetUnfolderBase]: For 1083/1083 co-relation queries the response was YES. [2024-11-10 18:04:26,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 436 events. 225/436 cut-off events. For 1083/1083 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1490 event pairs, 31 based on Foata normal form. 36/471 useless extension candidates. Maximal degree in co-relation 1655. Up to 226 conditions per place. [2024-11-10 18:04:26,885 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 65 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2024-11-10 18:04:26,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 96 transitions, 664 flow [2024-11-10 18:04:26,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:04:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:04:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2024-11-10 18:04:26,886 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-11-10 18:04:26,886 INFO L175 Difference]: Start difference. First operand has 131 places, 148 transitions, 1116 flow. Second operand 4 states and 260 transitions. [2024-11-10 18:04:26,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 96 transitions, 664 flow [2024-11-10 18:04:26,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 96 transitions, 500 flow, removed 26 selfloop flow, removed 27 redundant places. [2024-11-10 18:04:26,893 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 288 flow [2024-11-10 18:04:26,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2024-11-10 18:04:26,894 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -28 predicate places. [2024-11-10 18:04:26,894 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 288 flow [2024-11-10 18:04:26,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:26,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:26,894 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:26,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-10 18:04:27,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:27,095 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:27,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:27,096 INFO L85 PathProgramCache]: Analyzing trace with hash 176036270, now seen corresponding path program 1 times [2024-11-10 18:04:27,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:27,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863542468] [2024-11-10 18:04:27,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:27,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-11-10 18:04:27,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:27,098 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:27,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-10 18:04:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:27,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 18:04:27,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:27,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:27,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:04:27,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:27,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 18:04:27,648 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 18:04:27,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 18:04:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:27,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:27,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:27,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863542468] [2024-11-10 18:04:27,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863542468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:27,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:27,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:04:27,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171927832] [2024-11-10 18:04:27,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:27,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:04:27,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:27,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:04:27,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:04:27,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 126 [2024-11-10 18:04:27,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:27,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:27,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 126 [2024-11-10 18:04:27,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:27,936 INFO L124 PetriNetUnfolderBase]: 225/430 cut-off events. [2024-11-10 18:04:27,936 INFO L125 PetriNetUnfolderBase]: For 631/631 co-relation queries the response was YES. [2024-11-10 18:04:27,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1306 conditions, 430 events. 225/430 cut-off events. For 631/631 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1358 event pairs, 175 based on Foata normal form. 1/430 useless extension candidates. Maximal degree in co-relation 1295. Up to 412 conditions per place. [2024-11-10 18:04:27,938 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 53 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2024-11-10 18:04:27,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 70 transitions, 390 flow [2024-11-10 18:04:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:04:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:04:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2024-11-10 18:04:27,940 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-11-10 18:04:27,940 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 288 flow. Second operand 4 states and 196 transitions. [2024-11-10 18:04:27,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 70 transitions, 390 flow [2024-11-10 18:04:27,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 70 transitions, 372 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:04:27,943 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 266 flow [2024-11-10 18:04:27,943 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2024-11-10 18:04:27,943 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -34 predicate places. [2024-11-10 18:04:27,944 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 266 flow [2024-11-10 18:04:27,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:27,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:27,944 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:27,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-10 18:04:28,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:28,145 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:28,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1189541251, now seen corresponding path program 1 times [2024-11-10 18:04:28,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:28,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770336882] [2024-11-10 18:04:28,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:28,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:28,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:28,148 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:28,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-10 18:04:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:28,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:04:28,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:28,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:28,516 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-10 18:04:28,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 18:04:28,552 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 16 treesize of output 13 [2024-11-10 18:04:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:28,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:28,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:28,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770336882] [2024-11-10 18:04:28,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770336882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:28,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:28,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:04:28,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223611100] [2024-11-10 18:04:28,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:28,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:04:28,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:28,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:04:28,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:04:28,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 126 [2024-11-10 18:04:28,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:28,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:28,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 126 [2024-11-10 18:04:28,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:28,934 INFO L124 PetriNetUnfolderBase]: 225/429 cut-off events. [2024-11-10 18:04:28,934 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2024-11-10 18:04:28,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 429 events. 225/429 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1374 event pairs, 127 based on Foata normal form. 1/430 useless extension candidates. Maximal degree in co-relation 1224. Up to 294 conditions per place. [2024-11-10 18:04:28,936 INFO L140 encePairwiseOnDemand]: 121/126 looper letters, 57 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2024-11-10 18:04:28,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 77 transitions, 424 flow [2024-11-10 18:04:28,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:04:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:04:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2024-11-10 18:04:28,937 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-11-10 18:04:28,937 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 266 flow. Second operand 4 states and 216 transitions. [2024-11-10 18:04:28,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 77 transitions, 424 flow [2024-11-10 18:04:28,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 77 transitions, 416 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:04:28,940 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 270 flow [2024-11-10 18:04:28,940 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=81, PETRI_TRANSITIONS=69} [2024-11-10 18:04:28,940 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -35 predicate places. [2024-11-10 18:04:28,940 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 270 flow [2024-11-10 18:04:28,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:28,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:28,941 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:28,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-10 18:04:29,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:29,142 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-10 18:04:29,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:29,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1794724000, now seen corresponding path program 1 times [2024-11-10 18:04:29,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:29,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829440287] [2024-11-10 18:04:29,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:29,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:29,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:29,144 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:29,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-10 18:04:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:29,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 18:04:29,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:29,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:29,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:29,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:29,647 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:29,648 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:29,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-10 18:04:29,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:04:29,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 85 [2024-11-10 18:04:32,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:04:32,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 133 treesize of output 69 [2024-11-10 18:04:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:32,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:32,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:32,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829440287] [2024-11-10 18:04:32,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829440287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:32,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:32,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:04:32,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381531901] [2024-11-10 18:04:32,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:32,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:04:32,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:32,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:04:32,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=41, Unknown=1, NotChecked=0, Total=56 [2024-11-10 18:04:35,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 18:04:37,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 18:04:40,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 18:04:42,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 18:04:45,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 18:04:48,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 18:04:51,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 18:04:54,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 18:04:57,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 18:04:59,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 18:05:02,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 18:05:06,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 18:05:09,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 18:05:12,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]