./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/array02-alloca-2.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/array-memsafety/array02-alloca-2.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 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 17:15:43,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 17:15:43,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-22 17:15:43,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 17:15:43,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 17:15:43,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 17:15:43,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 17:15:43,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 17:15:43,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 17:15:43,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 17:15:43,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 17:15:43,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 17:15:43,119 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 17:15:43,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 17:15:43,120 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 17:15:43,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 17:15:43,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 17:15:43,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 17:15:43,121 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 17:15:43,121 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 17:15:43,121 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 17:15:43,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 17:15:43,121 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 17:15:43,121 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 17:15:43,122 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 17:15:43,122 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 17:15:43,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 17:15:43,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 17:15:43,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 17:15:43,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 17:15:43,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:15:43,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 17:15:43,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 17:15:43,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 17:15:43,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 17:15:43,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 17:15:43,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 17:15:43,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 17:15:43,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 17:15:43,124 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 -> 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 17:15:43,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 17:15:43,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 17:15:43,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 17:15:43,330 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 17:15:43,330 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 17:15:43,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array02-alloca-2.i [2023-11-22 17:15:44,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 17:15:44,491 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 17:15:44,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/array02-alloca-2.i [2023-11-22 17:15:44,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702197dd0/87da76b6c9ef487da66df3451c9f39e7/FLAGc35007eaf [2023-11-22 17:15:44,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702197dd0/87da76b6c9ef487da66df3451c9f39e7 [2023-11-22 17:15:44,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 17:15:44,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 17:15:44,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 17:15:44,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 17:15:44,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 17:15:44,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:15:44" (1/1) ... [2023-11-22 17:15:44,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1f9a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:44, skipping insertion in model container [2023-11-22 17:15:44,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:15:44" (1/1) ... [2023-11-22 17:15:44,559 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 17:15:44,797 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:15:44,807 ERROR L324 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) [2023-11-22 17:15:44,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@64217446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:44, skipping insertion in model container [2023-11-22 17:15:44,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 17:15:44,808 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-22 17:15:44,810 INFO L158 Benchmark]: Toolchain (without parser) took 291.30ms. Allocated memory is still 148.9MB. Free memory was 92.1MB in the beginning and 80.4MB in the end (delta: 11.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-22 17:15:44,810 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 148.9MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 17:15:44,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.75ms. Allocated memory is still 148.9MB. Free memory was 91.7MB in the beginning and 80.4MB in the end (delta: 11.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-22 17:15:44,812 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.14ms. Allocated memory is still 148.9MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.75ms. Allocated memory is still 148.9MB. Free memory was 91.7MB in the beginning and 80.4MB in the end (delta: 11.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 533]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/array-memsafety/array02-alloca-2.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 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 17:15:46,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 17:15:46,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-22 17:15:46,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 17:15:46,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 17:15:46,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 17:15:46,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 17:15:46,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 17:15:46,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 17:15:46,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 17:15:46,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 17:15:46,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 17:15:46,615 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 17:15:46,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 17:15:46,617 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 17:15:46,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 17:15:46,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 17:15:46,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 17:15:46,617 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 17:15:46,618 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 17:15:46,618 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 17:15:46,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 17:15:46,619 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 17:15:46,619 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 17:15:46,619 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 17:15:46,619 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 17:15:46,619 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 17:15:46,620 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 17:15:46,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 17:15:46,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 17:15:46,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 17:15:46,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 17:15:46,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:15:46,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 17:15:46,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 17:15:46,622 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 17:15:46,622 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 17:15:46,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 17:15:46,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 17:15:46,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 17:15:46,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 17:15:46,624 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 17:15:46,624 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 -> 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 17:15:46,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 17:15:46,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 17:15:46,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 17:15:46,920 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 17:15:46,920 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 17:15:46,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array02-alloca-2.i [2023-11-22 17:15:48,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 17:15:48,204 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 17:15:48,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/array02-alloca-2.i [2023-11-22 17:15:48,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c395205/75dea2bb7cbf4ab5a7a480da6ef788ba/FLAGfaf20975e [2023-11-22 17:15:48,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c395205/75dea2bb7cbf4ab5a7a480da6ef788ba [2023-11-22 17:15:48,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 17:15:48,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 17:15:48,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 17:15:48,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 17:15:48,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 17:15:48,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5756ed08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48, skipping insertion in model container [2023-11-22 17:15:48,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,260 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 17:15:48,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:15:48,478 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-22 17:15:48,487 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 17:15:48,534 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:15:48,541 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 17:15:48,575 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:15:48,600 INFO L206 MainTranslator]: Completed translation [2023-11-22 17:15:48,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48 WrapperNode [2023-11-22 17:15:48,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 17:15:48,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 17:15:48,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 17:15:48,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 17:15:48,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,649 INFO L138 Inliner]: procedures = 117, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2023-11-22 17:15:48,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 17:15:48,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 17:15:48,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 17:15:48,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 17:15:48,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,660 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,670 INFO L189 HeapSplitter]: Split 7 memory accesses to 1 slices as follows [7] [2023-11-22 17:15:48,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 17:15:48,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 17:15:48,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 17:15:48,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 17:15:48,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48" (1/1) ... [2023-11-22 17:15:48,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:15:48,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 17:15:48,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 17:15:48,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 17:15:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-22 17:15:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 17:15:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 17:15:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-22 17:15:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 17:15:48,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 17:15:48,864 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 17:15:48,866 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 17:15:49,111 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 17:15:49,154 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 17:15:49,156 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-22 17:15:49,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:15:49 BoogieIcfgContainer [2023-11-22 17:15:49,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 17:15:49,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 17:15:49,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 17:15:49,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 17:15:49,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:15:48" (1/3) ... [2023-11-22 17:15:49,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272317c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:15:49, skipping insertion in model container [2023-11-22 17:15:49,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:48" (2/3) ... [2023-11-22 17:15:49,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272317c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:15:49, skipping insertion in model container [2023-11-22 17:15:49,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:15:49" (3/3) ... [2023-11-22 17:15:49,165 INFO L112 eAbstractionObserver]: Analyzing ICFG array02-alloca-2.i [2023-11-22 17:15:49,178 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 17:15:49,179 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2023-11-22 17:15:49,221 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 17:15:49,228 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@3c9385f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 17:15:49,228 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-22 17:15:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 33 states have internal predecessors, (42), 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) [2023-11-22 17:15:49,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-22 17:15:49,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:49,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-22 17:15:49,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:49,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash 116521796, now seen corresponding path program 1 times [2023-11-22 17:15:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:49,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327672194] [2023-11-22 17:15:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:49,258 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 [2023-11-22 17:15:49,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:49,261 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) [2023-11-22 17:15:49,292 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 [2023-11-22 17:15:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:15:49,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 17:15:49,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:49,391 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 [2023-11-22 17:15:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:15:49,407 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:15:49,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:49,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327672194] [2023-11-22 17:15:49,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327672194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:15:49,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:15:49,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:15:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340958678] [2023-11-22 17:15:49,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:15:49,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:15:49,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:49,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:15:49,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:15:49,441 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 33 states have internal predecessors, (42), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-22 17:15:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:49,502 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-11-22 17:15:49,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:15:49,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2023-11-22 17:15:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:49,511 INFO L225 Difference]: With dead ends: 33 [2023-11-22 17:15:49,511 INFO L226 Difference]: Without dead ends: 32 [2023-11-22 17:15:49,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:15:49,516 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:49,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 21 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:15:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-22 17:15:49,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-22 17:15:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 2.0) internal successors, (36), 31 states have internal predecessors, (36), 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) [2023-11-22 17:15:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-11-22 17:15:49,542 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 5 [2023-11-22 17:15:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:49,542 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-22 17:15:49,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-22 17:15:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-11-22 17:15:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-22 17:15:49,543 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:49,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-22 17:15:49,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-22 17:15:49,746 WARN L477 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 [2023-11-22 17:15:49,747 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:49,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:49,747 INFO L85 PathProgramCache]: Analyzing trace with hash 116521797, now seen corresponding path program 1 times [2023-11-22 17:15:49,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:49,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463955266] [2023-11-22 17:15:49,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:49,749 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 [2023-11-22 17:15:49,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:49,750 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) [2023-11-22 17:15:49,772 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 [2023-11-22 17:15:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:15:49,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 17:15:49,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:49,804 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 [2023-11-22 17:15:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:15:49,821 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:15:49,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:49,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463955266] [2023-11-22 17:15:49,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463955266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:15:49,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:15:49,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 17:15:49,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411189796] [2023-11-22 17:15:49,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:15:49,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:15:49,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:49,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:15:49,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:15:49,824 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2023-11-22 17:15:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:49,971 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2023-11-22 17:15:49,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:15:49,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) Word has length 5 [2023-11-22 17:15:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:49,973 INFO L225 Difference]: With dead ends: 64 [2023-11-22 17:15:49,976 INFO L226 Difference]: Without dead ends: 64 [2023-11-22 17:15:49,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:15:49,977 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 35 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:49,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 108 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:15:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-22 17:15:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 35. [2023-11-22 17:15:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 34 states have internal predecessors, (39), 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) [2023-11-22 17:15:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-22 17:15:49,982 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 5 [2023-11-22 17:15:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:49,982 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-22 17:15:49,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2023-11-22 17:15:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-22 17:15:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-22 17:15:49,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:49,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-22 17:15:49,987 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 (3)] Forceful destruction successful, exit code 0 [2023-11-22 17:15:50,185 WARN L477 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 [2023-11-22 17:15:50,185 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:50,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:50,186 INFO L85 PathProgramCache]: Analyzing trace with hash 116581379, now seen corresponding path program 1 times [2023-11-22 17:15:50,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:50,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385431583] [2023-11-22 17:15:50,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:50,186 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 [2023-11-22 17:15:50,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:50,189 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) [2023-11-22 17:15:50,220 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 [2023-11-22 17:15:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:15:50,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-22 17:15:50,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:50,266 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 8 treesize of output 7 [2023-11-22 17:15:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:15:50,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:15:50,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:50,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385431583] [2023-11-22 17:15:50,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385431583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:15:50,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:15:50,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 17:15:50,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126824675] [2023-11-22 17:15:50,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:15:50,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:15:50,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:50,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:15:50,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:15:50,309 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2023-11-22 17:15:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:50,399 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2023-11-22 17:15:50,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:15:50,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) Word has length 5 [2023-11-22 17:15:50,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:50,401 INFO L225 Difference]: With dead ends: 37 [2023-11-22 17:15:50,401 INFO L226 Difference]: Without dead ends: 37 [2023-11-22 17:15:50,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:15:50,402 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:50,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 43 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:15:50,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-22 17:15:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2023-11-22 17:15:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.9) internal successors, (38), 33 states have internal predecessors, (38), 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) [2023-11-22 17:15:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-11-22 17:15:50,404 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 5 [2023-11-22 17:15:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:50,405 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-11-22 17:15:50,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2023-11-22 17:15:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-11-22 17:15:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 17:15:50,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:50,405 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-11-22 17:15:50,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-22 17:15:50,607 WARN L477 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 [2023-11-22 17:15:50,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:50,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:50,608 INFO L85 PathProgramCache]: Analyzing trace with hash 308371765, now seen corresponding path program 1 times [2023-11-22 17:15:50,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:50,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737926572] [2023-11-22 17:15:50,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:50,608 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 [2023-11-22 17:15:50,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:50,609 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) [2023-11-22 17:15:50,615 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 [2023-11-22 17:15:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:15:50,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 17:15:50,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:15:50,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:15:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:15:50,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:50,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737926572] [2023-11-22 17:15:50,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737926572] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:15:50,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:15:50,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-22 17:15:50,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348409118] [2023-11-22 17:15:50,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:15:50,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 17:15:50,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:50,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 17:15:50,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:15:50,714 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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) [2023-11-22 17:15:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:50,782 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2023-11-22 17:15:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:15:50,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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) Word has length 7 [2023-11-22 17:15:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:50,784 INFO L225 Difference]: With dead ends: 64 [2023-11-22 17:15:50,784 INFO L226 Difference]: Without dead ends: 64 [2023-11-22 17:15:50,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:15:50,785 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:50,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 143 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:15:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-22 17:15:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 38. [2023-11-22 17:15:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.75) internal successors, (42), 37 states have internal predecessors, (42), 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) [2023-11-22 17:15:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-11-22 17:15:50,788 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 7 [2023-11-22 17:15:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:50,788 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-11-22 17:15:50,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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) [2023-11-22 17:15:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-11-22 17:15:50,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 17:15:50,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:50,788 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-11-22 17:15:50,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-22 17:15:50,990 WARN L477 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 [2023-11-22 17:15:50,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:50,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:50,991 INFO L85 PathProgramCache]: Analyzing trace with hash 365630067, now seen corresponding path program 1 times [2023-11-22 17:15:50,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:50,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386528811] [2023-11-22 17:15:50,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:50,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:15:50,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:50,993 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) [2023-11-22 17:15:50,999 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 [2023-11-22 17:15:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:15:51,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-22 17:15:51,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:51,056 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 8 treesize of output 7 [2023-11-22 17:15:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:15:51,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:15:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:15:51,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:51,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386528811] [2023-11-22 17:15:51,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386528811] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:15:51,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:15:51,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-11-22 17:15:51,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769999722] [2023-11-22 17:15:51,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:15:51,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 17:15:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:51,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 17:15:51,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-22 17:15:51,374 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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) [2023-11-22 17:15:51,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:51,857 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2023-11-22 17:15:51,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 17:15:51,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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) Word has length 7 [2023-11-22 17:15:51,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:51,860 INFO L225 Difference]: With dead ends: 46 [2023-11-22 17:15:51,860 INFO L226 Difference]: Without dead ends: 46 [2023-11-22 17:15:51,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2023-11-22 17:15:51,861 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 49 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:51,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 56 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 17:15:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-22 17:15:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2023-11-22 17:15:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.7) internal successors, (51), 43 states have internal predecessors, (51), 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) [2023-11-22 17:15:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2023-11-22 17:15:51,865 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 7 [2023-11-22 17:15:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:51,865 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2023-11-22 17:15:51,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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) [2023-11-22 17:15:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2023-11-22 17:15:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 17:15:51,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:51,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:15:51,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-22 17:15:52,068 WARN L477 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 [2023-11-22 17:15:52,069 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:52,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash -7528988, now seen corresponding path program 1 times [2023-11-22 17:15:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:52,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042664899] [2023-11-22 17:15:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:52,069 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 [2023-11-22 17:15:52,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:52,070 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) [2023-11-22 17:15:52,071 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 [2023-11-22 17:15:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:15:52,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 17:15:52,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:52,117 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 [2023-11-22 17:15:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 17:15:52,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:15:52,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042664899] [2023-11-22 17:15:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042664899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:15:52,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:15:52,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 17:15:52,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125121033] [2023-11-22 17:15:52,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:15:52,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:15:52,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:52,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:15:52,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:15:52,144 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-22 17:15:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:52,209 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2023-11-22 17:15:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:15:52,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2023-11-22 17:15:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:52,210 INFO L225 Difference]: With dead ends: 38 [2023-11-22 17:15:52,210 INFO L226 Difference]: Without dead ends: 38 [2023-11-22 17:15:52,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:15:52,210 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:52,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 19 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:15:52,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-22 17:15:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-22 17:15:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.5) internal successors, (45), 37 states have internal predecessors, (45), 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) [2023-11-22 17:15:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2023-11-22 17:15:52,213 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 9 [2023-11-22 17:15:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:52,214 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2023-11-22 17:15:52,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-22 17:15:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2023-11-22 17:15:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 17:15:52,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:52,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:15:52,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-22 17:15:52,416 WARN L477 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 [2023-11-22 17:15:52,417 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:52,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:52,417 INFO L85 PathProgramCache]: Analyzing trace with hash -7528987, now seen corresponding path program 1 times [2023-11-22 17:15:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087431012] [2023-11-22 17:15:52,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:52,417 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 [2023-11-22 17:15:52,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:52,420 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) [2023-11-22 17:15:52,422 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 [2023-11-22 17:15:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:15:52,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 17:15:52,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:52,467 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 [2023-11-22 17:15:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 17:15:52,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:15:52,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:52,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087431012] [2023-11-22 17:15:52,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087431012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:15:52,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:15:52,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:15:52,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920446465] [2023-11-22 17:15:52,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:15:52,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:15:52,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:52,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:15:52,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:15:52,534 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2023-11-22 17:15:52,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:52,715 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2023-11-22 17:15:52,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:15:52,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) Word has length 9 [2023-11-22 17:15:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:52,716 INFO L225 Difference]: With dead ends: 69 [2023-11-22 17:15:52,716 INFO L226 Difference]: Without dead ends: 69 [2023-11-22 17:15:52,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 17:15:52,717 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 87 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:52,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 57 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 17:15:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-22 17:15:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2023-11-22 17:15:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.45) internal successors, (58), 47 states have internal predecessors, (58), 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) [2023-11-22 17:15:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2023-11-22 17:15:52,720 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 9 [2023-11-22 17:15:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:52,721 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2023-11-22 17:15:52,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2023-11-22 17:15:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2023-11-22 17:15:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 17:15:52,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:52,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:15:52,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-22 17:15:52,923 WARN L477 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 [2023-11-22 17:15:52,924 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:52,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash -816875613, now seen corresponding path program 1 times [2023-11-22 17:15:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:52,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616082172] [2023-11-22 17:15:52,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:52,925 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 [2023-11-22 17:15:52,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:52,926 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) [2023-11-22 17:15:52,928 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 [2023-11-22 17:15:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:15:52,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-22 17:15:52,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:52,971 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 8 treesize of output 7 [2023-11-22 17:15:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:15:53,080 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:15:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:15:53,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:53,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616082172] [2023-11-22 17:15:53,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616082172] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-22 17:15:53,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 17:15:53,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-22 17:15:53,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682616436] [2023-11-22 17:15:53,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:15:53,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:15:53,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:53,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:15:53,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-22 17:15:53,243 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2023-11-22 17:15:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:53,448 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2023-11-22 17:15:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:15:53,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) Word has length 9 [2023-11-22 17:15:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:53,450 INFO L225 Difference]: With dead ends: 46 [2023-11-22 17:15:53,450 INFO L226 Difference]: Without dead ends: 46 [2023-11-22 17:15:53,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-22 17:15:53,451 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:53,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 20 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 17:15:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-22 17:15:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2023-11-22 17:15:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.34375) internal successors, (43), 34 states have internal predecessors, (43), 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) [2023-11-22 17:15:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2023-11-22 17:15:53,456 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 9 [2023-11-22 17:15:53,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:53,456 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2023-11-22 17:15:53,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2023-11-22 17:15:53,456 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2023-11-22 17:15:53,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 17:15:53,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:53,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:15:53,463 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 [2023-11-22 17:15:53,663 WARN L477 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 [2023-11-22 17:15:53,664 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:53,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:53,664 INFO L85 PathProgramCache]: Analyzing trace with hash -233399099, now seen corresponding path program 1 times [2023-11-22 17:15:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:53,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002922322] [2023-11-22 17:15:53,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:53,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 [2023-11-22 17:15:53,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:53,667 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) [2023-11-22 17:15:53,669 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 [2023-11-22 17:15:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:15:53,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 17:15:53,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 17:15:53,722 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:15:53,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:53,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002922322] [2023-11-22 17:15:53,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002922322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:15:53,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:15:53,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:15:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325181539] [2023-11-22 17:15:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:15:53,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:15:53,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:53,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:15:53,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:15:53,724 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-22 17:15:53,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:53,805 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2023-11-22 17:15:53,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:15:53,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2023-11-22 17:15:53,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:53,806 INFO L225 Difference]: With dead ends: 61 [2023-11-22 17:15:53,806 INFO L226 Difference]: Without dead ends: 61 [2023-11-22 17:15:53,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:15:53,807 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:53,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 40 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:15:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-22 17:15:53,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 37. [2023-11-22 17:15:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 36 states have internal predecessors, (45), 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) [2023-11-22 17:15:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-11-22 17:15:53,810 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 10 [2023-11-22 17:15:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:53,810 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-11-22 17:15:53,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-22 17:15:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-11-22 17:15:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 17:15:53,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:53,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:15:53,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-22 17:15:54,012 WARN L477 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 [2023-11-22 17:15:54,013 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:54,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:54,013 INFO L85 PathProgramCache]: Analyzing trace with hash 446659271, now seen corresponding path program 1 times [2023-11-22 17:15:54,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:54,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164440056] [2023-11-22 17:15:54,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:54,014 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 [2023-11-22 17:15:54,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:54,015 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) [2023-11-22 17:15:54,019 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 [2023-11-22 17:15:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:15:54,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-22 17:15:54,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:15:54,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:15:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:15:54,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:54,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164440056] [2023-11-22 17:15:54,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164440056] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:15:54,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:15:54,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2023-11-22 17:15:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874909990] [2023-11-22 17:15:54,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:15:54,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 17:15:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:54,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 17:15:54,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-22 17:15:54,163 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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) [2023-11-22 17:15:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:54,383 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2023-11-22 17:15:54,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 17:15:54,384 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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) Word has length 10 [2023-11-22 17:15:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:54,385 INFO L225 Difference]: With dead ends: 63 [2023-11-22 17:15:54,385 INFO L226 Difference]: Without dead ends: 63 [2023-11-22 17:15:54,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2023-11-22 17:15:54,385 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 152 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:54,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 44 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 17:15:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-22 17:15:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2023-11-22 17:15:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.3125) internal successors, (42), 34 states have internal predecessors, (42), 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) [2023-11-22 17:15:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2023-11-22 17:15:54,387 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 10 [2023-11-22 17:15:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:54,388 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-11-22 17:15:54,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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) [2023-11-22 17:15:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2023-11-22 17:15:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-22 17:15:54,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:54,388 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2023-11-22 17:15:54,394 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 [2023-11-22 17:15:54,592 WARN L477 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 [2023-11-22 17:15:54,593 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:54,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:54,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1355052483, now seen corresponding path program 2 times [2023-11-22 17:15:54,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:54,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723021284] [2023-11-22 17:15:54,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 17:15:54,594 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 [2023-11-22 17:15:54,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:54,595 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) [2023-11-22 17:15:54,595 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 [2023-11-22 17:15:54,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 17:15:54,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 17:15:54,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-22 17:15:54,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:54,665 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 8 treesize of output 7 [2023-11-22 17:15:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:15:54,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:15:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:15:55,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:55,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723021284] [2023-11-22 17:15:55,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723021284] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:15:55,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:15:55,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-22 17:15:55,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035195191] [2023-11-22 17:15:55,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:15:55,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-22 17:15:55,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:55,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-22 17:15:55,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-11-22 17:15:55,385 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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) [2023-11-22 17:15:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:57,442 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2023-11-22 17:15:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-22 17:15:57,443 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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) Word has length 13 [2023-11-22 17:15:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:57,443 INFO L225 Difference]: With dead ends: 55 [2023-11-22 17:15:57,443 INFO L226 Difference]: Without dead ends: 55 [2023-11-22 17:15:57,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2023-11-22 17:15:57,444 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 80 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:57,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 91 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 17:15:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-22 17:15:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2023-11-22 17:15:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 46 states have internal predecessors, (60), 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) [2023-11-22 17:15:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2023-11-22 17:15:57,447 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 13 [2023-11-22 17:15:57,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:57,447 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2023-11-22 17:15:57,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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) [2023-11-22 17:15:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2023-11-22 17:15:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-22 17:15:57,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:57,448 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:15:57,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-22 17:15:57,650 WARN L477 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 [2023-11-22 17:15:57,650 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:57,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1359129047, now seen corresponding path program 1 times [2023-11-22 17:15:57,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:57,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815406127] [2023-11-22 17:15:57,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:57,651 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 [2023-11-22 17:15:57,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:57,652 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) [2023-11-22 17:15:57,652 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 [2023-11-22 17:15:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:15:57,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 17:15:57,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 17:15:57,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:15:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 17:15:57,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:57,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815406127] [2023-11-22 17:15:57,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815406127] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:15:57,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:15:57,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-22 17:15:57,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254137936] [2023-11-22 17:15:57,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:15:57,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 17:15:57,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:57,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 17:15:57,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:15:57,788 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2023-11-22 17:15:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:57,878 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2023-11-22 17:15:57,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:15:57,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) Word has length 15 [2023-11-22 17:15:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:57,879 INFO L225 Difference]: With dead ends: 62 [2023-11-22 17:15:57,879 INFO L226 Difference]: Without dead ends: 62 [2023-11-22 17:15:57,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-22 17:15:57,880 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 46 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:57,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 43 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:15:57,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-22 17:15:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2023-11-22 17:15:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 58 states have internal predecessors, (74), 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) [2023-11-22 17:15:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2023-11-22 17:15:57,882 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 15 [2023-11-22 17:15:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:57,882 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2023-11-22 17:15:57,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2023-11-22 17:15:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2023-11-22 17:15:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-22 17:15:57,883 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:57,883 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:15:57,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-22 17:15:58,085 WARN L477 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 [2023-11-22 17:15:58,085 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:58,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1924720999, now seen corresponding path program 1 times [2023-11-22 17:15:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:58,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042959271] [2023-11-22 17:15:58,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:58,086 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 [2023-11-22 17:15:58,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:58,087 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) [2023-11-22 17:15:58,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 (14)] Waiting until timeout for monitored process [2023-11-22 17:15:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:15:58,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-22 17:15:58,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:58,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-22 17:15:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 17:15:58,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:15:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 17:15:58,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:58,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042959271] [2023-11-22 17:15:58,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042959271] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:15:58,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:15:58,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-11-22 17:15:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814396402] [2023-11-22 17:15:58,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:15:58,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-22 17:15:58,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:58,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-22 17:15:58,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-22 17:15:58,631 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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) [2023-11-22 17:15:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:59,243 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2023-11-22 17:15:59,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 17:15:59,244 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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) Word has length 15 [2023-11-22 17:15:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:59,245 INFO L225 Difference]: With dead ends: 94 [2023-11-22 17:15:59,245 INFO L226 Difference]: Without dead ends: 94 [2023-11-22 17:15:59,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2023-11-22 17:15:59,245 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 232 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:59,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 34 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 17:15:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-22 17:15:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2023-11-22 17:15:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 86 states have (on average 1.313953488372093) internal successors, (113), 88 states have internal predecessors, (113), 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) [2023-11-22 17:15:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2023-11-22 17:15:59,248 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 15 [2023-11-22 17:15:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:59,249 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2023-11-22 17:15:59,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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) [2023-11-22 17:15:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2023-11-22 17:15:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-22 17:15:59,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:59,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:15:59,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-22 17:15:59,451 WARN L477 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 [2023-11-22 17:15:59,451 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:59,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:59,452 INFO L85 PathProgramCache]: Analyzing trace with hash 816672001, now seen corresponding path program 1 times [2023-11-22 17:15:59,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:59,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932315973] [2023-11-22 17:15:59,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:59,452 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 [2023-11-22 17:15:59,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:59,453 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) [2023-11-22 17:15:59,454 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 [2023-11-22 17:15:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:15:59,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 17:15:59,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:15:59,571 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~malloc12#1.base_17| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc12#1.base_17| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc12#1.base_17|)))) is different from true [2023-11-22 17:15:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 17:15:59,571 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:15:59,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:59,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932315973] [2023-11-22 17:15:59,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932315973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:15:59,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:15:59,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 17:15:59,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532954427] [2023-11-22 17:15:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:15:59,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:15:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:15:59,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:15:59,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-22 17:15:59,572 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2023-11-22 17:15:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:15:59,622 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2023-11-22 17:15:59,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:15:59,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 16 [2023-11-22 17:15:59,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:15:59,623 INFO L225 Difference]: With dead ends: 88 [2023-11-22 17:15:59,623 INFO L226 Difference]: Without dead ends: 70 [2023-11-22 17:15:59,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-11-22 17:15:59,623 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:15:59,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2023-11-22 17:15:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-22 17:15:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-11-22 17:15:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 69 states have internal predecessors, (88), 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) [2023-11-22 17:15:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2023-11-22 17:15:59,626 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 16 [2023-11-22 17:15:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:15:59,626 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2023-11-22 17:15:59,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2023-11-22 17:15:59,626 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2023-11-22 17:15:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 17:15:59,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:15:59,627 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1] [2023-11-22 17:15:59,638 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 [2023-11-22 17:15:59,829 WARN L477 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 [2023-11-22 17:15:59,829 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:15:59,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:15:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash -3602333, now seen corresponding path program 3 times [2023-11-22 17:15:59,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:15:59,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664044265] [2023-11-22 17:15:59,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 17:15:59,830 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 [2023-11-22 17:15:59,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:15:59,831 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) [2023-11-22 17:15:59,832 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 [2023-11-22 17:16:00,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-22 17:16:00,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 17:16:00,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-22 17:16:00,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:16:00,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 8 treesize of output 7 [2023-11-22 17:16:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:16:00,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:16:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:16:01,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:16:01,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664044265] [2023-11-22 17:16:01,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664044265] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:16:01,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:16:01,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-11-22 17:16:01,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887288612] [2023-11-22 17:16:01,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:16:01,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-22 17:16:01,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:16:01,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-22 17:16:01,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2023-11-22 17:16:01,994 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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) [2023-11-22 17:16:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:16:15,393 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2023-11-22 17:16:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-22 17:16:15,393 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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) Word has length 25 [2023-11-22 17:16:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:16:15,394 INFO L225 Difference]: With dead ends: 114 [2023-11-22 17:16:15,394 INFO L226 Difference]: Without dead ends: 114 [2023-11-22 17:16:15,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=1158, Invalid=2502, Unknown=0, NotChecked=0, Total=3660 [2023-11-22 17:16:15,395 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 299 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-22 17:16:15,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 84 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-22 17:16:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-22 17:16:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2023-11-22 17:16:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 93 states have internal predecessors, (124), 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) [2023-11-22 17:16:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2023-11-22 17:16:15,398 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 25 [2023-11-22 17:16:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:16:15,398 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2023-11-22 17:16:15,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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) [2023-11-22 17:16:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2023-11-22 17:16:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-22 17:16:15,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:16:15,399 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:16:15,406 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 (16)] Forceful destruction successful, exit code 0 [2023-11-22 17:16:15,603 WARN L477 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 [2023-11-22 17:16:15,603 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:16:15,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:16:15,603 INFO L85 PathProgramCache]: Analyzing trace with hash 715779251, now seen corresponding path program 2 times [2023-11-22 17:16:15,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:16:15,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674512382] [2023-11-22 17:16:15,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 17:16:15,604 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 [2023-11-22 17:16:15,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:16:15,605 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) [2023-11-22 17:16:15,605 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 [2023-11-22 17:16:15,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 17:16:15,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 17:16:15,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-22 17:16:15,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:16:15,683 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 8 treesize of output 7 [2023-11-22 17:16:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:16:16,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:16:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:16:17,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:16:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674512382] [2023-11-22 17:16:17,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674512382] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:16:17,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:16:17,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-11-22 17:16:17,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121566483] [2023-11-22 17:16:17,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:16:17,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-22 17:16:17,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:16:17,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-22 17:16:17,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2023-11-22 17:16:17,243 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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) [2023-11-22 17:16:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:16:20,090 INFO L93 Difference]: Finished difference Result 171 states and 212 transitions. [2023-11-22 17:16:20,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-22 17:16:20,091 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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) Word has length 33 [2023-11-22 17:16:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:16:20,092 INFO L225 Difference]: With dead ends: 171 [2023-11-22 17:16:20,092 INFO L226 Difference]: Without dead ends: 157 [2023-11-22 17:16:20,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=289, Invalid=1043, Unknown=0, NotChecked=0, Total=1332 [2023-11-22 17:16:20,093 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 363 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:16:20,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 106 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 17:16:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-22 17:16:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 105. [2023-11-22 17:16:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 104 states have internal predecessors, (136), 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) [2023-11-22 17:16:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2023-11-22 17:16:20,101 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 33 [2023-11-22 17:16:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:16:20,101 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2023-11-22 17:16:20,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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) [2023-11-22 17:16:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2023-11-22 17:16:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-22 17:16:20,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:16:20,102 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-11-22 17:16:20,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-22 17:16:20,305 WARN L477 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 [2023-11-22 17:16:20,306 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:16:20,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:16:20,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1932708867, now seen corresponding path program 3 times [2023-11-22 17:16:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:16:20,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320295542] [2023-11-22 17:16:20,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 17:16:20,307 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 [2023-11-22 17:16:20,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:16:20,308 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) [2023-11-22 17:16:20,312 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 [2023-11-22 17:16:20,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-22 17:16:20,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 17:16:20,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-22 17:16:20,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:16:20,466 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 8 treesize of output 7 [2023-11-22 17:16:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-22 17:16:20,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:16:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-22 17:16:22,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:16:22,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320295542] [2023-11-22 17:16:22,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320295542] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:16:22,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:16:22,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-11-22 17:16:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105099639] [2023-11-22 17:16:22,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:16:22,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-22 17:16:22,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:16:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-22 17:16:22,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-11-22 17:16:22,204 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 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) [2023-11-22 17:16:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:16:25,184 INFO L93 Difference]: Finished difference Result 202 states and 251 transitions. [2023-11-22 17:16:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-22 17:16:25,184 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 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) Word has length 39 [2023-11-22 17:16:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:16:25,185 INFO L225 Difference]: With dead ends: 202 [2023-11-22 17:16:25,185 INFO L226 Difference]: Without dead ends: 202 [2023-11-22 17:16:25,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2023-11-22 17:16:25,186 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 435 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:16:25,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 159 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 17:16:25,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-22 17:16:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 154. [2023-11-22 17:16:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 153 states have internal predecessors, (195), 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) [2023-11-22 17:16:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 195 transitions. [2023-11-22 17:16:25,189 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 195 transitions. Word has length 39 [2023-11-22 17:16:25,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:16:25,189 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 195 transitions. [2023-11-22 17:16:25,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 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) [2023-11-22 17:16:25,189 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 195 transitions. [2023-11-22 17:16:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-22 17:16:25,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:16:25,190 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1] [2023-11-22 17:16:25,196 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 [2023-11-22 17:16:25,393 WARN L477 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 [2023-11-22 17:16:25,394 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-22 17:16:25,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:16:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash 562388387, now seen corresponding path program 4 times [2023-11-22 17:16:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:16:25,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490499080] [2023-11-22 17:16:25,395 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 17:16:25,395 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 [2023-11-22 17:16:25,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:16:25,396 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) [2023-11-22 17:16:25,412 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 [2023-11-22 17:16:25,520 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 17:16:25,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 17:16:25,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-22 17:16:25,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:16:25,539 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 8 treesize of output 7 [2023-11-22 17:16:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:16:26,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:16:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:16:32,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:16:32,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490499080] [2023-11-22 17:16:32,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490499080] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:16:32,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:16:32,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2023-11-22 17:16:32,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127863670] [2023-11-22 17:16:32,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:16:32,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-22 17:16:32,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:16:32,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-22 17:16:32,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=1972, Unknown=0, NotChecked=0, Total=2652 [2023-11-22 17:16:32,563 INFO L87 Difference]: Start difference. First operand 154 states and 195 transitions. Second operand has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 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) [2023-11-22 17:16:49,229 WARN L293 SmtUtils]: Spent 11.57s on a formula simplification that was a NOOP. DAG size: 257 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:17:09,682 WARN L293 SmtUtils]: Spent 19.59s on a formula simplification. DAG size of input: 253 DAG size of output: 252 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:17:18,136 WARN L293 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 246 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:17:36,909 WARN L293 SmtUtils]: Spent 17.84s on a formula simplification. DAG size of input: 242 DAG size of output: 241 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:17:47,851 WARN L293 SmtUtils]: Spent 9.89s on a formula simplification that was a NOOP. DAG size: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:18:08,348 WARN L293 SmtUtils]: Spent 19.20s on a formula simplification. DAG size of input: 231 DAG size of output: 230 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:18:16,091 WARN L293 SmtUtils]: Spent 6.39s on a formula simplification that was a NOOP. DAG size: 225 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:18:31,818 WARN L293 SmtUtils]: Spent 14.66s on a formula simplification. DAG size of input: 221 DAG size of output: 220 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:18:43,053 WARN L293 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:18:55,926 WARN L293 SmtUtils]: Spent 11.51s on a formula simplification. DAG size of input: 210 DAG size of output: 209 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:19:12,292 WARN L293 SmtUtils]: Spent 9.32s on a formula simplification. DAG size of input: 199 DAG size of output: 198 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:19:18,121 WARN L293 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 192 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:19:28,195 WARN L293 SmtUtils]: Spent 9.16s on a formula simplification. DAG size of input: 188 DAG size of output: 187 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:19:40,824 WARN L293 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 178 DAG size of output: 177 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:19:53,516 WARN L293 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 167 DAG size of output: 166 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 17:20:11,304 WARN L293 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 145 DAG size of output: 144 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15