./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.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 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:16:15,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:16:15,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 16:16:15,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:16:15,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:16:15,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:16:15,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:16:15,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:16:15,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:16:15,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:16:15,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:16:15,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:16:15,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:16:15,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:16:15,547 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:16:15,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:16:15,548 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:16:15,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:16:15,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:16:15,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:16:15,549 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:16:15,553 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:16:15,553 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:16:15,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:16:15,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:16:15,554 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:16:15,554 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:16:15,555 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:16:15,555 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:16:15,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:16:15,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:16:15,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:16:15,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:16:15,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:16:15,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:16:15,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:16:15,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:16:15,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:16:15,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:16:15,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:16:15,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:16:15,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:16:15,560 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 -> 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e [2024-11-12 16:16:15,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:16:15,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:16:15,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:16:15,844 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:16:15,845 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:16:15,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2024-11-12 16:16:17,256 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:16:17,519 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:16:17,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2024-11-12 16:16:17,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cf48db32/0b66d650d7194e3bbc14551c975ef21a/FLAGec9c0902e [2024-11-12 16:16:17,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cf48db32/0b66d650d7194e3bbc14551c975ef21a [2024-11-12 16:16:17,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:16:17,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:16:17,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:16:17,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:16:17,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:16:17,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:16:17" (1/1) ... [2024-11-12 16:16:17,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee0f442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:17, skipping insertion in model container [2024-11-12 16:16:17,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:16:17" (1/1) ... [2024-11-12 16:16:17,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:16:18,056 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:18,056 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:18,057 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:18,058 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:18,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:16:18,118 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-12 16:16:18,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@62bbff21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:18, skipping insertion in model container [2024-11-12 16:16:18,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:16:18,119 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 16:16:18,121 INFO L158 Benchmark]: Toolchain (without parser) took 548.25ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 69.4MB in the beginning and 160.0MB in the end (delta: -90.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-11-12 16:16:18,121 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 142.6MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:16:18,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.29ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 69.1MB in the beginning and 160.0MB in the end (delta: -90.9MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-11-12 16:16:18,123 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.21ms. Allocated memory is still 142.6MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.29ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 69.1MB in the beginning and 160.0MB in the end (delta: -90.9MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1031]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.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 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:16:20,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:16:20,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 16:16:20,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:16:20,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:16:20,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:16:20,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:16:20,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:16:20,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:16:20,236 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:16:20,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:16:20,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:16:20,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:16:20,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:16:20,238 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:16:20,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:16:20,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:16:20,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:16:20,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:16:20,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:16:20,242 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:16:20,245 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:16:20,245 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:16:20,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:16:20,246 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:16:20,246 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 16:16:20,246 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:16:20,246 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 16:16:20,247 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:16:20,247 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:16:20,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:16:20,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:16:20,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:16:20,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:16:20,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:16:20,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:16:20,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:16:20,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:16:20,255 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 16:16:20,255 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 16:16:20,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:16:20,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:16:20,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:16:20,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:16:20,256 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 -> 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e [2024-11-12 16:16:20,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:16:20,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:16:20,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:16:20,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:16:20,589 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:16:20,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2024-11-12 16:16:21,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:16:22,281 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:16:22,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2024-11-12 16:16:22,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1722d494/0931a14938ce4b2887a886fe8ddeaf53/FLAGc2740a48e [2024-11-12 16:16:22,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1722d494/0931a14938ce4b2887a886fe8ddeaf53 [2024-11-12 16:16:22,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:16:22,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:16:22,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:16:22,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:16:22,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:16:22,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:16:22" (1/1) ... [2024-11-12 16:16:22,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b8e6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:22, skipping insertion in model container [2024-11-12 16:16:22,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:16:22" (1/1) ... [2024-11-12 16:16:22,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:16:22,823 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:22,823 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:22,824 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:22,824 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:22,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:16:22,894 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 16:16:22,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:16:22,932 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:22,933 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:22,933 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:22,933 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:22,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:16:22,958 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:16:22,987 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:22,987 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:22,987 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:22,987 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:16:22,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:16:23,076 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:16:23,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23 WrapperNode [2024-11-12 16:16:23,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:16:23,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:16:23,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:16:23,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:16:23,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23" (1/1) ... [2024-11-12 16:16:23,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23" (1/1) ... [2024-11-12 16:16:23,142 INFO L138 Inliner]: procedures = 274, calls = 95, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 181 [2024-11-12 16:16:23,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:16:23,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:16:23,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:16:23,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:16:23,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23" (1/1) ... [2024-11-12 16:16:23,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23" (1/1) ... [2024-11-12 16:16:23,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23" (1/1) ... [2024-11-12 16:16:23,194 INFO L175 MemorySlicer]: Split 84 memory accesses to 1 slices as follows [84]. 100 percent of accesses are in the largest equivalence class. The 70 initializations are split as follows [70]. The 10 writes are split as follows [10]. [2024-11-12 16:16:23,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23" (1/1) ... [2024-11-12 16:16:23,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23" (1/1) ... [2024-11-12 16:16:23,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23" (1/1) ... [2024-11-12 16:16:23,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23" (1/1) ... [2024-11-12 16:16:23,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23" (1/1) ... [2024-11-12 16:16:23,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23" (1/1) ... [2024-11-12 16:16:23,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:16:23,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:16:23,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:16:23,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:16:23,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23" (1/1) ... [2024-11-12 16:16:23,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:16:23,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:16:23,268 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-12 16:16:23,270 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-12 16:16:23,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 16:16:23,308 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-12 16:16:23,309 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-12 16:16:23,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 16:16:23,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 16:16:23,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 16:16:23,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-12 16:16:23,309 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 16:16:23,309 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 16:16:23,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 16:16:23,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:16:23,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 16:16:23,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:16:23,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:16:23,312 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:16:23,466 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:16:23,468 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:16:24,172 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:16:24,172 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:16:25,725 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:16:25,725 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 16:16:25,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:16:25 BoogieIcfgContainer [2024-11-12 16:16:25,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:16:25,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:16:25,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:16:25,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:16:25,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:16:22" (1/3) ... [2024-11-12 16:16:25,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2536cd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:16:25, skipping insertion in model container [2024-11-12 16:16:25,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:16:23" (2/3) ... [2024-11-12 16:16:25,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2536cd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:16:25, skipping insertion in model container [2024-11-12 16:16:25,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:16:25" (3/3) ... [2024-11-12 16:16:25,735 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_21-arrayloop2_nr.i [2024-11-12 16:16:25,750 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:16:25,751 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-12 16:16:25,751 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:16:25,829 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 16:16:25,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 178 flow [2024-11-12 16:16:25,907 INFO L124 PetriNetUnfolderBase]: 6/83 cut-off events. [2024-11-12 16:16:25,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:16:25,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 6/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 327 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2024-11-12 16:16:25,911 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 85 transitions, 178 flow [2024-11-12 16:16:25,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 172 flow [2024-11-12 16:16:25,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:16:25,932 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;@24868f39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:16:25,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-11-12 16:16:25,942 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:16:25,942 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-12 16:16:25,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:16:25,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:25,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:16:25,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:25,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:25,950 INFO L85 PathProgramCache]: Analyzing trace with hash 494206, now seen corresponding path program 1 times [2024-11-12 16:16:25,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:25,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744892217] [2024-11-12 16:16:25,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:25,963 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-12 16:16:25,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:25,966 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-12 16:16:25,968 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-12 16:16:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:26,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:16:26,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:26,211 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-12 16:16:26,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:16:26,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:26,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744892217] [2024-11-12 16:16:26,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744892217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:16:26,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:16:26,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:16:26,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360874066] [2024-11-12 16:16:26,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:16:26,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:16:26,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:26,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:16:26,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:16:26,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 85 [2024-11-12 16:16:26,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-12 16:16:26,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:26,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 85 [2024-11-12 16:16:26,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:26,824 INFO L124 PetriNetUnfolderBase]: 482/954 cut-off events. [2024-11-12 16:16:26,825 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 16:16:26,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 954 events. 482/954 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5119 event pairs, 368 based on Foata normal form. 1/856 useless extension candidates. Maximal degree in co-relation 1678. Up to 752 conditions per place. [2024-11-12 16:16:26,835 INFO L140 encePairwiseOnDemand]: 78/85 looper letters, 34 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2024-11-12 16:16:26,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 238 flow [2024-11-12 16:16:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:16:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:16:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2024-11-12 16:16:26,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638235294117647 [2024-11-12 16:16:26,888 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 172 flow. Second operand 4 states and 217 transitions. [2024-11-12 16:16:26,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 238 flow [2024-11-12 16:16:26,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:16:26,903 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 168 flow [2024-11-12 16:16:26,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2024-11-12 16:16:26,913 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -3 predicate places. [2024-11-12 16:16:26,919 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 168 flow [2024-11-12 16:16:26,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-12 16:16:26,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:26,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:16:26,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 16:16:27,120 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-12 16:16:27,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:27,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash 494207, now seen corresponding path program 1 times [2024-11-12 16:16:27,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:27,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490431453] [2024-11-12 16:16:27,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:27,123 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-12 16:16:27,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:27,126 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-12 16:16:27,128 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-12 16:16:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:27,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 16:16:27,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:27,314 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-12 16:16:27,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:16:27,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:27,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490431453] [2024-11-12 16:16:27,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490431453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:16:27,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:16:27,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:16:27,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930099069] [2024-11-12 16:16:27,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:16:27,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:16:27,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:27,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:16:27,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:16:27,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 85 [2024-11-12 16:16:27,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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-12 16:16:27,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:27,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 85 [2024-11-12 16:16:27,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:27,854 INFO L124 PetriNetUnfolderBase]: 483/959 cut-off events. [2024-11-12 16:16:27,854 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 16:16:27,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 959 events. 483/959 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5059 event pairs, 368 based on Foata normal form. 3/864 useless extension candidates. Maximal degree in co-relation 1718. Up to 757 conditions per place. [2024-11-12 16:16:27,862 INFO L140 encePairwiseOnDemand]: 77/85 looper letters, 38 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2024-11-12 16:16:27,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 83 transitions, 266 flow [2024-11-12 16:16:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:16:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:16:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2024-11-12 16:16:27,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-11-12 16:16:27,870 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 168 flow. Second operand 4 states and 230 transitions. [2024-11-12 16:16:27,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 83 transitions, 266 flow [2024-11-12 16:16:27,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 83 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:16:27,876 INFO L231 Difference]: Finished difference. Result has 83 places, 83 transitions, 201 flow [2024-11-12 16:16:27,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=83, PETRI_TRANSITIONS=83} [2024-11-12 16:16:27,878 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2024-11-12 16:16:27,878 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 83 transitions, 201 flow [2024-11-12 16:16:27,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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-12 16:16:27,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:27,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:16:27,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 16:16:28,083 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-12 16:16:28,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:28,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1838436750, now seen corresponding path program 1 times [2024-11-12 16:16:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919019827] [2024-11-12 16:16:28,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:28,085 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-12 16:16:28,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:28,087 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-12 16:16:28,088 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-12 16:16:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:28,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 16:16:28,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:28,267 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-12 16:16:28,280 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-12 16:16:28,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:16:28,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:28,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919019827] [2024-11-12 16:16:28,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919019827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:16:28,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:16:28,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:16:28,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853078099] [2024-11-12 16:16:28,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:16:28,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:16:28,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:28,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:16:28,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:16:28,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 85 [2024-11-12 16:16:28,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 83 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-12 16:16:28,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:28,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 85 [2024-11-12 16:16:28,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:28,708 INFO L124 PetriNetUnfolderBase]: 483/958 cut-off events. [2024-11-12 16:16:28,709 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 16:16:28,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 958 events. 483/958 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5062 event pairs, 368 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 1724. Up to 753 conditions per place. [2024-11-12 16:16:28,716 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 36 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2024-11-12 16:16:28,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 277 flow [2024-11-12 16:16:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:16:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:16:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2024-11-12 16:16:28,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7176470588235294 [2024-11-12 16:16:28,719 INFO L175 Difference]: Start difference. First operand has 83 places, 83 transitions, 201 flow. Second operand 3 states and 183 transitions. [2024-11-12 16:16:28,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 277 flow [2024-11-12 16:16:28,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:16:28,721 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 202 flow [2024-11-12 16:16:28,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2024-11-12 16:16:28,722 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2024-11-12 16:16:28,723 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 202 flow [2024-11-12 16:16:28,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-12 16:16:28,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:28,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:16:28,729 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-12 16:16:28,927 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-12 16:16:28,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:28,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:28,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1838436749, now seen corresponding path program 1 times [2024-11-12 16:16:28,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:28,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763143158] [2024-11-12 16:16:28,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:28,930 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-12 16:16:28,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:28,933 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-12 16:16:28,935 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-12 16:16:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:29,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:16:29,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:29,076 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-12 16:16:29,082 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-12 16:16:29,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:16:29,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:29,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763143158] [2024-11-12 16:16:29,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763143158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:16:29,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:16:29,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:16:29,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481955904] [2024-11-12 16:16:29,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:16:29,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:16:29,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:29,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:16:29,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:16:29,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 85 [2024-11-12 16:16:29,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-12 16:16:29,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:29,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 85 [2024-11-12 16:16:29,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:29,450 INFO L124 PetriNetUnfolderBase]: 483/957 cut-off events. [2024-11-12 16:16:29,450 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 16:16:29,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 957 events. 483/957 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5048 event pairs, 368 based on Foata normal form. 0/860 useless extension candidates. Maximal degree in co-relation 1723. Up to 753 conditions per place. [2024-11-12 16:16:29,455 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 36 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-11-12 16:16:29,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 81 transitions, 278 flow [2024-11-12 16:16:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:16:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:16:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2024-11-12 16:16:29,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7176470588235294 [2024-11-12 16:16:29,457 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 202 flow. Second operand 3 states and 183 transitions. [2024-11-12 16:16:29,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 81 transitions, 278 flow [2024-11-12 16:16:29,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 81 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:16:29,459 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 200 flow [2024-11-12 16:16:29,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2024-11-12 16:16:29,460 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -2 predicate places. [2024-11-12 16:16:29,460 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 200 flow [2024-11-12 16:16:29,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-12 16:16:29,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:29,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:16:29,467 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 (5)] Forceful destruction successful, exit code 0 [2024-11-12 16:16:29,664 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-12 16:16:29,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:29,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:29,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1156964879, now seen corresponding path program 1 times [2024-11-12 16:16:29,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:29,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322136276] [2024-11-12 16:16:29,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:29,666 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-12 16:16:29,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:29,669 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-12 16:16:29,672 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-12 16:16:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:29,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 16:16:29,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:29,811 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-12 16:16:29,837 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-12 16:16:29,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:16:29,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:29,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322136276] [2024-11-12 16:16:29,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322136276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:16:29,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:16:29,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:16:29,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724221315] [2024-11-12 16:16:29,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:16:29,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:16:29,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:29,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:16:29,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:16:29,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 85 [2024-11-12 16:16:29,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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-12 16:16:29,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:29,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 85 [2024-11-12 16:16:29,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:30,222 INFO L124 PetriNetUnfolderBase]: 483/955 cut-off events. [2024-11-12 16:16:30,222 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 16:16:30,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 955 events. 483/955 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5032 event pairs, 368 based on Foata normal form. 2/861 useless extension candidates. Maximal degree in co-relation 1721. Up to 755 conditions per place. [2024-11-12 16:16:30,227 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 37 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2024-11-12 16:16:30,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 278 flow [2024-11-12 16:16:30,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:16:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:16:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2024-11-12 16:16:30,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6441176470588236 [2024-11-12 16:16:30,229 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 200 flow. Second operand 4 states and 219 transitions. [2024-11-12 16:16:30,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 278 flow [2024-11-12 16:16:30,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:16:30,234 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 198 flow [2024-11-12 16:16:30,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2024-11-12 16:16:30,235 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -3 predicate places. [2024-11-12 16:16:30,237 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 198 flow [2024-11-12 16:16:30,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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-12 16:16:30,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:30,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:16:30,244 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-12 16:16:30,438 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-12 16:16:30,438 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:30,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:30,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1156964878, now seen corresponding path program 1 times [2024-11-12 16:16:30,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:30,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069544883] [2024-11-12 16:16:30,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:30,440 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-12 16:16:30,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:30,443 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-12 16:16:30,447 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-12 16:16:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:30,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:16:30,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:30,596 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-12 16:16:30,609 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-12 16:16:30,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:16:30,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:30,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069544883] [2024-11-12 16:16:30,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069544883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:16:30,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:16:30,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:16:30,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582944340] [2024-11-12 16:16:30,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:16:30,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:16:30,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:30,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:16:30,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:16:30,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 85 [2024-11-12 16:16:30,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-12 16:16:30,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:30,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 85 [2024-11-12 16:16:30,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:31,023 INFO L124 PetriNetUnfolderBase]: 483/953 cut-off events. [2024-11-12 16:16:31,023 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 16:16:31,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 953 events. 483/953 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5016 event pairs, 368 based on Foata normal form. 1/860 useless extension candidates. Maximal degree in co-relation 1722. Up to 753 conditions per place. [2024-11-12 16:16:31,029 INFO L140 encePairwiseOnDemand]: 78/85 looper letters, 34 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2024-11-12 16:16:31,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 77 transitions, 276 flow [2024-11-12 16:16:31,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:16:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:16:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 254 transitions. [2024-11-12 16:16:31,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5976470588235294 [2024-11-12 16:16:31,032 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 198 flow. Second operand 5 states and 254 transitions. [2024-11-12 16:16:31,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 77 transitions, 276 flow [2024-11-12 16:16:31,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:16:31,034 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 200 flow [2024-11-12 16:16:31,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2024-11-12 16:16:31,035 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -4 predicate places. [2024-11-12 16:16:31,035 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 200 flow [2024-11-12 16:16:31,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-12 16:16:31,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:31,036 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-12 16:16:31,043 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-12 16:16:31,236 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-12 16:16:31,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:31,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:31,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1156966887, now seen corresponding path program 1 times [2024-11-12 16:16:31,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:31,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501706703] [2024-11-12 16:16:31,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:31,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:16:31,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:31,239 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-12 16:16:31,241 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-12 16:16:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:31,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 16:16:31,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:31,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:16:31,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:31,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501706703] [2024-11-12 16:16:31,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501706703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:16:31,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:16:31,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:16:31,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311328084] [2024-11-12 16:16:31,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:16:31,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:16:31,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:31,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:16:31,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:16:31,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 85 [2024-11-12 16:16:31,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-12 16:16:31,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:31,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 85 [2024-11-12 16:16:31,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:31,608 INFO L124 PetriNetUnfolderBase]: 482/971 cut-off events. [2024-11-12 16:16:31,608 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-12 16:16:31,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1780 conditions, 971 events. 482/971 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5066 event pairs, 368 based on Foata normal form. 2/871 useless extension candidates. Maximal degree in co-relation 1749. Up to 753 conditions per place. [2024-11-12 16:16:31,614 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 40 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-11-12 16:16:31,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 300 flow [2024-11-12 16:16:31,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:16:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:16:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2024-11-12 16:16:31,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7490196078431373 [2024-11-12 16:16:31,616 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 200 flow. Second operand 3 states and 191 transitions. [2024-11-12 16:16:31,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 300 flow [2024-11-12 16:16:31,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 81 transitions, 280 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 16:16:31,618 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 197 flow [2024-11-12 16:16:31,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2024-11-12 16:16:31,619 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -5 predicate places. [2024-11-12 16:16:31,619 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 197 flow [2024-11-12 16:16:31,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-12 16:16:31,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:31,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:16:31,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 16:16:31,824 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-12 16:16:31,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:31,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:31,825 INFO L85 PathProgramCache]: Analyzing trace with hash -553268497, now seen corresponding path program 1 times [2024-11-12 16:16:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:31,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574277917] [2024-11-12 16:16:31,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:31,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:16:31,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:31,827 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-12 16:16:31,828 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-12 16:16:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:32,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 16:16:32,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:32,307 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-12 16:16:32,308 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 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-12 16:16:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:32,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:16:32,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:32,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574277917] [2024-11-12 16:16:32,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574277917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:16:32,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:16:32,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:16:32,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700741890] [2024-11-12 16:16:32,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:16:32,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:16:32,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:32,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:16:32,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:16:32,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 85 [2024-11-12 16:16:32,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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-12 16:16:32,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:32,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 85 [2024-11-12 16:16:32,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:32,761 INFO L124 PetriNetUnfolderBase]: 482/967 cut-off events. [2024-11-12 16:16:32,762 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-12 16:16:32,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1772 conditions, 967 events. 482/967 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5024 event pairs, 368 based on Foata normal form. 2/871 useless extension candidates. Maximal degree in co-relation 1742. Up to 755 conditions per place. [2024-11-12 16:16:32,770 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 35 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2024-11-12 16:16:32,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 271 flow [2024-11-12 16:16:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:16:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:16:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 221 transitions. [2024-11-12 16:16:32,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-11-12 16:16:32,772 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 197 flow. Second operand 4 states and 221 transitions. [2024-11-12 16:16:32,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 271 flow [2024-11-12 16:16:32,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:16:32,775 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 198 flow [2024-11-12 16:16:32,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2024-11-12 16:16:32,777 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -5 predicate places. [2024-11-12 16:16:32,777 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 198 flow [2024-11-12 16:16:32,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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-12 16:16:32,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:32,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:16:32,787 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-12 16:16:32,979 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-12 16:16:32,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:32,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:32,980 INFO L85 PathProgramCache]: Analyzing trace with hash -553268496, now seen corresponding path program 1 times [2024-11-12 16:16:32,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:32,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618006232] [2024-11-12 16:16:32,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:32,980 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-12 16:16:32,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:32,981 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-12 16:16:32,982 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-12 16:16:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:33,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 16:16:33,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:33,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 16:16:33,533 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-12 16:16:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:33,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:16:33,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:33,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618006232] [2024-11-12 16:16:33,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618006232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:16:33,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:16:33,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:16:33,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783569332] [2024-11-12 16:16:33,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:16:33,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:16:33,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:33,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:16:33,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:16:33,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 85 [2024-11-12 16:16:33,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 198 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-12 16:16:33,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:33,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 85 [2024-11-12 16:16:33,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:34,187 INFO L124 PetriNetUnfolderBase]: 483/997 cut-off events. [2024-11-12 16:16:34,187 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-12 16:16:34,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 997 events. 483/997 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5394 event pairs, 368 based on Foata normal form. 2/887 useless extension candidates. Maximal degree in co-relation 1741. Up to 761 conditions per place. [2024-11-12 16:16:34,193 INFO L140 encePairwiseOnDemand]: 79/85 looper letters, 43 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2024-11-12 16:16:34,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 82 transitions, 324 flow [2024-11-12 16:16:34,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:16:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:16:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2024-11-12 16:16:34,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6794117647058824 [2024-11-12 16:16:34,196 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 198 flow. Second operand 4 states and 231 transitions. [2024-11-12 16:16:34,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 82 transitions, 324 flow [2024-11-12 16:16:34,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 82 transitions, 310 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:16:34,198 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 236 flow [2024-11-12 16:16:34,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2024-11-12 16:16:34,199 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -3 predicate places. [2024-11-12 16:16:34,199 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 236 flow [2024-11-12 16:16:34,199 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-12 16:16:34,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:34,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:16:34,207 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 (10)] Forceful destruction successful, exit code 0 [2024-11-12 16:16:34,400 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-12 16:16:34,400 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:34,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash 28546343, now seen corresponding path program 1 times [2024-11-12 16:16:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:34,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336329974] [2024-11-12 16:16:34,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:34,401 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-12 16:16:34,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:34,403 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-12 16:16:34,404 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-12 16:16:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:34,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-12 16:16:34,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:35,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 16:16:35,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 16:16:35,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 16:16:35,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 16:16:35,206 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 16:16:35,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-12 16:16:35,222 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 16:16:35,222 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-12 16:16:35,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 16:16:35,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 16:16:35,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 16:16:35,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 16:16:35,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 16:16:35,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 16:16:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:35,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:16:35,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:35,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336329974] [2024-11-12 16:16:35,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336329974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:16:35,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:16:35,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 16:16:35,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645949771] [2024-11-12 16:16:35,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:16:35,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 16:16:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:35,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 16:16:35,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:16:36,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 85 [2024-11-12 16:16:36,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 236 flow. Second operand has 10 states, 10 states have (on average 32.0) internal successors, (320), 10 states have internal predecessors, (320), 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-12 16:16:36,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:36,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 85 [2024-11-12 16:16:36,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:36,953 INFO L124 PetriNetUnfolderBase]: 483/996 cut-off events. [2024-11-12 16:16:36,953 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-12 16:16:36,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1864 conditions, 996 events. 483/996 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5365 event pairs, 368 based on Foata normal form. 0/899 useless extension candidates. Maximal degree in co-relation 1775. Up to 774 conditions per place. [2024-11-12 16:16:36,959 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 59 selfloop transitions, 10 changer transitions 0/95 dead transitions. [2024-11-12 16:16:36,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 95 transitions, 412 flow [2024-11-12 16:16:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 16:16:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 16:16:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 379 transitions. [2024-11-12 16:16:36,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44588235294117645 [2024-11-12 16:16:36,962 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 236 flow. Second operand 10 states and 379 transitions. [2024-11-12 16:16:36,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 95 transitions, 412 flow [2024-11-12 16:16:36,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 95 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:16:36,965 INFO L231 Difference]: Finished difference. Result has 94 places, 83 transitions, 286 flow [2024-11-12 16:16:36,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=286, PETRI_PLACES=94, PETRI_TRANSITIONS=83} [2024-11-12 16:16:36,966 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 10 predicate places. [2024-11-12 16:16:36,966 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 83 transitions, 286 flow [2024-11-12 16:16:36,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.0) internal successors, (320), 10 states have internal predecessors, (320), 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-12 16:16:36,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:36,967 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:16:36,974 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-12 16:16:37,167 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-12 16:16:37,168 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:37,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash 28546342, now seen corresponding path program 1 times [2024-11-12 16:16:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:37,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97643400] [2024-11-12 16:16:37,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:37,169 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-12 16:16:37,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:37,170 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-12 16:16:37,171 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-12 16:16:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:37,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 16:16:37,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:37,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 11 treesize of output 7 [2024-11-12 16:16:37,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2024-11-12 16:16:37,872 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 16:16:37,872 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-12 16:16:37,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-12 16:16:37,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-12 16:16:37,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 16:16:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:37,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:16:37,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:37,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97643400] [2024-11-12 16:16:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97643400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:16:37,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:16:37,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 16:16:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922608012] [2024-11-12 16:16:37,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:16:37,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 16:16:37,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:37,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 16:16:37,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:16:38,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 85 [2024-11-12 16:16:38,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 83 transitions, 286 flow. Second operand has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 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-12 16:16:38,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:38,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 85 [2024-11-12 16:16:38,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:39,640 INFO L124 PetriNetUnfolderBase]: 483/994 cut-off events. [2024-11-12 16:16:39,640 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-12 16:16:39,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 994 events. 483/994 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5362 event pairs, 368 based on Foata normal form. 0/898 useless extension candidates. Maximal degree in co-relation 1809. Up to 767 conditions per place. [2024-11-12 16:16:39,647 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 43 selfloop transitions, 18 changer transitions 0/91 dead transitions. [2024-11-12 16:16:39,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 91 transitions, 432 flow [2024-11-12 16:16:39,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 16:16:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 16:16:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 458 transitions. [2024-11-12 16:16:39,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4898395721925134 [2024-11-12 16:16:39,650 INFO L175 Difference]: Start difference. First operand has 94 places, 83 transitions, 286 flow. Second operand 11 states and 458 transitions. [2024-11-12 16:16:39,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 91 transitions, 432 flow [2024-11-12 16:16:39,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 91 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:16:39,653 INFO L231 Difference]: Finished difference. Result has 107 places, 88 transitions, 367 flow [2024-11-12 16:16:39,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=367, PETRI_PLACES=107, PETRI_TRANSITIONS=88} [2024-11-12 16:16:39,654 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 23 predicate places. [2024-11-12 16:16:39,654 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 88 transitions, 367 flow [2024-11-12 16:16:39,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 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-12 16:16:39,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:39,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:16:39,662 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-12 16:16:39,855 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-12 16:16:39,855 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:39,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:39,856 INFO L85 PathProgramCache]: Analyzing trace with hash 884937069, now seen corresponding path program 1 times [2024-11-12 16:16:39,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:39,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689012912] [2024-11-12 16:16:39,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:39,856 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-12 16:16:39,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:39,857 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-12 16:16:39,858 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-12 16:16:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:40,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 16:16:40,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:40,019 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-12 16:16:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:40,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:16:40,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:40,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689012912] [2024-11-12 16:16:40,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689012912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:16:40,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:16:40,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:16:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801917860] [2024-11-12 16:16:40,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:16:40,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:16:40,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:40,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:16:40,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:16:40,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 85 [2024-11-12 16:16:40,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 88 transitions, 367 flow. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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-12 16:16:40,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:40,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 85 [2024-11-12 16:16:40,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:40,439 INFO L124 PetriNetUnfolderBase]: 483/986 cut-off events. [2024-11-12 16:16:40,439 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-12 16:16:40,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 986 events. 483/986 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5288 event pairs, 368 based on Foata normal form. 8/899 useless extension candidates. Maximal degree in co-relation 1815. Up to 754 conditions per place. [2024-11-12 16:16:40,447 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 39 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2024-11-12 16:16:40,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 86 transitions, 463 flow [2024-11-12 16:16:40,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:16:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:16:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2024-11-12 16:16:40,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2024-11-12 16:16:40,450 INFO L175 Difference]: Start difference. First operand has 107 places, 88 transitions, 367 flow. Second operand 4 states and 225 transitions. [2024-11-12 16:16:40,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 86 transitions, 463 flow [2024-11-12 16:16:40,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 86 transitions, 441 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-12 16:16:40,453 INFO L231 Difference]: Finished difference. Result has 103 places, 86 transitions, 363 flow [2024-11-12 16:16:40,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=103, PETRI_TRANSITIONS=86} [2024-11-12 16:16:40,455 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 19 predicate places. [2024-11-12 16:16:40,455 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 86 transitions, 363 flow [2024-11-12 16:16:40,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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-12 16:16:40,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:40,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:16:40,463 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-12 16:16:40,656 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-12 16:16:40,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:40,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash 884937068, now seen corresponding path program 1 times [2024-11-12 16:16:40,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:40,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071583880] [2024-11-12 16:16:40,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:40,658 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-12 16:16:40,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:40,661 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-12 16:16:40,663 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-12 16:16:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:40,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 16:16:40,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:40,828 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-12 16:16:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:40,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:16:40,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:40,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071583880] [2024-11-12 16:16:40,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071583880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:16:40,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:16:40,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:16:40,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196673634] [2024-11-12 16:16:40,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:16:40,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:16:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:40,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:16:40,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:16:40,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 85 [2024-11-12 16:16:40,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 86 transitions, 363 flow. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 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-12 16:16:40,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:40,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 85 [2024-11-12 16:16:40,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:41,228 INFO L124 PetriNetUnfolderBase]: 483/978 cut-off events. [2024-11-12 16:16:41,229 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2024-11-12 16:16:41,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1899 conditions, 978 events. 483/978 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5212 event pairs, 368 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 1815. Up to 754 conditions per place. [2024-11-12 16:16:41,234 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 41 selfloop transitions, 11 changer transitions 0/84 dead transitions. [2024-11-12 16:16:41,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 84 transitions, 463 flow [2024-11-12 16:16:41,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:16:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:16:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2024-11-12 16:16:41,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6441176470588236 [2024-11-12 16:16:41,237 INFO L175 Difference]: Start difference. First operand has 103 places, 86 transitions, 363 flow. Second operand 4 states and 219 transitions. [2024-11-12 16:16:41,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 84 transitions, 463 flow [2024-11-12 16:16:41,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 84 transitions, 441 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:16:41,239 INFO L231 Difference]: Finished difference. Result has 101 places, 84 transitions, 359 flow [2024-11-12 16:16:41,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=359, PETRI_PLACES=101, PETRI_TRANSITIONS=84} [2024-11-12 16:16:41,240 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 17 predicate places. [2024-11-12 16:16:41,241 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 84 transitions, 359 flow [2024-11-12 16:16:41,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 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-12 16:16:41,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:41,241 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:16:41,248 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-12 16:16:41,441 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-12 16:16:41,442 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:41,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1090895849, now seen corresponding path program 1 times [2024-11-12 16:16:41,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:41,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334077786] [2024-11-12 16:16:41,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:41,443 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-12 16:16:41,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:41,444 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-12 16:16:41,446 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-12 16:16:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:41,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:16:41,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:41,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:16:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:41,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:41,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334077786] [2024-11-12 16:16:41,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334077786] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:16:41,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:16:41,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-12 16:16:41,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352044442] [2024-11-12 16:16:41,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:16:41,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:16:41,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:41,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:16:41,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:16:41,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 85 [2024-11-12 16:16:41,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 84 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 52.833333333333336) internal successors, (317), 6 states have internal predecessors, (317), 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-12 16:16:41,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:41,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 85 [2024-11-12 16:16:41,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:41,956 INFO L124 PetriNetUnfolderBase]: 483/1028 cut-off events. [2024-11-12 16:16:41,956 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-11-12 16:16:41,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 1028 events. 483/1028 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5199 event pairs, 368 based on Foata normal form. 6/942 useless extension candidates. Maximal degree in co-relation 1941. Up to 750 conditions per place. [2024-11-12 16:16:41,969 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 54 selfloop transitions, 11 changer transitions 0/99 dead transitions. [2024-11-12 16:16:41,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 601 flow [2024-11-12 16:16:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:16:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:16:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 354 transitions. [2024-11-12 16:16:41,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6941176470588235 [2024-11-12 16:16:41,972 INFO L175 Difference]: Start difference. First operand has 101 places, 84 transitions, 359 flow. Second operand 6 states and 354 transitions. [2024-11-12 16:16:41,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 601 flow [2024-11-12 16:16:41,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 557 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:16:41,978 INFO L231 Difference]: Finished difference. Result has 107 places, 89 transitions, 425 flow [2024-11-12 16:16:41,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=107, PETRI_TRANSITIONS=89} [2024-11-12 16:16:41,979 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 23 predicate places. [2024-11-12 16:16:41,979 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 425 flow [2024-11-12 16:16:41,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.833333333333336) internal successors, (317), 6 states have internal predecessors, (317), 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-12 16:16:41,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:41,979 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:16:41,989 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-12 16:16:42,179 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-12 16:16:42,180 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:42,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1079857398, now seen corresponding path program 1 times [2024-11-12 16:16:42,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:42,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970631022] [2024-11-12 16:16:42,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:42,181 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-12 16:16:42,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:42,182 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-12 16:16:42,183 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-12 16:16:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:42,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 16:16:42,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:42,930 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-12 16:16:43,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-12 16:16:43,132 INFO L349 Elim1Store]: treesize reduction 90, result has 30.2 percent of original size [2024-11-12 16:16:43,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 52 [2024-11-12 16:16:43,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-12 16:16:43,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-12 16:16:43,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-11-12 16:16:43,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-12 16:16:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:43,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:16:43,447 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_49| (_ BitVec 32)) (v_ArrVal_574 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_49|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_49| v_ArrVal_571) (select (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_new_~p~0#1.base_49| v_ArrVal_574) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))))))) is different from false [2024-11-12 16:16:43,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:16:43,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-12 16:16:43,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:16:43,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2024-11-12 16:16:43,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-12 16:16:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:44,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:44,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970631022] [2024-11-12 16:16:44,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970631022] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:16:44,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:16:44,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-11-12 16:16:44,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542954978] [2024-11-12 16:16:44,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:16:44,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 16:16:44,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:44,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 16:16:44,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=190, Unknown=10, NotChecked=28, Total=272 [2024-11-12 16:16:45,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 85 [2024-11-12 16:16:45,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 89 transitions, 425 flow. Second operand has 17 states, 17 states have (on average 14.235294117647058) internal successors, (242), 17 states have internal predecessors, (242), 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-12 16:16:45,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:45,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 85 [2024-11-12 16:16:45,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:46,586 INFO L124 PetriNetUnfolderBase]: 1518/2684 cut-off events. [2024-11-12 16:16:46,586 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2024-11-12 16:16:46,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5341 conditions, 2684 events. 1518/2684 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15284 event pairs, 1287 based on Foata normal form. 0/1901 useless extension candidates. Maximal degree in co-relation 5234. Up to 2339 conditions per place. [2024-11-12 16:16:46,602 INFO L140 encePairwiseOnDemand]: 76/85 looper letters, 62 selfloop transitions, 22 changer transitions 0/94 dead transitions. [2024-11-12 16:16:46,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 94 transitions, 607 flow [2024-11-12 16:16:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 16:16:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 16:16:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-11-12 16:16:46,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21497326203208555 [2024-11-12 16:16:46,605 INFO L175 Difference]: Start difference. First operand has 107 places, 89 transitions, 425 flow. Second operand 11 states and 201 transitions. [2024-11-12 16:16:46,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 94 transitions, 607 flow [2024-11-12 16:16:46,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 94 transitions, 589 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-12 16:16:46,608 INFO L231 Difference]: Finished difference. Result has 115 places, 88 transitions, 447 flow [2024-11-12 16:16:46,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=447, PETRI_PLACES=115, PETRI_TRANSITIONS=88} [2024-11-12 16:16:46,609 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 31 predicate places. [2024-11-12 16:16:46,609 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 88 transitions, 447 flow [2024-11-12 16:16:46,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.235294117647058) internal successors, (242), 17 states have internal predecessors, (242), 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-12 16:16:46,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:46,610 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:16:46,620 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-12 16:16:46,810 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-12 16:16:46,810 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:46,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1079857399, now seen corresponding path program 1 times [2024-11-12 16:16:46,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:46,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045308888] [2024-11-12 16:16:46,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:16:46,812 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-12 16:16:46,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:46,813 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-12 16:16:46,814 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-12 16:16:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:16:47,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-12 16:16:47,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:47,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 16:16:47,573 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-12 16:16:47,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-12 16:16:47,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-12 16:16:47,900 INFO L349 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2024-11-12 16:16:47,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-11-12 16:16:47,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-12 16:16:47,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2024-11-12 16:16:47,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-12 16:16:48,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-12 16:16:48,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2024-11-12 16:16:48,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-12 16:16:48,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 16:16:48,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-12 16:16:48,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:48,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:16:48,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_681) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_682 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_681) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_682) |c_~#c~0.base|) .cse1)))))) is different from false [2024-11-12 16:16:48,276 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_682 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_681) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_682) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_681) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-12 16:16:48,339 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((|v_ULTIMATE.start_new_~p~0#1.base_52| (_ BitVec 32))) (or (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_676 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_new_~p~0#1.base_52| v_ArrVal_681) |c_~#c~0.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_52| v_ArrVal_676) (select (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_new_~p~0#1.base_52| v_ArrVal_682) |c_~#c~0.base|) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_52|))))) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_52| (_ BitVec 32))) (or (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_new_~p~0#1.base_52| v_ArrVal_681) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_52|))))))) is different from false [2024-11-12 16:16:48,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:16:48,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2024-11-12 16:16:48,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:16:48,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2024-11-12 16:16:48,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:16:48,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 77 [2024-11-12 16:16:48,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:16:48,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 113 [2024-11-12 16:16:48,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2024-11-12 16:16:48,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-12 16:16:48,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:16:48,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 38 [2024-11-12 16:16:48,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:16:48,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 55 [2024-11-12 16:16:48,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 16:16:51,480 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2024-11-12 16:16:51,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 1 [2024-11-12 16:16:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-12 16:16:51,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:51,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045308888] [2024-11-12 16:16:51,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045308888] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:16:51,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:16:51,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2024-11-12 16:16:51,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704493535] [2024-11-12 16:16:51,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:16:51,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 16:16:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:51,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 16:16:51,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=200, Unknown=3, NotChecked=90, Total=342 [2024-11-12 16:16:51,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 85 [2024-11-12 16:16:51,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 88 transitions, 447 flow. Second operand has 19 states, 19 states have (on average 8.0) internal successors, (152), 19 states have internal predecessors, (152), 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-12 16:16:51,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:51,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 85 [2024-11-12 16:16:51,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:55,182 INFO L124 PetriNetUnfolderBase]: 2199/3495 cut-off events. [2024-11-12 16:16:55,182 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-11-12 16:16:55,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7239 conditions, 3495 events. 2199/3495 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18247 event pairs, 1920 based on Foata normal form. 6/2091 useless extension candidates. Maximal degree in co-relation 7145. Up to 3398 conditions per place. [2024-11-12 16:16:55,201 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 63 selfloop transitions, 26 changer transitions 0/93 dead transitions. [2024-11-12 16:16:55,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 93 transitions, 639 flow [2024-11-12 16:16:55,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 16:16:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-12 16:16:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 158 transitions. [2024-11-12 16:16:55,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.13277310924369748 [2024-11-12 16:16:55,204 INFO L175 Difference]: Start difference. First operand has 115 places, 88 transitions, 447 flow. Second operand 14 states and 158 transitions. [2024-11-12 16:16:55,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 93 transitions, 639 flow [2024-11-12 16:16:55,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 93 transitions, 556 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-12 16:16:55,208 INFO L231 Difference]: Finished difference. Result has 117 places, 90 transitions, 430 flow [2024-11-12 16:16:55,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=430, PETRI_PLACES=117, PETRI_TRANSITIONS=90} [2024-11-12 16:16:55,209 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 33 predicate places. [2024-11-12 16:16:55,209 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 90 transitions, 430 flow [2024-11-12 16:16:55,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.0) internal successors, (152), 19 states have internal predecessors, (152), 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-12 16:16:55,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:55,210 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2024-11-12 16:16:55,220 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-12 16:16:55,410 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-12 16:16:55,410 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:55,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:55,411 INFO L85 PathProgramCache]: Analyzing trace with hash -735029785, now seen corresponding path program 2 times [2024-11-12 16:16:55,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:55,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430277849] [2024-11-12 16:16:55,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:16:55,412 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-12 16:16:55,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:55,415 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-12 16:16:55,416 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-12 16:16:55,959 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:16:55,959 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:16:55,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:16:55,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:16:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:56,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:16:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:16:56,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:16:56,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430277849] [2024-11-12 16:16:56,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430277849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:16:56,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:16:56,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-12 16:16:56,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077710450] [2024-11-12 16:16:56,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:16:56,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 16:16:56,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:16:56,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 16:16:56,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:16:56,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 85 [2024-11-12 16:16:56,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 90 transitions, 430 flow. Second operand has 12 states, 12 states have (on average 53.916666666666664) internal successors, (647), 12 states have internal predecessors, (647), 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-12 16:16:56,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:16:56,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 85 [2024-11-12 16:16:56,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:16:57,116 INFO L124 PetriNetUnfolderBase]: 483/1136 cut-off events. [2024-11-12 16:16:57,116 INFO L125 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2024-11-12 16:16:57,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2480 conditions, 1136 events. 483/1136 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5174 event pairs, 368 based on Foata normal form. 12/1062 useless extension candidates. Maximal degree in co-relation 2400. Up to 750 conditions per place. [2024-11-12 16:16:57,121 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 84 selfloop transitions, 23 changer transitions 0/142 dead transitions. [2024-11-12 16:16:57,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 142 transitions, 1088 flow [2024-11-12 16:16:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 16:16:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 16:16:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 687 transitions. [2024-11-12 16:16:57,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6735294117647059 [2024-11-12 16:16:57,125 INFO L175 Difference]: Start difference. First operand has 117 places, 90 transitions, 430 flow. Second operand 12 states and 687 transitions. [2024-11-12 16:16:57,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 142 transitions, 1088 flow [2024-11-12 16:16:57,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 142 transitions, 936 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-11-12 16:16:57,130 INFO L231 Difference]: Finished difference. Result has 124 places, 103 transitions, 610 flow [2024-11-12 16:16:57,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=610, PETRI_PLACES=124, PETRI_TRANSITIONS=103} [2024-11-12 16:16:57,131 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 40 predicate places. [2024-11-12 16:16:57,131 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 103 transitions, 610 flow [2024-11-12 16:16:57,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 53.916666666666664) internal successors, (647), 12 states have internal predecessors, (647), 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-12 16:16:57,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:16:57,132 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-11-12 16:16:57,152 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-12 16:16:57,332 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-12 16:16:57,332 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-12 16:16:57,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:16:57,333 INFO L85 PathProgramCache]: Analyzing trace with hash -857425945, now seen corresponding path program 3 times [2024-11-12 16:16:57,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:16:57,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39916246] [2024-11-12 16:16:57,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:16:57,335 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-12 16:16:57,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:16:57,336 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-12 16:16:57,338 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-12 16:17:07,381 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-12 16:17:07,382 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:17:07,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-12 16:17:07,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:17:07,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 16:17:07,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 16:17:07,621 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 16:17:07,621 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-12 16:17:07,628 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-12 16:17:07,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 16:17:07,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 16:17:07,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 16:17:07,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 16:17:07,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-12 16:17:07,920 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-12 16:17:07,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-11-12 16:17:08,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 16:17:08,225 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-12 16:17:08,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-12 16:17:08,240 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 16:17:08,241 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-12 16:17:08,503 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 16:17:08,503 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-12 16:17:08,508 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 20 treesize of output 13 [2024-11-12 16:17:08,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 16:17:08,839 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 16:17:08,839 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-12 16:17:08,844 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 20 treesize of output 13 [2024-11-12 16:17:08,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-12 16:17:08,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 16:17:08,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-12 16:17:08,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-12 16:17:09,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 16:17:09,168 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 16:17:09,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2024-11-12 16:17:09,189 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 16:17:09,190 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-12 16:17:09,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-12 16:17:09,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-12 16:17:09,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-12 16:17:09,449 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 16:17:09,449 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-12 16:17:09,454 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 20 treesize of output 13 [2024-11-12 16:17:09,577 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 16:17:09,578 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-12 16:17:09,582 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 20 treesize of output 13 [2024-11-12 16:17:09,707 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-12 16:17:09,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2024-11-12 16:17:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 74 proven. 452 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-12 16:17:09,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:17:10,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:17:10,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 77 [2024-11-12 16:17:15,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:17:15,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 77 [2024-11-12 16:17:17,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:17:17,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 77 [2024-11-12 16:17:18,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:17:18,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 77 [2024-11-12 16:17:19,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:17:19,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 77 [2024-11-12 16:17:21,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:17:21,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 77 [2024-11-12 16:17:30,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:17:30,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 83 [2024-11-12 16:17:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 63 proven. 291 refuted. 1 times theorem prover too weak. 193 trivial. 0 not checked. [2024-11-12 16:17:31,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:17:31,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39916246] [2024-11-12 16:17:31,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39916246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:17:31,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:17:31,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 8] total 34 [2024-11-12 16:17:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894400673] [2024-11-12 16:17:31,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:17:31,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-12 16:17:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:17:31,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-12 16:17:31,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1017, Unknown=2, NotChecked=0, Total=1260 [2024-11-12 16:17:35,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-12 16:17:39,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-12 16:17:41,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]